A compiler for deterministic, decomposable negation normal form

Authors:
Adnan Darwiche
Affiliations:
Computer Science Department, University of California, Los Angeles, CA
Venue:
Eighteenth national conference on Artificial intelligence
Year:
2002

Citing 8
Cited 28

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
A machine program for theorem-proving

Communications of the ACM
Decomposable negation normal form

Journal of the ACM (JACM)
Faster SAT and smaller BDDs via common function structure

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Efficient Boolean Manipulation with OBDD's Can be Extended to FBDD's

IEEE Transactions on Computers
Counting Models Using Connected Components

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
The good old Davis-Putnam procedure helps counting models

Journal of Artificial Intelligence Research
A perspective on knowledge compilation

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1

A differential approach to inference in Bayesian networks

Journal of the ACM (JACM)
On Stratified Belief Base Compilation

Annals of Mathematics and Artificial Intelligence
Compiling propositional weighted bases

Artificial Intelligence - Special issue on nonmonotonic reasoning
On probabilistic inference by weighted model counting

Artificial Intelligence
Heuristics for planning with penalties and rewards formulated in logic and computed through circuits

Artificial Intelligence
Probabilistic Argumentation Systems with Decision Variables

Informatica
Efficient Genome Wide Tagging by Reduction to SAT

WABI '08 Proceedings of the 8th international workshop on Algorithms in Bioinformatics
Logical Compilation of Bayesian Networks with Discrete Variables

ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Approximate compilation for embedded model-based reasoning

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Using more reasoning to improve #SAT solving

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
New compilation languages based on structured decomposability

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
The language of search

Journal of Artificial Intelligence Research
A dynamic approach to MPE and weighted MAX-SAT

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
A structure-based variable ordering heuristic for SAT

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
DPLL with a trace: from SAT to knowledge compilation

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Model compilation for real-time planning and diagnosis with feedback

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Using probabilistic argumentation for key validation in public-key cryptography

International Journal of Approximate Reasoning
New advances in logic-based probabilistic modeling by PRISM

Probabilistic inductive logic programming
RALF: reliability analysis for logic faults: an exact algorithm and its applications

Proceedings of the Conference on Design, Automation and Test in Europe
Phase transitions in knowledge compilation: an experimental study

SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
A new approach to model counting

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Approximate model-based diagnosis using preference-based compilation

SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Encoding CNFs to empower component analysis

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Relax, compensate and then recover

JSAI-isAI'10 Proceedings of the 2010 international conference on New Frontiers in Artificial Intelligence
Survey: The consequences of eliminating NP solutions

Computer Science Review
A scalable and nearly uniform generator of SAT witnesses

CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
A generic framework for a compilation-based inference in probabilistic and possibilistic networks

Information Sciences: an International Journal
Inference using compiled min-based possibilistic causal networks in the presence of interventions

Fuzzy Sets and Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

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 number of operations in polynomial time, including clausal entailment; model counting, minimization and enumeration; and probabilistic equivalence testing, d-DNNFs are also known to be a superset of, and more succinct than, OBDDs. The polytime logical operations supported by d-DNNFs are a subset of those supported by OBDDs, yet are sufficient for model-based diagnosis and planning applications. We present experimental results on compiling a variety of CNF formulas, some generated randomly and others corresponding to digital circuits. A number of the formulas we were able to compile efficiently could not be similarly handled by some state-of-the-art model counters, nor by some state-of-the-art OBDD compilers.