A Characterization of the Partial Stable Models For Disjunctive Databases.
Dietmar A. Seipel, Jack Minker, Carolina Ruiz · 1997
We consider the partial stable model semantics for disjunctive databases with default negation as defined by Przymusinski. We give a characterization of the partial stable models of a disjunctive database P in terms of the total stable models of a suitably transformed database P tu . The transformation is based on annotating the atoms in the given database by the truth values true ("t") and undefined ("u"). Currently many fast algorithms are being developed for computing the total stable models of disjunctive databases. Based on the new characterization given in this paper, these algorithms can also be used for computing partial stable models. 1 Introduction To define the semantics of a disjunctive database the ground atoms are assigned truth values. Three truth values are used: true ("t"), false ("f"), and undefined ("u"). Herbrand interpretations that use the two classical truth values t and f only are called total, while Herbrand interpretations that use all three truth values a...