The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
Proceedings of the eleventh international conference on Logic programming
Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
A New Logical Characterisation of Stable Models and Answer Sets
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
ASSAT: computing answer sets of a logic program by SAT solvers
Eighteenth national conference on Artificial intelligence
Annals of Mathematics and Artificial Intelligence
Propositional theories are strongly equivalent to logic programs
Theory and Practice of Logic Programming
Strongly Equivalent Temporal Logic Programs
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
The Second Answer Set Programming Competition
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A new perspective on stable models
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A resolution method for temporal logic
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Temporal equilibrium logic: a first approach
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Answer sets for propositional theories
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Reducing propositional theories in equilibrium logic to logic programs
EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
Loop formulas for splitable temporal logic programs
LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Parametrized equilibrium logic
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
Automata-Based computation of temporal equilibrium models
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
| Hi-index | 0.00 |
In previous work, the so-called Temporal Equilibrium Logic (TEL) was introduced. This formalism provides an extension of the Answer Set semantics for logic programs to arbitrary theories in the syntax of Linear Temporal Logic. It has already been shown that, in the nontemporal case, arbitrary propositional theories can always be reduced to logic program rules (with disjunction and negation in the head) independently on the context. That is, logic programs constitute a normal form for the non-temporal case. In this paper we show that TEL can be similarly reduced to a normal form consisting of a set of implications (embraced by a necessity operator) quite close to logic program rules. This normal form may be useful both for a practical implementation of TEL and a simpler analysis of theoretical problems.