Access the full text.
Sign up today, get DeepDyve free for 14 days.
Uffe Kjærulff, Christopher Meek, Adnan Darwiche, N. Friedman (2003)
Uncertainty in artificial intelligence : proceedings of the nineteenth conference (2003), August 7-10, 2003, Acapulco, Mexico
J. Pearl (1988)
Probabilistic reasoning in intelligent systems
R. McEliece, D. MacKay, Jung-Fu Cheng (1998)
Turbo Decoding as an Instance of Pearl's "Belief Propagation" AlgorithmIEEE J. Sel. Areas Commun., 16
L. Ngo, P. Haddawy (1997)
Answering Queries from Context-Sensitive Probabilistic Knowledge BasesTheor. Comput. Sci., 171
R. Mateescu, R. Dechter, Radu Marinescu (2008)
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Graphical ModelsJ. Artif. Intell. Res., 33
G Cooper (1990)
The computational complexity of probabistic inferencesArtif. Intell., 42
Matthew Richardson, Pedro Domingos (2006)
Markov logic networksMachine Learning, 62
人工知能学会, M. Pollack (1997)
IJCAI-97 : proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, Nagoya, Japan, August 23-29, 1997
R. Dechter, D. Larkin (2001)
Hybrid Processing of Beliefs and ConstraintsArXiv, abs/1301.2265
L. Otten, R. Dechter (2008)
Bounding Search Space Size via (Hyper)tree DecompositionsArXiv, abs/1206.3284
N. Zhang, D. Poole (1994)
A simple approach to Bayesian network computations
D. Koller, A. Pfeffer (1998)
Probabilistic Frame-Based Systems
Prakash Shenoy (1992)
Valuation-Based Systems for Bayesian Decision AnalysisOper. Res., 40
M. Moskewicz, Conor Madigan, Ying Zhao, Lintao Zhang, S. Malik (2001)
Chaff: engineering an efficient SAT solverProceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232)
Michael Wellman, J. Breese, R. Goldman (1992)
From knowledge bases to decision modelsThe Knowledge Engineering Review, 7
U. Bertelè, F. Brioschi (1972)
Nonserial Dynamic Programming
H. Bodlaender, J. Gilbert, T. Kloks, H. Hafsteinsson (1991)
Approximating Treewidth, Pathwidth, and Minimum Elimination Tree Height
Adnan Darwiche (2002)
A Logical Approach to Factoring Belief Networks
L. Portinale, A. Bobbio (1999)
Bayesian Networks for Dependability Analysis: an Application to Digital Control Reliability
R. Bayardo, Daniel Miranker (1996)
A Complexity Analysis of Space-Bounded Learning Algorithms for the Constraint Satisfaction Problem
S. Vadhan (2005)
Computational Complexity
H. Korth, A. Silberschatz (1980)
Database System Concepts
P. Prosser (1993)
HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEMComputational Intelligence, 9
D. Poole (1993)
Probabilistic Horn Abduction and Bayesian NetworksArtif. Intell., 64
M. Jaeger (2002)
Probabilistic Decision Graphs - Combining Verification And Ai Techniques For Probabilistic InferenceInt. J. Uncertain. Fuzziness Knowl. Based Syst., 12
Adnan Darwiche (2001)
Recursive conditioningArtif. Intell., 126
R. Dechter (1996)
Bucket elimination: A unifying framework for probabilistic inference
R. Parker, R. Miller (1988)
Using Causal Knowledge to Create Simulated Patient Cases: The CPCS Project as an Extension of INTERNIST-1
R. Dechter, R. Mateescu (2007)
AND/OR search spaces for graphical modelsArtif. Intell., 171
David Allen, Adnan Darwiche (2002)
New Advances in Inference by Recursive ConditioningArXiv, abs/1212.2455
D. Larkin, R. Dechter (2003)
Bayesian Inference in the Presence of Determinism
L. Getoor, B. Taskar (2007)
BLOG: Probabilistic Models with Unknown Objects
(1979)
Performance measurement and analysis of search algorithms
R. Dechter (1999)
Bucket Elimination: A Unifying Framework for ReasoningArtif. Intell., 113
Kalev Kask, R. Dechter, J. Larrosa, A. Dechter (2005)
Unifying Cluster-Tree Decompositions for Reasoning in Graphical models ∗
F. Bacchus, Shannon Dalmao, T. Pitassi (2002)
Value Elimination: Bayesian Interence via Backtracking Search
M. Chavira, Adnan Darwiche, M. Jaeger (2006)
Compiling relational Bayesian networks for exact inferenceInt. J. Approx. Reason., 42
C. Bartels, J. Bilmes (2006)
Non-Minimal Triangulations for Mixed Stochastic/Deterministic Graphical ModelsArXiv, abs/1206.6825
G. Cooper (1990)
The Computational Complexity of Probabilistic Inference Using Bayesian Belief NetworksArtif. Intell., 42
R. Dechter (1995)
Constraint Processing
(2000)
Resolution vs
Craig Boutilier, N. Friedman, M. Goldszmidt, D. Koller (1996)
Context-Specific Independence in Bayesian NetworksArXiv, abs/1302.3562
R. Mateescu, R. Dechter (2007)
AND/OR Multi-Valued Decision Diagrams (AOMDDs) for Weighted Graphical ModelsArXiv, abs/1206.5266
D. Poole (1997)
Probabilistic Partial Evaluation: Exploiting Rule Structure in Probabilistic Inference
N. Nilsson (1980)
Principles of Artificial IntelligenceIEEE Transactions on Pattern Analysis and Machine Intelligence, PAMI-3
Eugene Freuder, M. Quinn (1985)
Taking Advantage of Stable Sets of Variables in Constraint Satisfaction Problems
J. Ott (1985)
Analysis of Human Genetic Linkage
D. Heckerman (2013)
A Tractable Inference Algorithm for Diagnosing Multiple DiseasesArXiv, abs/1304.1511
R. Dechter, R. Mateescu (2004)
Mixtures of Deterministic-Probabilistic Networks and their AND/OR Search SpaceArXiv, abs/1207.4119
T. Sang, F. Bacchus, P. Beame, Henry Kautz, T. Pitassi (2004)
Combining Component Caching and Clause Learning for Effective Model Counting
J. Pearl (1991)
Probabilistic reasoning in intelligent systems - networks of plausible inference
R. Mateescu, R. Dechter (2005)
The Relationship Between AND/OR Search and Variable EliminationArXiv, abs/1207.1407
Kalev Kask, R. Dechter, J. Larrosa, A. Dechter (2005)
Unifying tree decompositions for reasoning in graphical modelsArtif. Intell., 166
I. Rish, R. Dechter (2000)
Resolution versus Search: Two Strategies for SATJournal of Automated Reasoning, 24
R. Dechter, J. Pearl (1987)
Network-Based Heuristics for Constraint-Satisfaction ProblemsArtif. Intell., 34
The paper introduces mixed networks, a new graphical model framework for expressing and reasoning with probabilistic and deterministic information. The motivation to develop mixed networks stems from the desire to fully exploit the deterministic information (constraints) that is often present in graphical models. Several concepts and algorithms specific to belief networks and constraint networks are combined, achieving computational efficiency, semantic coherence and user-interface convenience. We define the semantics and graphical representation of mixed networks, and discuss the two main types of algorithms for processing them: inference-based and search-based. A preliminary experimental evaluation shows the benefits of the new model.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Apr 25, 2009
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.