Optimized Reasoning in Description Logics Using Hypertableaux

We present a novel reasoning calculus for Description Logics (DLs)--knowledge representation formalisms with applications in areas such as the Semantic Web. In order to reduce the nondeterminism due to general inclusion axioms, we base our calculus on hypertableau and hyperresolution calculi, which we extend with a blocking condition to ensure termination. To prevent the calculus from generating large models, we introduce "anywhere" pairwise blocking. Our preliminary implementation shows significant performance improvements on several well-known ontologies. To the best of our knowledge, our reasoner is currently the only one that can classify the original version of the GALEN terminology.

[1]  Ian Horrocks,et al.  Efficient Reasoning with Range and Domain Constraints , 2004, Description Logics.

[2]  Franz Baader,et al.  Cardinality Restrictions on Concepts , 1994, KI.

[3]  Christian G. Fermüller,et al.  Resolution Decision Procedures , 2001, Handbook of Automated Reasoning.

[4]  Ullrich Hustadt,et al.  A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae , 2003, CADE.

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

[6]  Peter Baumgartner,et al.  Hyper Tableaux , 1996, JELIA.

[7]  Sebastian Rudolph,et al.  Complexity Boundaries for Horn Description Logics , 2007, AAAI.

[8]  David A. McAllester,et al.  Automated Deduction - CADE-17 , 2000, Lecture Notes in Computer Science.

[9]  Alexander K. Hudek,et al.  Binary Absorption in Tableaux-Based Reasoning for Description Logics , 2006, Description Logics.

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

[11]  Jeffrey M. Bradshaw,et al.  Applying KAoS Services to Ensure Policy Compliance for Semantic Web Services Workflow Composition and Enactment , 2004, SEMWEB.

[12]  Volker Haarslev,et al.  RACER System Description , 2001, IJCAR.

[13]  Boris Motik,et al.  Data Complexity of Reasoning in Very Expressive Description Logics , 2005, IJCAI.

[14]  J. A. Robinson,et al.  Automatic Deduction with Hyper-Resolution , 1983 .

[15]  Ian Horrocks,et al.  A Description Logic with Transitive and Inverse Roles and Role Hierarchies , 1999, J. Log. Comput..

[16]  Rajeev Goré,et al.  EXPTIME Tableaux with Global Caching for Description Logics with Transitive Roles, Inverse Roles and Role Hierarchies , 2007, TABLEAUX.

[17]  Francesco M. Donini,et al.  Exptime Tableaux for ALC , 2000, Description Logics.

[18]  Jacques D. Fleuriot,et al.  IsaPlanner: A Prototype Proof Planner in Isabelle , 2003, CADE.

[19]  Bijan Parsia,et al.  Pellet: An OWL DL Reasoner , 2004, Description Logics.

[20]  Ian Horrocks,et al.  Reasoning with Individuals for the Description Logic SHIQ , 2000, CADE.

[21]  Frank Wolter,et al.  Semi-qualitative Reasoning about Distances: A Preliminary Report , 2000, JELIA.

[22]  Ian Horrocks,et al.  FaCT++ Description Logic Reasoner: System Description , 2006, IJCAR.

[23]  Diego Calvanese,et al.  The Description Logic Handbook , 2007 .

[24]  Peter F. Patel-Schneider,et al.  DLP System Description , 1998, Description Logics.

[25]  Boris Motik,et al.  Reasoning in description logics using resolution and deductive databases , 2006 .

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

[27]  Stephan Tobies,et al.  Complexity results and practical algorithms for logics in knowledge representation , 2001, ArXiv.