Logic Programs with Compiled Preferences

Details Logic Programs with Compiled Preferences Logic Programs with Compiled Preferences

2000-03-08

arxiv.org/abs/cs/0003028v1

Computer Science

Artificial Intelligence

Scientific paper

We describe an approach for compiling preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in which rules are named by unique terms, and in which preferences among rules are given by a set of dedicated atoms. An ordered logic program is transformed into a second, regular, extended logic program wherein the preferences are respected, in that the answer sets obtained in the transformed theory correspond with the preferred answer sets of the original theory. Our approach allows both the specification of static orderings (as found in most previous work), in which preferences are external to a logic program, as well as orderings on sets of rules. In large part then, we are interested in describing a general methodology for uniformly incorporating preference information in a logic program. Since the result of our translation is an extended logic program, we can make use of existing implementations, such as dlv and smodels. To this end, we have developed a compiler, available on the web, as a front-end for these programming systems.

Affiliated with

Also associated with

No associations

Rating

Logic Programs with Compiled Preferences 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 Programs with Compiled Preferences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Logic Programs with Compiled Preferences will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-143987