Lightweight Description Logics and Branching Time: A Troublesome Marriage

We study branching-time temporal description logics (BTDLs) based on the temporal logic CTL in the presence of rigid (time-invariant) roles and general TBoxes. There is evidence that, if full CTL is combined with the classical ALC in this way, reasoning becomes undecidable. In this paper, we begin by substantiating this claim, establishing undecidability for a fragment of this combination. In view of this negative result, we then investigate BTDLs that emerge from combining fragments of CTL with lightweight DLs from the EL and DL-Lite families. We show that even rather inexpressive BTDLs based on EL exhibit very high complexity. Most notably, we identify two convex fragments which are undecidable and hard for non-elementary time, respectively. For BTDLs based on DL-LiteNbool, we obtain tight complexity bounds that range from PSPACE to EXPTIME.

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

[2]  Carsten Lutz,et al.  Temporalising Tractable Description Logics , 2007, 14th International Symposium on Temporal Representation and Reasoning (TIME'07).

[3]  Stephan Merz,et al.  Model Checking , 2000 .

[4]  Enrico Franconi,et al.  Fixpoints in Temporal Description Logics , 2011, IJCAI.

[5]  Ursula Dresdner,et al.  Computation Finite And Infinite Machines , 2016 .

[6]  D. Gabbay,et al.  Many-Dimensional Modal Logics: Theory and Applications , 2003 .

[7]  Alessandro Artale,et al.  A Cookbook for Temporal Conceptual Data Modelling with Description Logics , 2012, TOCL.

[8]  Sebastian Brandt,et al.  Reasoning in ELH w.r.t. General Concept Inclusion Axioms , 2004 .

[9]  Jean Christoph Jung,et al.  The Complexity of Decomposing Modal and First-Order Theories , 2012, 2012 27th Annual IEEE Symposium on Logic in Computer Science.

[10]  Carsten Lutz,et al.  Probabilistic Description Logics for Subjective Uncertainty , 2010, KR.

[11]  Frank Wolter,et al.  On Non-local Propositional and Weak Monodic Quantified CTL , 2004, J. Log. Comput..

[12]  Ronald Fagin,et al.  Horn clauses and database dependencies , 1982, JACM.

[13]  Carsten Lutz,et al.  Temporal Description Logics: A Survey , 2008, 2008 15th International Symposium on Temporal Representation and Reasoning.

[14]  Diego Calvanese,et al.  The DL-Lite Family and Relations , 2009, J. Artif. Intell. Res..

[15]  Larry Joseph Stockmeyer,et al.  The complexity of decision problems in automata theory and logic , 1974 .

[16]  Jean Christoph Jung,et al.  Complexity of Branching Temporal Description Logics , 2012, ECAI.

[17]  Frank Wolter,et al.  Decidable and undecidable fragments of first-order branching temporal logics , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[18]  Frank Wolter,et al.  Products of ‘transitive” modal logics , 2005, Journal of Symbolic Logic.

[19]  Carsten Lutz,et al.  Non-Uniform Data Complexity of Query Answering in Description Logics , 2012, Description Logics.

[20]  Klaus Schild,et al.  Combining Terminological Logics with Tense Logic , 1993, EPIA.

[21]  Leslie Lamport,et al.  What Good is Temporal Logic? , 1983, IFIP Congress.

[22]  Derek C. Oppen,et al.  Complexity, Convexity and Combinations of Theories , 1980, Theor. Comput. Sci..

[23]  Arne Meier,et al.  The Complexity of Satisfiability for Fragments of CTL and CTL* , 2008, Int. J. Found. Comput. Sci..

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

[25]  Enrico Franconi,et al.  A survey of temporal extensions of description logics , 2001, Annals of Mathematics and Artificial Intelligence.

[26]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[27]  Franz Baader,et al.  LTL over description logic axioms , 2008, TOCL.

[28]  Jean Christoph Jung,et al.  A Closer Look at the Probabilistic Description Logic Prob-EL , 2011, AAAI.