Abstract
In this paper we study Dempster-Shafer probabilistic logic programs (DS-programs for short). We first develop a declarative semantics for such logic programs, thus addressing an open problem observed by Fitting[5]. This task alone is complicated by the non-monotonic nature of Dempster-Shafer theory. Then given a DS-program P, we transform P to a program P̄ whose clauses may contain non-monotonic negations in their bodies. We proceed to present a stable semantics for P̄. The major result of this paper is that the meaning of a DS-program P, as defined by the declarative semantics based on Dempster-Shafer theory, is identical to the meaning of P̄, as defined by the stable semantics. This equivalence links the Dempster-Shafer mode of non-monotonicity very firmly to the stable semantics, and thus to other non-monotonic rule systems due to the results provided by Marek et al[10, 11, 12].
| Original language | English (US) |
|---|---|
| Pages | 551-565 |
| Number of pages | 15 |
| State | Published - 1991 |
| Externally published | Yes |
| Event | Logic Programming - Proceedings of the 1991 International Symposium - San Diego, CA, USA Duration: Oct 28 1991 → Nov 1 1991 |
Conference
| Conference | Logic Programming - Proceedings of the 1991 International Symposium |
|---|---|
| City | San Diego, CA, USA |
| Period | 10/28/91 → 11/1/91 |
ASJC Scopus subject areas
- Engineering(all)