The complexity of finite model reasoning in description logics

We analyze the complexity of finite model reasoning in the description logic ALCQI, i.e. ALC augmented with qualifying number restrictions, inverse roles, and general TBoxes. It turns out that all relevant reasoning tasks such as concept satisfiability and ABox consistency are ExpTime-complete, regardless of whether the numbers in number restrictions are coded unarily or binarily. Thus, finite model reasoning with ALCQI is not harder than standard reasoning with ALCQI.

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

[2]  Diego Calvanese,et al.  Finite Model Reasoning in Description Logics , 1996, KR.

[3]  Diego Calvanese,et al.  Dwq : Esprit Long Term Research Project, No 22469 on the Decidability of Query Containment under Constraints on the Decidability of Query Containment under Constraints , 2022 .

[4]  Diego Calvanese,et al.  Unrestricted and finite model reasoning in class-based representation formalisms , 1996 .

[5]  Erich Grädel,et al.  Two-variable logic with counting is decidable , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

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

[7]  Maurizio Lenzerini,et al.  On The Satisfiability of Dependency Constraints in Entity-Relationship Schemata , 1987, VLDB.

[8]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[9]  Ian Pratt-Hartmann.  Complexity of the Two-Variable Fragment with (Binary-Coded) Counting Quantifiers , 2004, ArXiv.

[10]  Ian Horrocks,et al.  How to Decide Query Containment Under Constraints Using a Description Logic , 2000, LPAR.

[11]  Leszek Pacholski,et al.  Complexity of two-variable logic with counting , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

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

[13]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[14]  Bernhard Thalheim,et al.  Fundamentals of Cardinality Constraints , 1992, ER.

[15]  Moshe Y. Vardi.  Reasoning about The Past with Two-Way Automata , 1998, ICALP.

[16]  Mikolaj Bojanczyk,et al.  Two-Way Alternating Automata and Finite Models , 2002, ICALP.

[17]  Christos H. Papadimitriou,et al.  On the complexity of integer programming , 1981, JACM.

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

[19]  Maurizio Lenzerini,et al.  TBox and ABox Reasoning in Expressive Description Logics , 1996, KR.

[20]  Ian Horrocks,et al.  From SHIQ and RDF to OWL: the making of a Web Ontology Language , 2003, J. Web Semant..

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

[22]  Diego Calvanese,et al.  Making object-oriented schemas more expressive , 1994, PODS '94.

[23]  Leszek Pacholski,et al.  Complexity Results for First-Order Two-Variable Logic with Counting , 2000, SIAM J. Comput..

[24]  J.F.A.K. van Benthem,et al.  Modal logic and classical logic , 1983 .

[25]  Diego Calvanese,et al.  On the interaction between ISA and cardinality constraints , 1994, Proceedings of 1994 IEEE 10th International Conference on Data Engineering.

[26]  Diego Calvanese,et al.  Description Logics for Conceptual Data Modeling , 1998, Logics for Databases and Information Systems.

[27]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[28]  Frank van Harmelen,et al.  Reviewing the design of DAML+OIL: an ontology language for the semantic web , 2002, AAAI/IAAI.

[29]  Moshe Y. Vardi,et al.  Polynomial-time implication problems for unary inclusion dependencies , 1990, JACM.

[30]  Ulrike Sattler,et al.  The complexity of finite model reasoning in description logics , 2005, Inf. Comput..