An Exhaustive DPLL Algorithm for Model Counting

  title={An Exhaustive DPLL Algorithm for Model Counting},
  author={Umut Oztok and Adnan Darwiche},
  journal={J. Artif. Intell. Res.},
State-of-the-art model counters are based on exhaustive DPLL algorithms, and have been successfully used in probabilistic reasoning, one of the key problems in AI. In this article, we present a new exhaustive DPLL algorithm with a formal semantics, a proof of correctness, and a modular design. The modular design is based on the separation of the core model counting algorithm from SAT solving techniques. We also show that the trace of our algorithm belongs to the language of Sentential Decision… 

Figures and Tables from this paper

Integrating Tree Decompositions into Decision Heuristics of Propositional Model Counters

This paper shows that integrating tree decompositions of low width into the decision heuristics of a reference exact model counter (SharpSAT) significantly improves its runtime performance.

Four Flavors of Entailment

A novel approach for enumerating partial models of a propositional formula, inspired by how theory solvers and the SAT solver interact in lazy SMT is presented, with potential applications in weighted model counting and weighted model integration for probabilistic inference over Boolean and hybrid domains.

Phase Transition Behavior in Knowledge Compilation

A rigorous empirical study and analysis of the size and runtime behavior for different knowledge compilation forms (and their corresponding compilation algorithms): d-DNNFs, SDDs and OBDDs across multiple tools and compilation algorithms.

On The Reasons Behind Decisions

A theory for unveiling the reasons behind the decisions made by Boolean classifiers is presented and notions such as sufficient, necessary and complete reasons behind decisions are defined, in addition to classifier and decision bias.

Tractable Boolean and Arithmetic Circuits

  • Adnan Darwiche
  • Computer Science
    Neuro-Symbolic Artificial Intelligence
  • 2021
This chapter reviews the foundations of tractable circuits and some associated milestones, while focusing on their core properties and techniques that make them particularly useful for the broad aims of neuro-symbolic AI.

How to Exploit Structure while Solving Weighted Model Integration Problems

A new algorithm is introduced, F-XSDD, that lifts restrictions and can exploit factorizability in WMI problems with multivariate conditions and partially factorizable weight functions and is shown to be effective through an empirical evaluation.

Three Modern Roles for Logic in AI

We consider three modern roles for logic in artificial intelligence, which are based on the theory of tractable Boolean circuits: (1) logic as a basis for computation, (2) logic for learning from a

Algoritmo para el conteo de modelos en FNC

This document presents an algorithm for the counting of models of a formula specified in conjunctive normal form (FNC), using patterns represented as strings of zeros, ones and asterisks, which



A compiler for deterministic, decomposable negation normal form

We present a compiler for converting CNF formulas into deterministic, decomposable negation normal form (d-DNNF). This is a logical form that has been identified recently and shown to support a

Using DPLL for Efficient OBDD Construction

This work proposes two DPLL-based algorithms that construct OBDDs for CNF formulas that have a worst-case complexity that is linear in the number of variables and size of the CNF, and exponential only in the cutwidth or pathwidth of the variable ordering.

On Compiling CNF into Decision-DNNF

A new notion of CNF width is introduced and an algorithm that compiles CNFs into Decision-DNNFs in time and space that are exponential only in this width is provided, which leads to a tighter bound on the complexity of model counting.

The Good Old Davis-Putnam Procedure Helps Counting Models

An algorithm is presented that computes the exact number of models of a propositional CNF or DNF formula F using the Davis-Putnam procedure and the practical performance of CDP has been estimated in a series of experiments on a wide variety of CNF formulas.

A Top-Down Compiler for Sentential Decision Diagrams

This work presents a top-down CNF toSDD compiler that is based on techniques from the SAT literature, and compares the presented compiler empirically to the state-of-the-art, bottom-up SDD compiler, showing orders- of-magnitude improvements in compilation time.

The Language of Search

This paper shows that several versions of exhaustive DPLL search correspond to such well-known languages as FBDD, OBDD, and a precisely-defined subset of d-DNNF.

Anytime Inference in Probabilistic Logic Programs with Tp-Compilation

TP-compilation proceeds incrementally in that it interleaves the knowledge compilation step for weighted model counting with forward reasoning on the logic program, which leads to a novel anytime algorithm that provides hard bounds on the inferred probabilities.

New Advances in Compiling CNF into Decomposable Negation Normal Form

We describe a new algorithm for compiling conjunctive normal form (CNF) into Deterministic Decomposable Negation Normal (d-DNNF), which is a tractable logical form that permits model counting in

Compiling Probabilistic Graphical Models Using Sentential Decision Diagrams

A novel and efficient way to encode the factors of a given model directly to SDDs, bypassing the CNF representation is described, which is as effective as those based on d-DNNFs, and at times, orders-of-magnitude faster.

Performing Bayesian Inference by Weighted Model Counting

An efficient translation from Bayesian networks to weighted model counting, extend the best model-counting algorithms to weightedmodel counting, develop an efficient method for computing all marginals in a single counting pass, and evaluate the approach on computationally challenging reasoning problems.