An Improved Decision-DNNF Compiler

We present and evaluate a new compiler, called D4, targeting the Decision-DNNF language. As the state-of-the-art compilers C2D and Dsharp targeting the same language, D4 is a top-down treesearch algorithm exploring the space of propositional interpretations. D4 is based on the same ingredients as those considered in C2D and Dsharp (mainly, disjoint component analysis, conflict analysis and non-chronological backtracking, component caching). D4 takes advantage of a dynamic decomposition approach based on hypergraph partitioning, used sparingly. Some simplification rules are also used to minimize the time spent in the partitioning steps and to promote the quality of the decompositions. Experiments show that the compilation times and the sizes of the Decision-DNNF representations computed by D4 are in many cases significantly lower than the ones obtained by C2D and Dsharp.

[1]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[2]  Ümit V. Çatalyürek,et al.  PaToH: Partitioning Tool for Hypergraphs , 1999 .

[3]  A. Darwiche,et al.  The Language of Search , 2007, J. Artif. Intell. Res..

[4]  Marco Cadoli,et al.  A Survey on Knowledge Compilation , 1997, AI Commun..

[5]  Henry A. Kautz,et al.  Performing Bayesian Inference by Weighted Model Counting , 2005, AAAI.

[6]  Toniann Pitassi,et al.  Combining Component Caching and Clause Learning for Effective Model Counting , 2004, SAT.

[7]  Pierre Marquis,et al.  On the Use of Partially Ordered Decision Graphs in Knowledge Compilation and Quantified Boolean Formulae , 2006, AAAI.

[8]  Jean-Marie Lagniez,et al.  Compiling Constraint Networks into Multivalued Decomposable Decision Graphs , 2015, IJCAI.

[9]  Adnan Darwiche,et al.  New Advances in Compiling CNF into Decomposable Negation Normal Form , 2004, ECAI.

[10]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[11]  Umut Oztok,et al.  A Top-Down Compiler for Sentential Decision Diagrams , 2015, IJCAI.

[12]  Jean-Marie Lagniez,et al.  Preprocessing for Propositional Model Counting , 2014, AAAI.

[13]  Marc Thurley,et al.  sharpSAT - Counting Models with Advanced Component Caching and Implicit BCP , 2006, SAT.

[14]  Hantao Zhang,et al.  An Efficient Algorithm for Unit Propagation , 1996 .

[15]  Christian J. Muise,et al.  Dsharp: Fast d-DNNF Compilation with sharpSAT , 2012, Canadian Conference on AI.

[16]  Umut Oztok,et al.  On Compiling CNF into Decision-DNNF , 2014, CP.

[17]  Adnan Darwiche,et al.  Decomposable negation normal form , 2001, JACM.

[18]  Adnan Darwiche.  Tractable Knowledge Representation Formalisms , 2014, Tractability.