Computing Stable and Partial Stable Models of Extended Disjunctive Logic Programs
| dc.contributor.author | Ruiz, Carolina | en_US |
| dc.contributor.author | Minker, Jack | en_US |
| dc.date.accessioned | 2004-05-31T22:32:02Z | |
| dc.date.available | 2004-05-31T22:32:02Z | |
| dc.date.created | 1995-04 | en_US |
| dc.date.issued | 1998-10-15 | en_US |
| dc.description.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) | en_US |
| dc.format.extent | 280552 bytes | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.uri | http://hdl.handle.net/1903/722 | |
| dc.language.iso | en_US | |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_US |
| dc.relation.isAvailableAt | University of Maryland (College Park, Md.) | en_US |
| dc.relation.isAvailableAt | Tech Reports in Computer Science and Engineering | en_US |
| dc.relation.isAvailableAt | UMIACS Technical Reports | en_US |
| dc.relation.ispartofseries | UM Computer Science Department; CS-TR-3458 | en_US |
| dc.relation.ispartofseries | UMIACS; UMIACS-TR-95-49 | en_US |
| dc.title | Computing Stable and Partial Stable Models of Extended Disjunctive Logic Programs | en_US |
| dc.type | Technical Report | en_US |