Computing Stable and Partial Stable Models of Extended Disjunctive Logic Programs

In Prz91], Przymusinski introduced the partial (or 3-valued) stable model semantics which extends the (2-valued) stable model semantics dened 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.

• Type: Conference
• Year: 1994
• Where: NMELP
• Authors: Carolina Ruiz, Jack Minker
• Keywords: Automated Reasoning, Extended Disjunctive Logic, NMELP 1994, Stable Model Semantics, Stable Models