Decidability of SHIQ with Complex Role Inclusion Axioms

Motivated by medical terminology applications, we investigate the decidability of the well known expressive DL, SHIQ, extended with role inclusion axioms (RIAs) of the form Ro S ⊆ P. We show that this extension is undecidable even when RIAs are restricted to the forms RoS ⊆ R or SoR ⊆ R,k but that decidability can be regained by further restricting RIAs to be acyclic. We present a tableau algorithm for this DL and report on its implementation, which behaves well in practise and provides important additional functionality in a medical terminology application.

[1]  M. Baldoni,et al.  A Tableau Calculus for Multimodal Logics and Some ( Un ) Decidability Results , 1998 .

[2]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[3]  Ian Horrocks,et al.  Using an Expressive Description Logic: FaCT or Fiction? , 1998, KR.

[4]  J. Davenport Editor , 1960 .

[5]  Ian Horrocks,et al.  Optimised Reasoning for SHIQ , 2002, ECAI.

[6]  Ulrike Sattler Description Logics for the Representation of Aggregated Objects , 2000, ECAI.

[7]  Lin Padgham,et al.  A Framework for Part-of Hierarchies in Terminological Logics , 1994, KR.

[8]  Manfred Schmidt-Schaubß,et al.  Subsumption in KL-ONE is undecidable , 1989, KR 1989.

[9]  Ramanathan V. Guha,et al.  Building large knowledge-based systems , 1989 .

[10]  Ramanathan V. Guha,et al.  Building Large Knowledge-Based Systems: Representation and Inference in the Cyc Project , 1990 .

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

[12]  Stefan Schulz,et al.  Parts, Locations, and Holes - Formal Reasoning about Anatomical Structures , 2001, AIME.

[13]  Phan Minh Dung,et al.  On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games , 1995, Artif. Intell..

[14]  Ian Horrocks,et al.  Practical Reasoning for Expressive Description Logics , 1999, LPAR.

[15]  Stephan Tobies PSPACE Reasoning for Graded Modal Logics , 2001, J. Log. Comput..

[16]  Stéphane Demri,et al.  The Complexity of Regularity in Grammar Logics and Related Modal Logics , 2001, Journal of Logic and Computation.

[17]  Michael Wessel,et al.  Obstacles on the Way to Qualitative Spatial Reasoning with Description Logics: Some Undecidability Results , 2001, Description Logics.

[18]  Werner Nutt,et al.  On the expressivity of feature logics with negation, functional uncertainty, and sort equations , 1993, J. Log. Lang. Inf..

[19]  Mehryar Mohri,et al.  A Rational Design for a Weighted Finite-State Transducer Library , 1997, Workshop on Implementing Automata.

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

[21]  Robert L. Berger The undecidability of the domino problem , 1966 .

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

[23]  Ian Horrocks,et al.  Experience building a Large, Re-usable Medical Ontology using a Description Logic with Transitivity and Concept Inclusions , 1997 .

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

[25]  Laura Giordano,et al.  A Tableau for Multimodal Logics and Some (Un)Decidability Results , 1998, TABLEAUX.

[26]  Maurizio Lenzerini,et al.  Boosting the Correspondence between Description Logics and Propositional Dynamic Logics , 1994, AAAI.

[27]  Ian Horrocks,et al.  The GRAIL concept modelling language for medical terminology , 1997, Artif. Intell. Medicine.

[28]  M. W. Shields An Introduction to Automata Theory , 1988 .

[29]  M. Baldoni Normal Multimodal Logics: Automatic Deduction and Logic Programming Extension , 1998 .

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

[31]  A. Mas-Colell,et al.  Microeconomic Theory , 1995 .

[32]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[33]  Manfred Schmidt-Schauß,et al.  Subsumption in KL-ONE is Undecidable , 1989, KR.

[34]  Ulrike Sattler,et al.  The Complexity of the Graded µ-Calculus , 2002, CADE.

[35]  Alan L. Rector Analysis of propagation along transitive roles: Formalisation of the GALEN experience with Medical Ontologies , 2002, Description Logics.

[36]  Ian Horrocks,et al.  DLP and FaCT , 1999, TABLEAUX.

[37]  Franz Baader Augmenting Concept Languages by Transitive Closure of Roles: An Alternative to Terminological Cycles , 1991, IJCAI.