Logic Programming with Ordered Disjunction

Details Logic Programming with Ordered Disjunction Logic Programming with Ordered Disjunction

2002-07-11

arxiv.org/abs/cs/0207042v1

Computer Science

Artificial Intelligence

Scientific paper

Logic programs with ordered disjunction (LPODs) combine ideas underlying Qualitative Choice Logic (Brewka et al. KR 2002) 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 \times 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.

Affiliated with

Also associated with

No associations

Rating

Logic Programming with Ordered Disjunction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Logic Programming with Ordered Disjunction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Logic Programming with Ordered Disjunction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-185219