A Compiler for Ordered Logic Programs

Details A Compiler for Ordered Logic Programs A Compiler for Ordered Logic Programs

2000-03-08

arxiv.org/abs/cs/0003024v1

Computer Science

Artificial Intelligence

Scientific paper

This paper describes a system, called PLP, for compiling ordered logic programs into standard logic programs under the answer set semantics. In an ordered logic program, rules are named by unique terms, and 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. Since the result of the translation is an extended logic program, existing logic programming systems can be used as underlying reasoning engine. In particular, PLP is conceived as a front-end to the logic programming systems dlv and smodels.

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-143967