Next: Introduction: Why Dynamic
Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences
Gerhard Brewka firstname.lastname@example.org
TU Wien, Abteilung für Wissensbasierte Systeme
Treitlstr. 3, 1040 Wien, Austria
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.
Thu Feb 8 10:26:15 MET 1996