Propositional theories are strongly equivalent to logic programs

Authors:
Pedro Cabalar;Paolo Ferraris
Affiliations:
Department of Computer Science, University of Corunna, Spain (e-mail: cabalar@udc.es);Department of Computer Sciences, University of Texas, Austin, USA (e-mail: otto@cs.utexas.edu)
Venue:
Theory and Practice of Logic Programming
Year:
2007

Citing 0
Cited 19

Rule Calculus: Semantics, Axioms and Applications

JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Equivalences in Answer-Set Programming by Countermodels in the Logic of Here-and-There

ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Merging Logic Programs under Answer Set Semantics

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
System f2lp --- Computing Answer Sets of First-Order Formulas

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2

Theory and Practice of Logic Programming
Minimal logic programs

ICLP'07 Proceedings of the 23rd international conference on Logic programming
Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs

Artificial Intelligence
On Semantic Update Operators for Answer-Set Programs

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
A normal form for linear temporal equilibrium logic

JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Logic programs with propositional connectives and aggregates

ACM Transactions on Computational Logic (TOCL)
A logical characterisation of ordered disjunction

AI Communications - Answer Set Programming
A general framework for equivalences in answer-set programming by countermodels in the logic of here-and-there*

Theory and Practice of Logic Programming
The modal logic of equilibrium models

FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Reducing propositional theories in equilibrium logic to logic programs

EPIA'05 Proceedings of the 12th Portuguese conference on Progress in Artificial Intelligence
Here and there among logics for logic programming

Correct Reasoning
Reformulating the situation calculus and the event calculus in the general theory of stable models and in answer set programming

Journal of Artificial Intelligence Research
A Model-Theoretic Approach to Belief Change in Answer Set Programming

ACM Transactions on Computational Logic (TOCL)
Forgetting for answer set programs revisited

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a property of propositional theories under the answer sets semantics (called Equilibrium Logic for this general syntax): any theory can always be reexpressed as a strongly equivalent disjunctive logic program, possibly with negation in the head. We provide two different proofs for this result: one involving a syntactic transformation, and one that constructs a program starting from the countermodels of the theory in the intermediate logic of here-and-there.