Generalized Disjunctive Well-Founded Semantics for Logic Programs.

摘要

Generalized disjunction well founded semantics (GDWFS) is an extension generalized well founded semantics (GWFS) of Baral, Lobo and Minker, to disjunctive logic programs. We describe fixpoint, model theoretic and procedural semantics and show their equivalence. The fixpoint semantics is similar to the fixpoint semantics of GWFS, except that it iterates over states (a pair of sets; one a set of disjunctions of atoms and the other a pair of conjunctions of atoms), rather than partial interpretations. The model theoretic semantics is based on a dynamic stratification of the program. The procedural semantics is based on SLIS refutations, trees and SLISNF trees. We compare the GDWFS with the strong well-founded semantics of Ross and the stationary model semantics of Przymusinski.