Uncertainty in Artificial Intelligence
First Name   Last Name   Password   Forgot Password   Log in!
    Proceedings   Proceeding details   Article details         Authors         Search    
Nilsson's Probabilistic Entailment Extended to Dempster-Shafer Theory (Abstract Only)
Mary McLeish
Probabilistic logic has been discussed in a recent paper by N. Nilsson [12]. An entailment scheme is proposed which can predict the probability of an event when the probabilities of certain other connected events are known. This scheme involves the use of a maximum entropy method proposed by P. Cheeseman in [3]. The model uses vectors which represent certain possible states of the world. Only consistent such vectors are entered into the probability scheme. As a result, entailment does not always yield an acceptable result and cannot be applied to real situations which could arise. This paper investigates a technique to overcome this problem, which involves extending the idea of probabilistic logic and the maximum entropy approach to Dempster-Shafer theory. A new entailment scheme for belief functions is used which produces well-defined results, even when only "consistent" worlds are being considered. The paper also reconsiders an earlier attempt by the author [6,7] to model default reasoning (and subsequent nonmonotonicity) by adding inconsistent vectors to Nilsson's model. In the extended setting, more sensible entailment values are obtained than in the previous work.
Keywords: Probabilistic Logic, Maximum Entropy Method, Dempster-Shafer theory
Pages: 295-296
PS Link:
PDF Link: /papers/87/p295-mcleish.pdf
AUTHOR = "Mary McLeish ",
TITLE = "Nilsson's Probabilistic Entailment Extended to Dempster-Shafer Theory (Abstract Only)",
BOOKTITLE = "Proceedings of the Third Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-87)",
ADDRESS = "Corvallis, Oregon",
YEAR = "1987",
PAGES = "295--296"

hosted by DSL   •   site info   •   help