2009/12/17 by Angelo Montanari, A. Montanari, Montanari, A. +9
Computer Science · #Constraint Satisfaction and Optimization #F.3 #F.4 #FOS: Computer and information sciences #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #cs.LO
paper · pdf · doi:10.48550/arxiv.0912.3429
openalex publication_date 2009/12/17 · arxiv created 2010/02/03 · arxiv updated 2010/02/26 · openalex created_date 2019/06/27 · openalex updated_date 2026/07/28
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