✦ LIBER ✦

An Evaluation of Explanations of Probabilistic Inference

✍ Scribed by Henri J. Suermondt; Gregory F. Cooper

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 455 KB
Volume: 26
Category: Article
ISSN: 0010-4809
DOI: 10.1006/cbmr.1993.1017

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Automatic derivation of probabilistic in

Automatic derivation of probabilistic inference rules

✍ Manfred Jaeger 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 229 KB

A probabilistic inference rule is a general rule that provides bounds on a target probability given constraints on a number of input probabilities. Example: from P AjB T r infer P XAjB P 1 À r; 1. Rules of this kind have been studied extensively as a deduction method for propositional probabilistic

Enhancing the inference mechanism of Nil

Enhancing the inference mechanism of Nilsson's probabilistic logic

✍ Thomas B. Kane 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 898 KB

Nilsson's Probabilistic Logic is a set-theoretic mechanism for reasoning with uncertainty. We propose a new way of looking at the probability constraints enforced by the framework, which allows the expert to include conditional probabilities in the semantic tree, thus making Probabilistic Logic more

On modeling of if-then rules for probabi

On modeling of if-then rules for probabilistic inference

✍ Hung T. Nguyen; I. R. Goodman 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 417 KB

We identify various situations in probabilistic intelligent systems in which conditionals (rules) as mathematical entities as well as their conditional logic operations are needed. In discussing Bayesian updating procedure and belief function construction, we provide a new method for modeling if. .

Memory aids in the learning of probabili

Memory aids in the learning of probabilistic inference tasks

✍ Jan Kuylenstierna; Berndt Brehmer 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 583 KB

On the complexity of inference about pro

On the complexity of inference about probabilistic relational models

✍ Manfred Jaeger 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 120 KB

We investigate the complexity of probabilistic inference from knowledge bases that encode probability distributions on finite domain relational structures. Our interest here lies in the complexity in terms of the domain under consideration in a specific application instance. We obtain the result tha

Accelerating chromosome evaluation for p

Accelerating chromosome evaluation for partial abductive inference in Bayesian networks by means of explanation set absorption

✍ Luis M. de Campos; José A. Gámez; Serafı́n Moral 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 178 KB

Partial abductive inference in Bayesian belief networks (BBNs) is intended as the process of generating the K most probable con®gurations for a set of unobserved variables (the explanation set). This problem is NP-hard and so exact computation is not always possible. In previous works genetic algori