On the Complexity of Fragments of the Modal Logic of Allen's Relations over Dense Structures

Interval temporal logics provide a natural framework for temporal reasoning about interval structures over linearly ordered domains, where intervals are taken as the primitive ontological entities. Their computational behaviour and expressive power mainly depend on two parameters: the set of modalities they feature and the linear orders over which they are interpreted. In this paper, we consider all fragments of Halpern and Shoham’s interval temporal logic HS with a decidable satisfiability problem over the class of all dense linear orders, and we provide a complete classification of them in terms of their complexity and expressiveness by solving the last two open cases.

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

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

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

[4]  Davide Bresolin,et al.  The dark side of interval temporal logic: marking the undecidability border , 2013, Annals of Mathematics and Artificial Intelligence.

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

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

[7]  Frank Wolter,et al.  Semi-qualitative Reasoning about Distances: A Preliminary Report , 2000, JELIA.

[8]  Richard T. Snodgrass,et al.  Reconciling Point-based and Interval-based Semantics in Temporal Relational Databases : A Proper Treatment of the Telic / Atelic Distinction , 2001 .

[9]  Zhou Chaochen,et al.  Duration Calculus: A Formal Approach to Real-Time Systems , 2004 .

[10]  Guido Sciavicco,et al.  On the Expressiveness of the Interval Logic of Allen's Relations Over Finite and Discrete Linear Orders , 2014, JELIA.

[11]  Rosella Gennari,et al.  An AI-Based Process for Generating Games from Flat Stories , 2013, SGAI Conf..

[12]  Shaban Laban,et al.  RISMA: A Rule-based Interval State Machine Algorithm for Alerts Generation, Performance Analysis and Monitoring Real-Time Data Processing , 2013 .

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

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

[15]  Valentin Goranko,et al.  A complete classification of the expressiveness of interval logics of Allen’s relations: the general and the dense cases , 2016, Acta Informatica.

[16]  Guido Sciavicco,et al.  A Complete Classification of the Expressiveness of Interval Logics of Allen's Relations over Dense Linear Orders , 2013, 2013 20th International Symposium on Temporal Representation and Reasoning.

[17]  Michael R. Hansen,et al.  Duration Calculus: A Formal Approach to Real-Time Systems (Monographs in Theoretical Computer Science. an Eatcs Seris) , 2004 .

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

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

[20]  Gabriele Puppis,et al.  Decidability of the interval temporal logic AA*BB* over the rationals , 2014, MFCS 2014.

[21]  MontanariAngelo,et al.  A complete classification of the expressiveness of interval logics of Allen's relations , 2016 .

[22]  Philippe Schnoebelen,et al.  Lossy Counter Machines Decidability Cheat Sheet , 2010, RP.

[23]  Michal Skrzypczak,et al.  Measure Properties of Game Tree Languages , 2014, MFCS.