Translating Preferred Answer Set Programs to Propositional Logic

Authors:
Vernon Asuncion;Yan Zhang
Affiliations:
Intelligent Systems Laboratory School of Computing and Mathematics, University of Western Sydney, Australia;Intelligent Systems Laboratory School of Computing and Mathematics, University of Western Sydney, Australia
Venue:
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Year:
2009

Citing 6
Cited 0

Preferred answer sets for extended logic programs

Artificial Intelligence
A framework for compiling preferences in logic programs

Theory and Practice of Logic Programming
ASSAT: computing answer sets of a logic program by SAT solvers

Artificial Intelligence - Special issue on nonmonotonic reasoning
Logic program-based updates

ACM Transactions on Computational Logic (TOCL)
A generalization of the Lin-Zhao theorem

Annals of Mathematics and Artificial Intelligence
nomore: a system for computing preferred answer sets

LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of whether a given preferred answer set program can be reduced to a propositional formula. Research on this topic is of both theoretical and practical interests: on one hand, it will shed new insights to understand the expressive power of preferred answer set programs; on the other hand, it may also lead to efficient implementations for computing preferred answer sets of logic programs. In this paper, we focus on Brewka and Eiter's preferred answer set programs. We propose a translation from preferred answer set programs to propositional logic and show that there is one-to-one correspondence between the preferred answer sets of the program to the models of the resulting propositional theory. We then link this result to Brewka and Eiter's weakly preferred answer set semantics.