The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Automata-Theoretic techniques for modal logics of programs
Journal of Computer and System Sciences
The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
A hierarchy of temporal properties (invited paper, 1989)
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Reasoning about infinite computations
Information and Computation
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
An A-Prolog Decision Support System for the Space Shuttle
PADL '01 Proceedings of the Third International Symposium on Practical Aspects of Declarative Languages
A New Logical Characterisation of Stable Models and Answer Sets
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
Alternating Automata: Unifying Truth and Validity Checking for Temporal Logics
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Strongly Equivalent Temporal Logic Programs
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
ANTON: Composing Logic and Logic Composing
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
A normal form for linear temporal equilibrium logic
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Loop formulas for splitable temporal logic programs
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
STeLP: a tool for temporal answer set programming
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Answer sets for propositional theories
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
An ASP-based system for team-building in the gioia-tauro seaport
PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
| Hi-index | 0.00 |
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 Büchi automaton that accepts exactly the temporal equilibrium models of a given theory, providing an automata-based decision procedure and illustrating the ω-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.