On probabilistic inference by weighted model counting
From MaRDI portal
Publication:2389636
DOI10.1016/j.artint.2007.11.002zbMath1182.68297MaRDI QIDQ2389636
Publication date: 17 July 2009
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://www.escholarship.org/uc/item/7916m4fn
68T37: Reasoning under uncertainty in the context of artificial intelligence
Related Items
Knowledge compilation of logic programs using approximation fixpoint theory, Lifted Bayesian Filtering in Multiset Rewriting Systems, Lifted generative learning of Markov logic networks, \(T_{\mathcal{P}}\)-compilation for inference in probabilistic logic programs, Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models, Structured learning modulo theories, A new probabilistic constraint logic programming language based on a generalised distribution semantics, Learning to assign degrees of belief in relational domains, Computing and estimating the volume of the solution space of SMT(LA) constraints, Weighted positive binary decision diagrams for exact probabilistic inference, On conditional truncated densities Bayesian networks, The complexity of Bayesian networks specified by propositional and relational languages, Importance sampling-based estimation over AND/OR search spaces for graphical models, The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference, Semiring programming: a semantic framework for generalized sum product problems, Probabilistic sentence satisfiability: an approach to PSAT, Definability for model counting, Advanced SMT techniques for weighted model integration, On preprocessing techniques and their impact on propositional model counting, A survey of lifted inference approaches for probabilistic logic programming under the distribution semantics, Asymmetric hidden Markov models, Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks, Probabilistic inference with noisy-threshold models based on a CP tensor decomposition, Exploiting local and repeated structure in dynamic Bayesian networks, Backdoors to Satisfaction, Oblivious bounds on the probability of boolean functions, Marginalization without Summation Exploiting Determinism in Factor Algebra
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A differential semantics for jointree algorithms
- AND/OR search spaces for graphical models
- Compiling relational Bayesian networks for exact inference
- On the hardness of approximate reasoning
- A differential approach to inference in Bayesian networks
- On the Tractable Counting of Theory Models and its Application to Truth Maintenance and Belief Revision
- A machine program for theorem-proving
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Recursive conditioning
