The light side of interval temporal logic: the Bernays-Schönfinkel fragment of CDT

Decidability and complexity of the satisfiability problem for the logics of time intervals have been extensively studied in the recent years. Even though most interval logics turn out to be undecidable, meaningful exceptions exist, such as the logics of temporal neighborhood and (some of) the logics of the subinterval relation. In this paper, we explore a different path to decidability: instead of restricting the set of modalities or imposing severe semantic restrictions, we take the most expressive interval temporal logic studied so far, namely, Venema’s CDT, and we suitably limit the negation depth of modalities. The decidability of the satisfiability problem for the resulting fragment, called CDTBS, over the class of all linear orders, is proved by embedding it into a well-known decidable quantifier prefix class of first-order logic, namely, Bernays-Schönfinkel class. In addition, we show that CDTBS is in fact NP-complete (Bernays-Schönfinkel class is NEXPTIME-complete), and we prove its expressive completeness with respect to a suitable fragment of Bernays-Schönfinkel class. Finally, we show that any increase in the negation depth of CDTBS modalities immediately yields undecidability.

[1]  Guido Sciavicco,et al.  Non-finite Axiomatizability and Undecidability of Interval Temporal Logics with C, D, and T , 2008, CSL.

[2]  Davide Bresolin,et al.  Undecidability of Interval Temporal Logics with the Overlap Modality , 2009, 2009 16th International Symposium on Temporal Representation and Reasoning.

[3]  Yde Venema,et al.  Expressiveness and Completeness of an Interval Tense Logic , 1990, Notre Dame J. Formal Log..

[4]  Valentin Goranko,et al.  A general tableau method for propositional interval temporal logics: Theory and implementation , 2006, J. Appl. Log..

[5]  Arnim von Stechow,et al.  Semantics From Different Points of View , 1979 .

[6]  Davide Bresolin,et al.  Propositional interval neighborhood logics: Expressiveness, decidability, and undecidable extensions , 2009, Ann. Pure Appl. Log..

[7]  Yoav Shoham,et al.  A propositional modal logic of time intervals , 1991, JACM.

[8]  Wieslaw Szwast,et al.  The guarded fragment with transitive guards , 2004, Ann. Pure Appl. Log..

[9]  Valentin Goranko,et al.  A Road Map of Interval Temporal Logics and Duration Calculi , 2004, J. Appl. Non Class. Logics.

[10]  Johan van Benthem,et al.  Back and Forth Between Modal Logic and Classical Logic , 1995, Log. J. IGPL.

[11]  Gabriele Puppis,et al.  Maximal Decidable Fragments of Halpern and Shoham's Modal Logic of Intervals , 2010, ICALP.

[12]  D. Gabbay,et al.  Temporal Logic Mathematical Foundations and Computational Aspects , 1994 .

[13]  Gabriele Puppis,et al.  A Decidable Spatial Logic with Cone-Shaped Cardinal Directions , 2009, CSL.

[14]  Margus Veanes,et al.  The two-variable guarded fragment with transitive relations , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[15]  Yuri Gurevich,et al.  The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.

[16]  Davide Bresolin,et al.  What's Decidable about Halpern and Shoham's Interval Logic? The Maximal Fragment ABBL , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[17]  Valentin Goranko,et al.  Propositional Interval Neighborhood Temporal Logics , 2003, J. Univers. Comput. Sci..

[18]  Valentin Goranko,et al.  Expressiveness of the Interval Logics of Allen's Relations on the Class of All Linear Orders: Complete Classification , 2011, IJCAI.

[19]  Saharon Shelah,et al.  On the temporal analysis of fairness , 1980, POPL '80.

[20]  SOCIETY , 2008, Society.

[21]  Davide Bresolin,et al.  Metric propositional neighborhood logics on natural numbers , 2011, Software & Systems Modeling.

[22]  Jakub Michaliszyn,et al.  The Ultimate Undecidability Result for the Halpern-Shoham Logic , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[23]  Kousha Etessami,et al.  First-order logic with two variables and unary temporal logic , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[24]  James F. Allen.  Maintaining knowledge about temporal intervals , 1983, CACM.

[25]  Dov M. Gabbay,et al.  Temporal logic (vol. 1): mathematical foundations and computational aspects , 1994 .

[26]  Erich Grädel,et al.  Why are Modal Logics so Robustly Decidable? , 2001, Bull. EATCS.

[27]  Valentin Goranko,et al.  Hybrid Metric Propositional Neighborhood Logics with Interval Length Binders , 2011, Electron. Notes Theor. Comput. Sci..

[28]  Hadas Kress-Gazit,et al.  Temporal Logic Motion Planning for Mobile Robots , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[29]  Martin Otto,et al.  Two variable first-order logic over ordered domains , 2001, Journal of Symbolic Logic.

[30]  Guido Sciavicco,et al.  Decidability of the Interval Temporal Logic ABB over the Natural Numbers , 2010, STACS.

[31]  Davide Bresolin,et al.  Optimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders , 2008, JELIA.

[32]  Angelo Montanari,et al.  Extending Kamp's Theorem to Model Time Granularity , 2002, J. Log. Comput..

[33]  H. Kamp.  Events, Instants and Temporal Reference , 1979 .

[34]  J. Benthem.  DYNAMIC BITS AND PIECES , 1997 .

[35]  Davide Bresolin,et al.  Decidable and Undecidable Fragments of Halpern and Shoham's Interval Temporal Logic: Towards a Complete Classification , 2008, LPAR.

[36]  Jakub Michaliszyn,et al.  B and D Are Enough to Make the Halpern-Shoham Logic Undecidable , 2010, ICALP.

[37]  Yde Venema,et al.  A Modal Logic for Chopping Intervals , 1991, J. Log. Comput..

[38]  Dario Della Monica.  Expressiveness, decidability, and undecidability of interval temporal logic , 2011 .