Computing stable and partial stable models of extended disjunctive logic programs

TitleComputing stable and partial stable models of extended disjunctive logic programs
Publication TypeJournal Articles
Year of Publication1995
AuthorsRuiz C, Minker J
JournalNon-Monotonic Extensions of Logic Programming
Pagination205 - 229
Date Published1995///
Abstract

n [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.

DOI10.1007/BFb0030666