Mixed deterministic and probabilistic networks
From MaRDI portal
Publication:841632
DOI10.1007/s10472-009-9132-yzbMath1176.68200OpenAlexW2109325056WikidataQ38386187 ScholiaQ38386187MaRDI QIDQ841632
Publication date: 18 September 2009
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://europepmc.org/articles/pmc2963443
Parametric inference under constraints (62F30) Bayesian inference (62F15) Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Exact stochastic constraint optimisation with applications in network analysis ⋮ Importance Sampling on Bayesian Networks with Deterministic Causalities ⋮ SampleSearch: importance sampling in presence of determinism
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models
- Answering queries from context-sensitive probabilistic knowledge bases
- AND/OR search spaces for graphical models
- Network-based heuristics for constraint-satisfaction problems
- Probabilistic Horn abduction and Bayesian networks
- Boosting search with variable elimination in constraint optimization and constraint satisfaction problems
- Resolution versus search: Two strategies for SAT
- Bucket elimination: A unifying framework for reasoning
- Unifying tree decompositions for reasoning in graphical models
- Markov logic networks
- Compiling relational Bayesian networks for exact inference
- Nonserial dynamic programming
- The computational complexity of probabilistic inference using Bayesian belief networks
- Valuation-Based Systems for Bayesian Decision Analysis
- PROBABILISTIC DECISION GRAPHS — COMBINING VERIFICATION AND AI TECHNIQUES FOR PROBABILISTIC INFERENCE
- Recursive conditioning
