Prefixed Resolution: A Resolution Method for Modal and Description Logics

We provide a resolution-based proof procedure for modal and description logics that improves on previous proposals in a number of important ways. First, it avoids translations into large undecidable logics, and works directly on modal or description logic formulas instead. Second, by using labeled formulas it avoids the complexities of earlier propositional resolution-based methods for modal logic. Third, it provides a method for manipulating so-called assertional information in the description logic setting. And fourth, we believe that it combines ideas from the method of prefixes used in tableaux and resolution in such a way that some of the heuristics and optimizations devised in either field are applicable.

[1]  Bernhard Nebel,et al.  An Empirical Analysis of Optimization Techniques for Terminological Representation Systems, or Making KRIS Get a Move On , 1992, KR.

[2]  Peter F. Patel-Schneider,et al.  Optimising Propositional Modal Satisfiability for Description Logic Subsumption , 1998, AISC.

[3]  J.M.G.G. de Nivelle.  Ordering Refinements of Resolution , 1995 .

[4]  Hans de Nivelle,et al.  A Unification of Ordering Refinements of Resolution in Classical Logic , 1994, JELIA.

[5]  Klaus Schild,et al.  A Correspondence Theory for Terminological Logics: Preliminary Report , 1991, IJCAI.

[6]  Ullrich Hustadt,et al.  Issues of Decidability for Description Logics in the Framework of Resolution , 1998, FTP.

[7]  Tanel Tammet.  Using resolution for extending KL-ONE-type languages , 1995, CIKM '95.

[8]  Christian G. Fermüller,et al.  Resolution Methods for the Decision Problem , 1993, Lecture Notes in Computer Science.

[9]  Hector J. Levesque,et al.  The Tractability of Subsumption in Frame-Based Description Languages , 1984, AAAI.

[10]  Hans de Nivelle.  Resolution Decides the Guarded Fragment , 1998 .

[11]  Patrice Enjalbert,et al.  Modal Resolution in Clausal Form , 1989, Theor. Comput. Sci..

[12]  Francesco M. Donini,et al.  Deduction in Concept Languages: From Subsumption to Instance Checking , 1994, J. Log. Comput..

[13]  Grigori Mints.  Resolution calculi for modal logics , 1989 .

[14]  Hans de Nivelle,et al.  A Resolution Decision Procedure for the Guarded Fragment , 1998, CADE.

[15]  Diego Calvanese,et al.  Conjunctive Query Containment in Description Logics with n-ary Relations , 1997, Description Logics.

[16]  Gert Smolka,et al.  Attributive Concept Descriptions with Complements , 1991, Artif. Intell..

[17]  Ronald J. Brachman,et al.  An overview of the KL-ONE Knowledge Representation System , 1985 .

[18]  Luis Fariñas del Cerro.  A Simple Deduction Method for Modal Logic , 1982, Inf. Process. Lett..

[19]  Patrick Blackburn,et al.  Internalizing labelled deduction , 2000, J. Log. Comput..