Adding one or more equivalence relations to the interval temporal logic

Abstract Interval temporal logics provide a general framework for temporal representation and reasoning, where classical (point-based) linear temporal logics can be recovered as special cases. In this paper, we study the effects of the addition of one or more equivalence relations to one of the most representative interval temporal logics, namely, the logic AB B ¯ of Allen's relations meets , begun by , and begins . We first prove that the satisfiability problem for the extension of AB B ¯ with one equivalence relation remains decidable over finite linear orders, but it becomes nonprimitive recursive. Then, we show that decidability is lost over N . Finally, we show that the addition of two or more equivalence relations makes finite satisfiability for the resulting logic undecidable. 1

[1]  Thomas Schwentick,et al.  Two-variable logic on data words , 2011, TOCL.

[2]  Joël Ouaknine,et al.  On the decidability and complexity of Metric Temporal Logic over finite words , 2007, Log. Methods Comput. Sci..

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

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

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

[6]  Carla Limongelli,et al.  Linear temporal logic as an executable semantics for planning languages , 2007, J. Log. Lang. Inf..

[7]  S. Rao Kosaraju,et al.  Decidability of reachability in vector addition systems (Preliminary Version) , 1982, STOC '82.

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

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

[10]  Philippe Schnoebelen,et al.  Verifying lossy channel systems has nonprimitive recursive complexity , 2002, Inf. Process. Lett..

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

[12]  Davide Bresolin,et al.  Interval temporal logics over strongly discrete linear orders: Expressiveness and complexity , 2014, Theor. Comput. Sci..

[13]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

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

[15]  Martin Otto,et al.  Small substructures and decidability issues for first-order logic with two variables , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[16]  Thomas Colcombet,et al.  Bounds in w-Regularity , 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

[17]  Richard Mayr.  Undecidable problems in unreliable computations , 2003, Theor. Comput. Sci..

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

[19]  Jakub Michaliszyn,et al.  Two-Variable First-Order Logic with Equivalence Closure , 2014, SIAM J. Comput..

[20]  Andreas Blass,et al.  Interactive Small-Step Algorithms I: Axiomatization , 2007, Log. Methods Comput. Sci..

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

[22]  Subbarao Kambhampati,et al.  When is Temporal Planning Really Temporal? , 2007, IJCAI.

[23]  Angelo Montanari,et al.  Adding two equivalence relations to the interval temporal logic AB , 2014, ICTCS.

[24]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

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

[26]  Angelo Montanari,et al.  Adding an Equivalence Relation to the Interval Logic ABB: Complexity and Expressiveness , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[27]  Phokion G. Kolaitis,et al.  On the Decision Problem for Two-Variable First-Order Logic , 1997, Bulletin of Symbolic Logic.

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

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

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

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

[32]  Davide Bresolin,et al.  On the Complexity of Fragments of the Modal Logic of Allen's Relations over Dense Structures , 2015, LATA.

[33]  Angelo Montanari,et al.  Interval Logics and ωB-Regular Languages , 2013, LATA.

[34]  Lidia Tendera,et al.  On Finite Satisfiability of Two-Variable First-Order Logic with Equivalence Relations , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[35]  Angelo Montanari,et al.  Metric Propositional Neighborhood Logic with an Equivalence Relation , 2014, TIME.

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

[37]  Gabriele Puppis,et al.  Decidability of the Interval Temporal Logic $\mathsf{A\bar{A}B\bar{B}}$ over the Rationals , 2014, MFCS.

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

[39]  Stéphane Demri,et al.  LTL with the Freeze Quantifier and Register Automata , 2006, LICS.

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