- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Context-specific sign-propagation in qualitative probabilistic networks
Artificial Intelligence 140 (1-2):207-230 (2002)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Fundamental concepts of qualitative probabilistic networks.Michael P. Wellman - 1990 - Artificial Intelligence 44 (3):257-303.
Enhanced qualitative probabilistic networks for resolving trade-offs.Silja Renooij & Linda C. van der Gaag - 2008 - Artificial Intelligence 172 (12-13):1470-1494.
Fusion, propagation, and structuring in belief networks.Judea Pearl - 1986 - Artificial Intelligence 29 (3):241-288.
Fusion and propagation with multiple observations in belief networks.Mark A. Peot & Ross D. Shachter - 1991 - Artificial Intelligence 48 (3):299-318.
Probabilistic Horn abduction and Bayesian networks.David Poole - 1993 - Artificial Intelligence 64 (1):81-129.
Probabilistic reach-avoid for Bayesian neural networks.Matthew Wicker, Luca Laurenti, Andrea Patane, Nicola Paoletti, Alessandro Abate & Marta Kwiatkowska - 2024 - Artificial Intelligence 334 (C):104132.
Probabilistic inference in artificial intelligence: The method of Bayesian networks.Jean-Louis Golmard - 1955 - In Anthony Eagle (ed.), Philosophy of Probability. Routledge. pp. 257--291.
Probabilistic reasoning in intelligent systems: Networks of plausible inference.Stig Kjær Andersen - 1991 - Artificial Intelligence 48 (1):117-124.
Approximating probabilistic inference in Bayesian belief networks is NP-hard.Paul Dagum & Michael Luby - 1993 - Artificial Intelligence 60 (1):141-153.
The computational complexity of probabilistic inference using bayesian belief networks.Gregory F. Cooper - 1990 - Artificial Intelligence 42 (2-3):393-405.
Analytics
Added to PP
2020-12-22
Downloads
7 (#1,405,108)
6 months
6 (#701,126)
2020-12-22
Downloads
7 (#1,405,108)
6 months
6 (#701,126)
Historical graph of downloads
Citations of this work
On modelling non-probabilistic uncertainty in the likelihood ratio approach to evidential reasoning.Jeroen Keppens - 2014 - Artificial Intelligence and Law 22 (3):239-290.
References found in this work
The computational complexity of probabilistic inference using bayesian belief networks.Gregory F. Cooper - 1990 - Artificial Intelligence 42 (2-3):393-405.
Fundamental concepts of qualitative probabilistic networks.Michael P. Wellman - 1990 - Artificial Intelligence 44 (3):257-303.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-6686886f5-kkm7k uwo