A Compiler for Deterministic, Decomposable Negation Normal Form

A Compiler for Deterministic, Decomposable Negation Normal Form (2002)

Cached

Download Links

[www.cs.ucla.edu]

Other Repositories/Bibliography

DBLP

by Adnan Darwiche

Citations:

42 - 10 self

BibTeX

@MISC{Darwiche02acompiler,
    author = {Adnan Darwiche},
    title = {A Compiler for Deterministic, Decomposable Negation Normal Form},
    year = {2002}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

We present a compiler for converting CNF formulas into deterministic, decomposable negation normal form (d-DNNF). This is a

Citations

2605	Graph-based algorithms for Boolean function manipulation - Bryant - 1986
636	A machine program for theorem proving - Davis, Logemann, et al. - 1962
88	Decomposable negation normal form - Darwiche
53	Equivalence of free boolean graphs can be decided probabilistically in polynomial time. Information Processing Letters 10(2):80–82 - Blum, Chandra, et al. - 1980
42	On the tractable counting of theory models and its application to belief revision and truth maintenance. CoRR cs.AI/0003044 - Darwiche
40	A logical approach to factoring belief networks - Darwiche - 2002
39	Efficient analysis and manipulation of OBDDs can be extended to FBDDs - Meinel - 1994
36	Counting models using connected components - Bayardo, Pehoushek - 2000
30	The good old Davis-Putnam procedure helps counting models - Birnbaum, Lozinskii - 1999
27	Faster SAT and Smaller BDDs via Common Function Structure - Aloul, Markov, et al. - 2001
23	A perspective on knowledge compilation - Darwiche, Marquis - 2001
16	Using recursive decomposition to construct elimination orders, jointrees, and dtrees - Darwiche, Hopkins
13	The calculus of logic - Boole
5	Testing equivalence probabilistically - Darwiche, Huang - 2002