Logic Programming with Ordered Disjunction

Gerhard Brewka, Universität Leipzig

Logic programs with ordered disjunction (LPODs) combine ideas underlying Qualitative Choice Logic, a logic recently introduced by Brewka, Benferhat and Le Berre, and answer set programming. Logic programming under answer set semantics is extended with a new connective called ordered disjunction. The new connective allows us to represent alternative, ranked options for problem solutions in the heads of rules: A x 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. LPODs are useful for applications in design and configuration and can serve as a basis for qualitative decision making.


This page is copyrighted by AAAI. All rights reserved. Your use of this site constitutes acceptance of all of AAAI's terms and conditions and privacy policy.