Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences

TL;DR

This paper extends well-founded semantics to handle logic programs with dynamic preferences, allowing preferences to be expressed and resolved during reasoning, enabling efficient conflict resolution in prioritized logic programs.

Contribution

It introduces a novel approach to incorporate and compute dynamic preferences within well-founded semantics for logic programs.

Findings

Preferences can be expressed and derived dynamically

Conflict resolution is based on derived preferences

Computations are polynomial-time feasible

Abstract

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.