Computing Stable and Partial Stable Models of Extended Disjunctive Logic Programs
Abstract
In [Prz91], Przymusinski introduced the partial (or 3-valued) stable
model semantics which extends the (2-valued) stable model semantics
defined originally by Gelfond and Lifschitz [GL88]. In this paper we
describe a procedure to compute the collection of all partial stable
models of an extended disjunctive logic program. This procedure
consists in transforming an extended disjunctive logic program into a
constrained disjunctive program free of negation-by-default whose set
of 2-valued minimal models corresponds to the set of partial stable
models of the original program.
(Also cross-referenced as UMIACS-TR-95-49)