Comparisons and Computation of Well-founded Semantics for Disjunctive Logic Programs
| dc.creator | Wang, Kewen | |
| dc.creator | Zhou, Lizhu | |
| dc.date | 2003-01-14 | |
| dc.date | 2003-01-16 | |
| dc.date.accessioned | 2026-07-07T03:19:21Z | |
| dc.date.available | 2026-07-07T03:19:21Z | |
| dc.description | Much work has been done on extending the well-founded semantics to general disjunctive logic programs and various approaches have been proposed. However, these semantics are different from each other and no consensus is reached about which semantics is the most intended. In this paper we look at disjunctive well-founded reasoning from different angles. We show that there is an intuitive form of the well-founded reasoning in disjunctive logic programming which can be characterized by slightly modifying some exisitng approaches to defining disjunctive well-founded semantics, including program transformations, argumentation, unfounded sets (and resolution-like procedure). We also provide a bottom-up procedure for this semantics. The significance of our work is not only in clarifying the relationship among different approaches, but also shed some light on what is an intended well-founded semantics for disjunctive logic programs. | |
| dc.description | 31 pages | |
| dc.identifier | https://arxiv.org/abs/cs/0301010 | |
| dc.identifier | http://arxiv.org/abs/cs/0301010 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31424 | |
| dc.subject | Artificial Intelligence | |
| dc.subject | I.2.3; I.2.4 | |
| dc.title | Comparisons and Computation of Well-founded Semantics for Disjunctive Logic Programs | |
| dc.type | text |