A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
Automata-Based Computation of Temporal Equilibrium Models
[chapter]
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
doi:10.1007/978-3-642-32211-2_5
fatcat:bl5lw6dbdjgndhlvd4od5cz4oy