The Internet Archive has a preservation copy of this work in our general collections.
The file type is
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 ofarXiv:cs/0003024v1 fatcat:lsebf4il7zgulb7rxeat7wawna