- 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
Complexity of probabilistic reasoning in directed-path singly-connected Bayes networks
Artificial Intelligence 151 (1-2):213-225 (2003)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Approximate belief updating in max-2-connected Bayes networks is NP-hard.Erez Karpas, Solomon Eyal Shimony & Amos Beimel - 2009 - Artificial Intelligence 173 (12-13):1150-1153.
Probabilistic reasoning in intelligent systems: Networks of plausible inference.Stig Kjær Andersen - 1991 - Artificial Intelligence 48 (1):117-124.
The computational complexity of probabilistic inference using bayesian belief networks.Gregory F. Cooper - 1990 - Artificial Intelligence 42 (2-3):393-405.
Inference networks : Bayes and Wigmore.Philip Dawid, David Schum & Amanda Hepler - 2011 - In Philip Dawid, William Twining & Mimi Vasilaki, Evidence, Inference and Enquiry. Oxford: Oup/British Academy. pp. 119.
Probabilistic Horn abduction and Bayesian networks.David Poole - 1993 - Artificial Intelligence 64 (1):81-129.
Fundamental concepts of qualitative probabilistic networks.Michael P. Wellman - 1990 - Artificial Intelligence 44 (3):257-303.
Probabilistic analysis of the complexity of A∗.Nam Huyn, Rina Dechter & Judea Pearl - 1980 - Artificial Intelligence 15 (3):241-254.
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.
Context-specific sign-propagation in qualitative probabilistic networks.Silja Renooij, Linda C. van der Gaag & Simon Parsons - 2002 - Artificial Intelligence 140 (1-2):207-230.
Probabilistic inference in artificial intelligence: The method of Bayesian networks.Jean-Louis Golmard - 1955 - In Anthony Eagle, Philosophy of Probability. Routledge. pp. 257--291.
Analytics
Added to PP
2020-12-22
Downloads
11 (#1,471,665)
6 months
3 (#1,096,948)
2020-12-22
Downloads
11 (#1,471,665)
6 months
3 (#1,096,948)
Historical graph of downloads
Citations of this work
Estimating the probability of meeting a deadline in schedules and plans.Liat Cohen, Solomon Eyal Shimony & Gera Weiss - 2019 - Artificial Intelligence 275 (C):329-355.
Approximate belief updating in max-2-connected Bayes networks is NP-hard.Erez Karpas, Solomon Eyal Shimony & Amos Beimel - 2009 - Artificial Intelligence 173 (12-13):1150-1153.
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.
Approximating probabilistic inference in Bayesian belief networks is NP-hard.Paul Dagum & Michael Luby - 1993 - Artificial Intelligence 60 (1):141-153.
On the hardness of approximate reasoning.Dan Roth - 1996 - Artificial Intelligence 82 (1-2):273-302.
Probabilistic Horn abduction and Bayesian networks.David Poole - 1993 - Artificial Intelligence 64 (1):81-129.
Finding MAPs for belief networks is NP-hard.Solomon Eyal Shimony - 1994 - Artificial Intelligence 68 (2):399-410.
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-99fc7d78b-gv576 uwo