Decidability of the interval temporal logic AA*BB* over the rationals - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

Decidability of the interval temporal logic AA*BB* over the rationals

Résumé

The classification of the fragments of Halpern and Shoham's logic with respect to decidability/undecidability of the satisfiability problem is now very close to the end. We settle one of the few remaining questions concerning the fragment AA*BB*, which comprises Allen's interval relations "meets" and "begins" and their symmetric versions. We already proved that AA*BB* B is decidable over the class of all finite linear orders and undecidable over ordered domains isomorphic to N. In this paper, we first show that AA*BB* is undecidable over R and over the class of all Dedekind-complete linear orders. We then prove that the logic is decidable over Q and over the class of all linear orders.

Mots clés

Fichier principal
Vignette du fichier
MFCS14.pdf (374.53 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01076538 , version 1 (22-10-2014)

Identifiants

  • HAL Id : hal-01076538 , version 1

Citer

Angelo Montanari, Gabriele Puppis, Pietro Sala. Decidability of the interval temporal logic AA*BB* over the rationals. Proceedings of the 39th International Symposium of Mathematical Foundations of Computer Science (MFCS'14), Aug 2014, Budapest, Hungary. pp.451 - 463. ⟨hal-01076538⟩

Collections

CNRS
228 Consultations
26 Téléchargements

Partager

Gmail Facebook X LinkedIn More