Automata-Based Computation of Temporal Equilibrium Models [chapter]

Pedro Cabalar, Stéphane Demri
2012 Lecture Notes in Computer Science  
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 open problems that remained open for TEL like decidability, complexity assessment and computation of temporal equilibrium models for arbitrary theories. We propose a method for the latter that consists in building a Büchi automaton that accepts
more » ... xactly the temporal equilibrium models of a given theory, providing an automata-based decision procedure and illustrating the ω-regularity of such sets. We are able to 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 whether they have the same temporal equilibrium models. ⋆
doi:10.1007/978-3-642-32211-2_5 fatcat:bl5lw6dbdjgndhlvd4od5cz4oy