Abstract
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: AB 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...
Users
Please
log in to take part in the discussion (add own reviews or comments).