Abstract
Modal logics forms a family of formalisms widely used as reasoning frameworks in diverse areas of computer science. Description logics and their application to the web semantic is a notable example. Also, description logics have been recently used as a reasoning model for context-aware systems. Most reasoning algorithms for modal (de- scription) logics are based on tableau constructions. In this work, we propose a reasoning (satisability) algorithm for the multi-modal Km with converse. The algorithm is based on the nite tree model property and a Fischer-Ladner construction. We show the algorithm is sound and complete, and we provide the corresponding complexity analysis. We also present some exploratory results of a preliminary implementation of the algorithm.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
