Issues of Decidability for Description Logics in the Framework of Resolution

We describe two methods on the basis of which efficient resolution decision procedures can be developed for a range of description logics. The first method uses an ordering restriction and applies to the description logic ALB, which extends ALC with the top role, full role negation, role intersection, role disjunction, role converse, domain restriction, range restriction, and role hierarchies. The second method is based solely on a selection restriction and applies to reducts of ALB without the top role and role negation. The latter method can be viewed as a polynomial simulation of familiar tableaux-based decision procedures. It can also be employed for automated model generation.

[1]  Ullrich Hustadt,et al.  On Evaluating Decision Procedures for Modal Logics , 1997 .

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

[3]  Harald Ganzinger,et al.  A Resolution-Based Decision Procedure for Extensions of K4 , 1998, Advances in Modal Logic.

[4]  Alasdair Urquhart,et al.  The Complexity of Propositional Proofs , 1995, Bulletin of Symbolic Logic.

[5]  Harald Ganzinger,et al.  Ordered chaining calculi for first-order theories of transitive relations , 1998, JACM.

[6]  Larry Wos,et al.  What Is Automated Reasoning? , 1987, J. Autom. Reason..

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

[8]  Edith Hemaspaandra,et al.  The Price of Universality , 1996, Notre Dame J. Formal Log..

[9]  David A. PlaistedDepartment.  Automated Deduction Techniques for Classi cation in , 1995 .

[10]  Ian Horrocks,et al.  Optimising Tableaux Decision Procedures For Description Logics , 1997 .

[11]  H. Ganzinger,et al.  A theory of resolution , 1997 .

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

[13]  William H. Joyner.  Resolution Strategies as Decision Procedures , 1976, JACM.

[14]  Bruce Kallick.  A decision procedure based on the resolution method , 1968, IFIP Congress.

[15]  Harald Ganzinger,et al.  Ordered chaining calculi for first-order theories of binary relations , 1995 .

[16]  Christian G. Fermüller,et al.  A non-elementary speed-up in proof length by structural clause form transformation , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

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

[18]  Maarten Marx.  Mosaics and Cylindric Modal Logic of Dimension~2 , 1996, Advances in Modal Logic.

[19]  David A. Plaisted,et al.  A Structure-Preserving Clause Form Translation , 1986, J. Symb. Comput..

[20]  Ullrich Hustadt,et al.  On Evaluating Decision Procedures for Modal Logic , 1997, IJCAI.

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