The Importance of the Past in Interval Temporal Logics: The Case of Propositional Neighborhood Logic

In our contribution, we study the effects of adding past operators to interval temporal logics. We focus our attention on the representative case of Propositional Neighborhood Logic ( $\mathsf{A \overline A}$ for short), taking into consideration different temporal domains. $\mathsf{A \overline A}$ is the proper fragment of Halpern and Shoham's modal logic of intervals with modalities for Allen's relations meets (future modality) and met by (past modality). We first prove that, unlike what happens with point-based linear temporal logic, $\mathsf{A \overline A}$ is strictly more expressive than its future fragment A. Then, we show that there is a log-space reduction from the satisfiability problem for $\mathsf{A \overline A}$ over ℤ to its satisfiability problem over ℕ. Compared to the corresponding reduction for point-based linear temporal logic, the one for $\mathsf{A \overline A}$ turns out to be much more involved. Finally, we prove that $\mathsf{A \overline A}$ is able to separate ℚ and ℝ, while A is not.

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

[2]  Davide Bresolin,et al.  Optimal Tableau Systems for Propositional Neighborhood Logic over All, Dense, and Discrete Linear Orders , 2011, TABLEAUX.

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

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

[5]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[6]  Kamal Lodaya,et al.  Sharpening the Undecidability of Interval Temporal Logic , 2000, ASIAN.

[7]  Philippe Schnoebelen,et al.  Temporal logic with forgettable past , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[8]  Benjamin Charles Moszkowski Reasoning about Digital Circuits , 1983 .

[9]  Jerzy Tiuryn,et al.  Logics of Programs , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[10]  Jouko Väänänen,et al.  Logic Colloquium '90 , 2002 .

[11]  Davide Bresolin,et al.  Tableaux for Logics of Subinterval Structures over Dense Orderings , 2010, J. Log. Comput..

[12]  Amir Pnueli,et al.  Tight bounds on the complexity of cascaded decomposition of automata , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

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

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

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

[16]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[17]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[18]  Dov M. Gabbay,et al.  The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems , 1987, Temporal Logic in Specification.

[19]  He Jifeng,et al.  Advances in Computing Science — ASIAN 2000 , 2002, Lecture Notes in Computer Science.

[20]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[21]  Frank Wolter,et al.  Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.

[22]  Nicolas Markey,et al.  Temporal logic with past is exponentially more succinct, Concurrency Column , 2003, Bull. EATCS.

[23]  Amir Pnueli,et al.  Temporal Logic in Specification , 1987, Lecture Notes in Computer Science.

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

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

[26]  S. K. Thomason Reduction of tense logic to modal logic II , 2008 .

[27]  Saharon Shelah,et al.  On the Temporal Basis of Fairness. , 1980 .

[28]  Amir Pnueli,et al.  The Glory of the Past , 1985, Logic of Programs.

[29]  Davide Bresolin,et al.  An Optimal Decision Procedure for Right Propositional Neighborhood Logic , 2006, Journal of Automated Reasoning.

[30]  D. Gabbay,et al.  Temporal expressive completeness in the presence of gaps , 1993 .

[31]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[32]  Mark Reynolds The complexity of temporal logic over the reals , 2010, Ann. Pure Appl. Log..

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

[34]  Steven K. Thomason Reduction of Tense Logic to Modal Logic. I , 1974, J. Symb. Log..

[35]  Roy Dyckhoff Automated Reasoning with Analytic Tableaux and Related Methods , 2000, Lecture Notes in Computer Science.

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

[37]  Ilya Shapirovsky On PSPACE-decidability in Transitive Modal Logic , 2004, Advances in Modal Logic.

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

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

[40]  Davide Bresolin,et al.  An Optimal Tableau-Based Decision Algorithm for Propositional Neighborhood Logic , 2007, STACS.