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. In this paper, we identify all fragments of Halpern and Shoham's interval temporal logic HS whose finite satisfiability problem is decidable. We classify them in terms of both relative expressive power and complexity. We show that there are exactly 62 expressively-different decidable fragments, whose complexity ranges from NP-complete to non-primitive recursive (all other HS fragments have been already shown to be undecidable).
Interval Temporal Logics over Finite Linear Orders: the Complete Picture / D. Bresolin; D. Della Monica; A. Montanari; P. Sala; G. Sciavicco. - STAMPA. - 242:(2012), pp. 199-204. (Intervento presentato al convegno ECAI 2012 - 20th European Conference on Artificial Intelligence tenutosi a Montpellier, Francia nel 2012) [10.3233/978-1-61499-098-7-199].
Interval Temporal Logics over Finite Linear Orders: the Complete Picture
BRESOLIN, DAVIDE;
2012
Abstract
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. In this paper, we identify all fragments of Halpern and Shoham's interval temporal logic HS whose finite satisfiability problem is decidable. We classify them in terms of both relative expressive power and complexity. We show that there are exactly 62 expressively-different decidable fragments, whose complexity ranges from NP-complete to non-primitive recursive (all other HS fragments have been already shown to be undecidable).I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
