Stable Semantics for Disjunctive Programs (1991)
| Venue: | New Generation Computing |
| Citations: | 149 - 2 self |
BibTeX
@ARTICLE{Przymusinski91stablesemantics,
author = {Teodor C. Przymusinski},
title = {Stable Semantics for Disjunctive Programs},
journal = {New Generation Computing},
year = {1991},
volume = {9},
pages = {401--424}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We introduce the stable model semantics for disjunctive logic programs and deductive databases, which generalizes the stable model semantics, defined earlier for normal (i.e., non-disjunctive) programs. Depending on whether only total (2-valued) or all partial (3-valued) models are used we obtain the disjunctive stable semantics or the partial disjunctive stable semantics, respectively. The proposed semantics are shown to have the following properties: ffl For normal programs, the disjunctive (respectively, partial disjunctive) stable semantics coincides with the stable (respectively, partial stable) semantics. ffl For normal programs, the partial disjunctive stable semantics also coincides with the well-founded semantics. ffl For locally stratified disjunctive programs both (total and partial) disjunctive stable semantics coincide with the perfect model semantics. ffl The partial disjunctive stable semantics can be generalized to the class of all disjunctive logic programs. ffl B...
