Sub-propositional Fragments of the Interval Temporal Logic of Allen's Relations

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. The most influential propositional interval-based logic is probably Halpern and Shoham's Modal Logic of Time Intervals, a.k.a. HS. While most studies focused on the computational properties of the syntactic fragments that arise by considering only a subset of the set of modalities, the fragments that are obtained by weakening the propositional side have received very scarce attention. Here, we approach this problem by considering various sub-propositional fragments of HS, such as the so-called Horn, Krom, and core fragment. We prove that the Horn fragment of HS is undecidable on every interesting class of linearly ordered sets, and we briefly discuss the difficulties that arise when considering the other fragments.

[1]  Diego Calvanese,et al.  DL-Lite in the Light of First-Order Logic , 2007, AAAI.

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

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

[4]  I-Peng Lin,et al.  The Computational Complexity of Satisfiability of Temporal Horn Formulas in Propositional Linear-Time Temporal Logic , 1993, Inf. Process. Lett..

[5]  Davide Bresolin,et al.  Tableau-based decision procedures for the logics of subinterval structures over dense orderings , 2008 .

[6]  Davide Bresolin,et al.  The Dark Side of Interval Temporal Logic: Sharpening the Undecidability Border , 2011, 2011 Eighteenth International Symposium on Temporal Representation and Reasoning.

[7]  Michael Fisher,et al.  A Resolution Method for Temporal Logic , 1991, IJCAI.

[8]  A. Prasad Sistla,et al.  The complexity of propositional linear temporal logics , 1982, STOC '82.

[9]  Eitan M. Gurari,et al.  Introduction to the theory of computation , 1989 .

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

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

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

[13]  Alessandro Artale,et al.  The Complexity of Clausal Fragments of LTL , 2013, LPAR.

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

[15]  Luis Fariñas del Cerro,et al.  A Note of the Complexity of the Satisfiability of Modal Horn Clauses , 1987, J. Log. Program..

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

[17]  Davide Bresolin,et al.  Interval Temporal Logics over Strongly Discrete Linear Orders: the Complete Picture , 2012, GandALF.

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

[19]  Clare Dixon,et al.  Clausal resolution for normal modal logics , 2007, J. Algorithms.

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

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

[22]  Linh Anh Nguyen.  On the Complexity of Fragments of Modal Logics , 2004, Advances in Modal Logic.

[23]  Davide Bresolin,et al.  The light side of interval temporal logic: the Bernays-Schönfinkel fragment of CDT , 2014, 2011 Eighteenth International Symposium on Temporal Representation and Reasoning.

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

[25]  Ian Pratt-Hartmann,et al.  Temporal prepositions and their logic , 2004, Artif. Intell..

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

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

[28]  I-Peng Lin,et al.  The Computational Complexity of the Satisfiability of Modal Horn Clauses for Modal Propositional Logics , 1994, Theor. Comput. Sci..

[29]  Alessandro Artale,et al.  A Cookbook for Temporal Conceptual Data Modelling with Description Logics , 2012, TOCL.