Decidability of the interval temporal logic ABBar over the natural numbers
Logic in Computer Science
2010-02-03 v2
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
Keywords
Cite
@article{arxiv.0912.3429,
title = {Decidability of the interval temporal logic ABBar over the natural numbers},
author = {A. Montanari and G. Puppis and P. Sala and G. Sciavicco},
journal= {arXiv preprint arXiv:0912.3429},
year = {2010}
}