Dempster-Shafer Logic Programs and Stable Semantics

Many researchers (e.g. Baldwin [2] and Ishizuka [19]) have observed that the Dempster-Shafer rule of combination, which is at the heart of Dempster-Shafer theory, exhibits non-monotonic behaviour. However, as they focus entirely on operational concerns, two important issues remain unresolved. In [13], Fitting observes that developing a declarative semantics for logic programs based on the Dempster-Shafer rule is an open problem. More importantly, it is unclear how the mode of non-monotonicity demonstrated by the Dempster-Shafer rule is related to well-understood nonmonotonic logics.

[1]  Matthew L. Ginsberg,et al.  Non-Monotonic Reasoning Using Dempster's Rule , 1984, AAAI.

[2]  James F. Baldwin,et al.  Evidential support logic programming , 1987 .

[3]  Lotfi A. Zadeh,et al.  A Simple View of the Dempster-Shafer Theory of Evidence and Its Implication for the Rule of Combination , 1985, AI Mag..

[4]  Didier Dubois,et al.  Default Reasoning and Possibility Theory , 1988, Artif. Intell..

[5]  Michael Kifer,et al.  On the Semantics of Rule-Based Expert Systems with Uncertainty , 1988, ICDT.

[6]  A. N. Kolmogorov,et al.  Foundations of the theory of probability , 1960 .

[7]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[8]  Ronald Fagin,et al.  Uncertainty, belief, and probability 1 , 1991, IJCAI.

[9]  Nils J. Nilsson,et al.  Probabilistic Logic * , 2022 .

[10]  Drew McDermott,et al.  Non-Monotonic Logic I , 1987, Artif. Intell..

[11]  David S. Touretzky,et al.  The Mathematics of Inheritance Systems , 1984 .

[12]  R. Yager.  On the dempster-shafer framework and new combination rules , 1987, Inf. Sci..

[13]  Ehud Y. Shapiro,et al.  Logic Programs With Uncertainties: A Tool for Implementing Rule-Based Systems , 1983, IJCAI.

[14]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[15]  David S. Touretzky,et al.  A Calculus for Inheritance in Monotonic Semantic Nets , 1987, ISMIS.

[16]  Vladimir Lifschitz,et al.  Pointwise circumscription , 1987 .

[17]  Glenn Shafer,et al.  A Mathematical Theory of Evidence , 2020, A Mathematical Theory of Evidence.

[18]  Henry E. Kyburg,et al.  Bayesian and Non-Bayesian Evidential Updating , 1987, Artificial Intelligence.

[19]  Hector Geffner,et al.  Default reasoning - causal and conditional theories , 1992 .

[20]  V. S. Subrahmanian,et al.  Paraconsistent Logic Programming , 1987, Theor. Comput. Sci..

[21]  Philippe Smets,et al.  Default reasoning and the transferable belief model , 1990, UAI.

[22]  John McCarthy,et al.  Circumscription - A Form of Non-Monotonic Reasoning , 1980, Artif. Intell..

[23]  Kathryn B. Laskey,et al.  Assumptions, Beliefs and Probabilities , 1989, Artif. Intell..

[24]  Mary McLeish,et al.  A model for non-monotonic reasoning using Dempster's rule , 1990, UAI.

[25]  Wray L. Buntine,et al.  Modelling default and likelihood reasoning as probabilistic , 1990 .

[26]  M. H. van Emden,et al.  Quantitative Deduction and its Fixpoint Theory , 1986, J. Log. Program..

[27]  Alberto Martelli,et al.  An Efficient Unification Algorithm , 1982, TOPL.

[28]  Fahiem Bacchus,et al.  Representing and reasoning with probabilistic knowledge , 1988 .

[29]  Victor W. Marek,et al.  Stable Semantics for Logic Programs and Default Theories , 1989, NACLP.