On probabilistic inference by weighted model counting

2007/11/14 by Mark Chavira, Adnan Darwiche · 376 citations
Computer Science · Decision Sciences · Mathematics · #Algorithm #Artificial intelligence #Base (topology) #Bayesian Modeling and Causal Inference #Bayesian inference #Bayesian network #Bayesian probability #Computer science #Data Management and Algorithms #Data Quality and Management #Dimension (graph theory) #Inference #Knowledge base #Mathematics #Probabilistic logic #Propositional formula #Propositional variable #Statistical model #Theoretical computer science

paper · pdf · doi:10.1016/j.artint.2007.11.002

published in Artificial Intelligence 172(6-7), 772-799 (Elsevier BV)

openalex publication_date 2007/11/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/01

Cited by

• NeST: The neuro-symbolic transpiler
• Knowledge Compilation with Continuous Random Variables and its Application in Hybrid Probabilistic Logic Programming
• flip-hoisting: Exploiting Repeated Parameters in Discrete Probabilistic Programs
• Semiring Programming: A Declarative Framework for Generalized Sum Product Problems
• How to Square Tensor Networks and Circuits Without Squaring Them
• From Alternation to FPRAS: Toward a Complexity Classification of Approximate Counting
• Approximate Optimal Active Learning of Decision Trees
• Structured Message Passing
• Price Updating in Combinatorial Prediction Markets with Bayesian Networks
• On the Tractability of SHAP Explanations
• Efficient Generation of Structured Objects with Constrained Adversarial Networks
• Skolemization for Weighted First-Order Model Counting
• A Semantic Loss Function for Deep Learning with Symbolic Knowledge
• Attn-JGNN: Attention Enhanced Join-Graph Neural Networks
• A Model Counter's Guide to Probabilistic Systems
• On Scalable Testing of Samplers
• Beyond the Grounding Bottleneck: Datalog Techniques for Inference in Probabilistic Logic Programs (Technical Report)
• Constrained Machine Learning Through Hyperspherical Representation
• Determining the Most Promising Selective Backbone Size for Partial Knowledge Compilation
• On the Relevance of Logic for Artificial Intelligence, and the Promise of Neurosymbolic Learning
• Approximation by Quantization
• On Testing of Samplers
• The Complexity of Bayesian Networks Specified by Propositional and Relational Languages
• Efficient Search-Based Weighted Model Integration
• diff-SAT -- A Software for Sampling and Probabilistic Reasoning for SAT and Answer Set Programming
• Quantum Physics using Weighted Model Counting
• Tuning Random Generators: Property-Based Testing as Probabilistic Programming
• Measuring Adverse Drug Effects on Multimorbity using Tractable Bayesian Networks
• The DeepLog Neurosymbolic Machine
• Learning Probabilistic Logic Programs in Continuous Domains
• On Compiling DNNFs without Determinism
• Taming Discrete Integration via the Boon of Dimensionality
• Efficient Volume Computation for SMT Formulas
• Numerical Considerations in Weighted Model Counting
• Counting the Number of Solutions to Constraints
• Fairness as a Program Property
• Understanding the Complexity of Lifted Inference and Asymmetric Weighted Model Counting
• Faster Lifting for Ordered Domains with Predecessor Relations
• Approximate SMT Counting Beyond Discrete Domains
• Model-based stochastic analysis with probabilistic graph query evaluation
• Hybrid Probabilistic Inference with Logical Constraints: Tractability and Message Passing
• New Algorithms for #2-SAT and #3-SAT
• Backdoors to Satisfaction
• Complexity Analysis and Variational Inference for Interpretation-based Probabilistic Description Logic
• A New Perspective on Learning Context-Specific Independence
• Defining neurosymbolic AI
• Neurosymbolic Reasoning Shortcuts under the Independence Assumption
• Approximate Inference in Discrete Distributions with Monte Carlo Tree Search and Value Functions
• On Relaxing Determinism in Arithmetic Circuits
• Monte Carlo Anti-Differentiation for Approximate Weighted Model Integration
• Fusing First-order Knowledge Compilation and the Lifted Junction Tree Algorithm
• Abstracting Probabilistic Models: A Logical Perspective
• Polynomial-Time Relational Probabilistic Inference in Open Universes
• Thinking Out of the Box: Hybrid SAT Solving by Unconstrained Continuous Optimization
• Causal Effect Identification with Context-specific Independence Relations of Control Variables
• Weighted Positive Binary Decision Diagrams for Exact Probabilistic Inference
• Tractable Querying and Learning in Hybrid Domains via Sum-Product Networks
• On the Role of Canonicity in Bottom-up Knowledge Compilation
• Logical Abstractions for Noisy Variational Quantum Algorithm Simulation
• Counting Solutions of Constraint Satisfiability Problems:Exact Phase Transitions and Approximate Algorithm
• Curriculum Abductive Learning
• A Neuro-Symbolic Framework for Sequence Classification with Relational and Temporal Knowledge
• Formula-Based Probabilistic Inference
• Weighted Model Counting in the two variable fragment with Cardinality Constraints: A Closed Form Formula
• Lazy Explanation-Based Approximation for Probabilistic Logic Programming
• Knowledge compilation of logic programs using approximation fixpoint theory
• Constrained Machine Learning Through Hyperspherical Representation
• Logic + probabilistic programming + causal laws. [europepmc]
• Causal Structure Learning Assumptions Shape Counterfactual Safety: Expert-Guided Constraints vs. Data-Driven DAGs with Probabilistic Logic Twin Networks. [europepmc]
• Formal Verification of Interoperability Between Future Network Architectures Using Alloy [europepmc]