Complexity of Branching Temporal Description Logics

We study branching-time temporal description logics (TDLs) based on the DLs ALC and ℇL and the temporal logics CTL and CTL*. The main contributions are algorithms for satisfiability that are more direct than existing approaches, and (mostly) tight elementary complexity bounds that range from PTIME to 2EXPTIME and 3EXPTIME. A careful use of tree automata techniques allows us to obtain transparent and uniform algorithms, avoiding to deal directly with the intricacies of CTL*.

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

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

[3]  Moshe Y. Vardi.  Automata-theoretic techniques for temporal reasoning , 2007, Handbook of Modal Logic.

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

[5]  Martin Hofmann.  Proof-theoretic approach to description-logic , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

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

[7]  Orna Kupferman,et al.  Safraless decision procedures , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[8]  Alessandro Artale,et al.  Reasoning on temporal conceptual schemas with dynamic constraints , 2004, Proceedings. 11th International Symposium on Temporal Representation and Reasoning, 2004. TIME 2004..

[9]  Alessandro Artale,et al.  Past and Future of DL-Lite , 2010, AAAI.

[10]  Pierre Wolper,et al.  Automata theoretic techniques for modal logics of programs: (Extended abstract) , 1984, STOC '84.

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

[12]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

[13]  Enrico Franconi,et al.  Temporal Description Logics , 2005, Handbook of Temporal Reasoning in Artificial Intelligence.

[14]  William E. Jones,et al.  Proof of claims , 1997 .

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

[16]  Olivier Bodenreider,et al.  Comparing the Representation of Anatomy in the FMA and SNOMED CT , 2006, AMIA.

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

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

[19]  Alessandro Artale,et al.  Tailoring Temporal Description Logics for Reasoning over Temporal Conceptual Models , 2011, FroCoS.

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

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

[22]  Larry J. Stockmeyer,et al.  Improved upper and lower bounds for modal logics of programs , 1985, STOC '85.

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