Abstract

Abstract. 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 polynomial time. The new implementation is based on latest techniques from both the SAT and OBDD literatures, and appears to be orders of magnitude more efficient than previous algorithms for this purpose. We compare our compiler experimentally to state of the art model counters, OBDD compilers, and previous CNF2dDNNF compilers. 1

Citations

2605	Graph-based algorithms for Boolean function manipulation - Bryant - 1986
909	Chaff: Engineering an efficient SAT solver - Moskewicz, Madigan, et al. - 2001
287	GRASP – a new search algorithm for satisfiability - Silva, Sakallah - 1997
121	A knowledge compilation map - Darwiche, Marquis - 2002
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
43	Compiling relational Bayesian networks for exact inference - Chavira, Darwiche, et al. - 2006
42	On the tractable counting of theory models and its application to belief revision and truth maintenance. CoRR cs.AI/0003044 - Darwiche
42	A compiler for deterministic, decomposable negation normal form - Darwiche - 2002
39	Efficient analysis and manipulation of OBDDs can be extended to FBDDs - Meinel - 1994