G. Brewka (1996) "Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences", Volume 4, pages 19-36

PDF | PostScript | HTML | doi:10.1613/jair.284

The paper describes an extension of well-founded semantics for logic programs with two types of negation. In this extension information about preferences between rules can be expressed in the logical language and derived dynamically. This is achieved by using a reserved predicate symbol and a naming technique. Conflicts among rules are resolved whenever possible on the basis of derived preference information. The well-founded conclusions of prioritized logic programs can be computed in polynomial time. A legal reasoning example illustrates the usefulness of the approach.

Click here to return to Volume 4 contents list