On the equivalence between answer sets and models of completion for nested logic programs

Authors:
Jia-Huai You;Li-Yan Yuan;Mingyi Zhang
Affiliations:
Department of Computing Science, University of Alberta, Canada;Department of Computing Science, University of Alberta, Canada;Guizhou Academy of Sciences, P.R. China
Venue:
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Year:
2003

Citing 6
Cited 6

Rewrite systems

Handbook of theoretical computer science (vol. B)
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
Nested expressions in logic programs

Annals of Mathematics and Artificial Intelligence
A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report

ICLP '02 Proceedings of the 18th International Conference on Logic Programming
ASSAT: computing answer sets of a logic program by SAT solvers

Eighteenth national conference on Artificial intelligence
Tight logic programs

Theory and Practice of Logic Programming

Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2

Theory and Practice of Logic Programming
Head-elementary-set-free logic programs

LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs

Fundamenta Informaticae
Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs

Fundamenta Informaticae
On elementary loops of logic programs

Theory and Practice of Logic Programming
Computing weighted solutions in ASP: representation-based method vs. search-based method

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a sufficient as well as a necessary condition for the equivalence between answer sets and models of completion for logic programs with nested expressions in the bodies of rules. This condition is the weakest among all that we are aware of even for normal logic programs. To obtain this result, we present a polynomial time reduction from this class of nested logic programs to extended programs. Consequently, answer sets for these nested programs can be computed by an answer set generator for extended programs on the one hand, and characterized in terms of models of completion on the other.