Skip to Main content Skip to Navigation
Conference papers

Decidability of the interval temporal logic ABBar over the natural numbers

Abstract : In this paper, we focus our attention on the interval temporal logic of the Allen's relations "meets", "begins", and "begun by" (ABBar for short), interpreted over natural numbers. We first introduce the logic and we show that it is expressive enough to model distinctive interval properties,such as accomplishment conditions, to capture basic modalities of point-based temporal logic, such as the until operator, and to encode relevant metric constraints. Then, we prove that the satisfiability problem for ABBar over natural numbers is decidable by providing a small model theorem based on an original contraction method. Finally, we prove the EXPSPACE-completeness of the problem
Document type :
Conference papers
Complete list of metadata
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Thursday, February 11, 2010 - 11:28:00 AM
Last modification on : Tuesday, September 8, 2020 - 4:58:02 PM
Long-term archiving on: : Friday, June 18, 2010 - 8:12:53 PM


Files produced by the author(s)


  • HAL Id : inria-00455794, version 1



Angelo Montanari, Gabriele Puppis, Pietro Sala, Guido Sciavicco. Decidability of the interval temporal logic ABBar over the natural numbers. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.597-608. ⟨inria-00455794⟩



Record views


Files downloads