Relating Dempster-Shafer theory to stable semantics

Raymond T. Ng*, V. S. Subrahmanian

*Corresponding author for this work

Research output: Contribution to conferencePaperpeer-review

8 Scopus citations


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 languageEnglish (US)
Number of pages15
StatePublished - 1991
Externally publishedYes
EventLogic Programming - Proceedings of the 1991 International Symposium - San Diego, CA, USA
Duration: Oct 28 1991Nov 1 1991


ConferenceLogic Programming - Proceedings of the 1991 International Symposium
CitySan Diego, CA, USA

ASJC Scopus subject areas

  • Engineering(all)


Dive into the research topics of 'Relating Dempster-Shafer theory to stable semantics'. Together they form a unique fingerprint.

Cite this