Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Extending and implementing the stable model semantics
Artificial Intelligence
Nested expressions in logic programs
Annals of Mathematics and Artificial Intelligence
Using clausal deductive databases for defining semantics in disjunctive deductive databases
Annals of Mathematics and Artificial Intelligence
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
A New Logical Characterisation of Stable Models and Answer Sets
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
A Tableau Calculus for Equilibrium Entailment
TABLEAUX '00 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Computing Equilibrium Models Using Signed Formulas
CL '00 Proceedings of the First International Conference on Computational Logic
Declarative Semantics of Hypothetical Logic Programming with Negation as Failure
ELP '92 Proceedings of the Third International Workshop on Extensions of Logic Programming
Tutorial: Complexity of Many-Valued Logics
ISMVL '01 Proceedings of the 31st IEEE International Symposium on Multiple-Valued Logic
Weight constraints as nested expressions
Theory and Practice of Logic Programming
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic (TOCL)
Propositional theories are strongly equivalent to logic programs
Theory and Practice of Logic Programming
Answer sets for propositional theories
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
Quantified Equilibrium Logic and Foundations for Answer Set Programs
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
A Revised Concept of Safety for General Answer Set Programs
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
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
ICLP'07 Proceedings of the 23rd international conference on Logic programming
A normal form for linear temporal equilibrium logic
JELIA'10 Proceedings of the 12th European conference on Logics in artificial intelligence
Translating first-order theories into logic programs
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Here and there among logics for logic programming
Correct Reasoning
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to transform an arbitrary set of propositional formulas into an equivalent logic program and what are the complexity constraints on this process. We want the transformed program to be equivalent in a strong sense so that theory parts can be transformed independent of the wider context in which they might be embedded. It was only recently established [1] that propositional theories are indeed equivalent (in a strong sense) to logic programs. Here this result is extended with the following contributions. (i) We show how to effectively obtain an equivalent program starting from an arbitrary theory. (ii) We show that in general there is no polynomial time transformation if we require the resulting program to share precisely the vocabulary or signature of the initial theory. (iii) Extending previous work we show how polynomial transformations can be achieved if one allows the resulting program to contain new atoms. The program obtained is still in a strong sense equivalent to the original theory, and the answer sets of the theory can be retrieved from it.