Show simple item record

Computing Stable and Partial Stable Models of Extended Disjunctive Logic Programs

dc.contributor.authorRuiz, Carolinaen_US
dc.contributor.authorMinker, Jacken_US
dc.description.abstractIn [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)en_US
dc.format.extent280552 bytes
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-3458en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-95-49en_US
dc.titleComputing Stable and Partial Stable Models of Extended Disjunctive Logic Programsen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US

Files in this item


This item appears in the following Collection(s)

Show simple item record