Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Annals of Mathematics and Artificial Intelligence
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
Rule Calculus: Semantics, Axioms and Applications
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
A normal form for linear temporal equilibrium logic
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Parametrized logic programming
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Answer sets for propositional theories
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
An embedding of input-output logic in deontic logic programs
DEON'12 Proceedings of the 11th international conference on Deontic Logic in Computer Science
| Hi-index | 0.00 |
Equilibrium logic provides a logical foundation for the stable model semantics of logic programs. Recently, parametrized logic programming was introduced with the aim of presenting the syntax and natural semantics for parametrized logic programs, which are very expressive logic programs, in the sense that complex formulas are allowed to appear in the body and head of rules. Stable model semantics was defined for such parametrized logic programs. The aim of this paper is to introduce a parametrized version of equilibrium logic that extends parametrized logic programs to general theories, and to show how these can be used to characterize and to study strong equivalence of temporal logic programs.