Applications and extensions of PTIME description logics with functional constraints

We review and extend earlier work on the logic CFD, a description logic that allows terminological cycles with universal restrictions over functional roles. In particular, we consider the problem of reasoning about concept subsumption and the problem of computing certain answers for a family of attribute-connected conjunctive queries, showing that both problems are in PTIME. We then consider the effect on the complexity of these problems after adding a concept constructor that expresses concept union, or after adding a concept constructor for the bottom class. Finally, we show that adding both constructors makes both problems EXPTIME-complete.

[1]  David Toman,et al.  Adding ABoxes to a Description Logic with Uniqueness Constraints via Path Agreements , 2007, Description Logics.

[2]  Michael Randolph Garey,et al.  Johnson: "computers and intractability , 1979 .

[3]  Paul Young,et al.  An introduction to the general theory of algorithms , 1978 .

[4]  Joachim Biskup,et al.  Adding inclusion dependencies to an object-oriented data model with uniqueness constraints , 2003, Acta Informatica.

[5]  Franz Baader,et al.  Pushing the EL Envelope , 2005, IJCAI.

[6]  David Toman,et al.  Attribute Inversion in Description Logic with Path Functional Dependencies , 2004, Description Logics.

[7]  David Toman,et al.  On Attributes, Roles, and Dependencies in Description Logics and the Ackermann Case of the Decision Problem , 2001, Description Logics.

[8]  Vitaliy L. Khizder,et al.  Reasoning about Duplicate Elimination with Description Logic , 2000, Computational Logic.

[9]  David Toman,et al.  Rewriting Aggregate Queries using Description Logic , 2003, Description Logics.

[10]  Grant E. Weddell,et al.  A Theory of Functional Dependencies for Object-Oriented Data Models , 1989, DOOD.

[11]  Diego Calvanese,et al.  Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family , 2007, Journal of Automated Reasoning.

[12]  Alexander Borgida,et al.  Adding Uniqueness Constraints to Description Logics (Preliminary Report) , 1997, DOOD.

[13]  Joachim Biskup,et al.  Decomposition of Database Classes under Path Functional Dependencies and Onto Constraints , 2000, FoIKS.

[14]  Diego Calvanese,et al.  Path-Based Identification Constraints in Description Logics , 2008, KR.

[15]  David Toman,et al.  On the Interaction between Inverse Features and Path-functional Dependencies in Description Logics , 2005, IJCAI.

[16]  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 .

[17]  David Toman,et al.  On Decidability and Complexity of Description Logics with Uniqueness Constraints , 2001, Description Logics.

[18]  David Toman,et al.  On Keys and Functional Dependencies as First-Class Citizens in Description Logics , 2006, IJCAR.

[19]  Grant E. Weddell,et al.  Index Selection for Embedded Control Applications using Description Logics , 2003, Description Logics.

[20]  David Toman,et al.  On reasoning about structural equality in XML: a description logic approach , 2003, Theor. Comput. Sci..

[21]  Minoru Ito,et al.  Implication Problems for Functional Constraints on Databases Supporting Complex Objects , 1994, J. Comput. Syst. Sci..

[22]  Jeffrey D. Ullman,et al.  Principles of Database Systems , 1980 .