DeepAI AI Chat
Log In Sign Up

A Compiler for Ordered Logic Programs

by   James P. Delgrande, et al.
Universität Potsdam
TU Wien

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.


page 1

page 2

page 3

page 4


Logic Programs with Compiled Preferences

We describe an approach for compiling preferences into logic programs un...

Logic Programming with Ordered Disjunction

Logic programs with ordered disjunction (LPODs) combine ideas underlying...

A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction

Logic Programs with Ordered Disjunction (LPODs) extend classical logic p...

Two results for proiritized logic programming

Prioritized default reasoning has illustrated its rich expressiveness an...

The Divide-and-Conquer Subgoal-Ordering Algorithm for Speeding up Logic Inference

It is common to view programs as a combination of logic and control: the...

Random Logic Programs: Linear Model

This paper proposes a model, the linear model, for randomly generating l...