Logic programs with ordered disjunction (LPODs) add a new connective to logic programming. This connective allows us to represent alternative, ranked options for problem solutions in the heads of rules: A × B intuitively means: if possible A, but if A is not possible, then at least B. The semantics of logic programs with ordered disjunction is based on a preference relation on answer sets. In this paper we show how LPODs can be implemented using answer set solvers for normal programs. The implementation is based on a generator which produces candidate answer sets and a tester which checks whether a given candidate is maximally preferred and produces a better candidate if it is not. We also discuss the complexity of reasoning tasks based on LPODs.
[1]
Chiaki Sakama,et al.
An alternative approach to the semantics of disjunctive logic programs and deductive databases
,
2004,
Journal of Automated Reasoning.
[2]
Salem Benferhat,et al.
Qualitative choice logic
,
2004,
Artif. Intell..
[3]
I. Niemelä,et al.
Extending the Smodels system with cardinality and weight constraints
,
2001
.
[4]
Georg Gottlob,et al.
Propositional Circumscription and Extended Closed-World Reasoning are IIp2-Complete
,
1993,
Theor. Comput. Sci..
[5]
Gerhard Brewka,et al.
Logic programming with ordered disjunction
,
2002,
NMR.