Automata-Based Computation of Temporal Equilibrium Models - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2012

Automata-Based Computation of Temporal Equilibrium Models

Résumé

Temporal Equilibrium Logic (TEL) is a formalism for temporal logic programming that generalizes the paradigm of Answer Set Programming (ASP) introducing modal temporal operators from standard Linear-time Temporal Logic (LTL). In this paper we solve some problems that remained open for TEL like decidability, bounds for computational complexity as well as computation of temporal equilibrium models for arbitrary theories. We propose a method for the latter that consists in building a Buchi automaton that accepts exactly the temporal equilibrium models of a given theory, providing an automata-based decision procedure and illustrating the omega-regularity of such sets. We show that TEL satisfiability can be solved in exponential space and it is hard for polynomial space. Finally, given two theories, we provide a decision procedure to check if they have the same temporal equilibrium models.
Fichier principal
Vignette du fichier
CD-lopstr11.pdf (232.93 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03195219 , version 1 (10-04-2021)

Identifiants

Citer

Pedro Cabalar, Stéphane Demri. Automata-Based Computation of Temporal Equilibrium Models. 21st International Workshop on Logic Program Synthesis and Transformation (LOPSTR'11), German Vidal, Jun 2011, Odense, Denmark. pp.57-72, ⟨10.1007/978-3-642-32211-2_5⟩. ⟨hal-03195219⟩
46 Consultations
44 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More