Knowledge Compilation Properties of Tree-of-BDDs

We present a CNF to Tree-of-BDDs (ToB) compiler with complexity at most exponential in the tree width. We then present algorithms for interesting queries on ToB. Although some of the presented query algorithms are in the worst case exponential in the tree width, our experiments show that ToB can answer non-trivial queries like clausal entailment in reasonable time for several realistic instances. While our ToB-tool compiles all the used 91 instances, d-DNNF compilation failed for 12 or 8 of them based on the decomposition heuristic used. Also, on the succeeded instances, a d-DNNF is up to 1000 times larger than the matching ToB. The ToB compilations are often an order of magnitude faster than the d-DNNF compilation. This makes ToB a quite interesting knowledge compilation form.

[1]  E BryantRandal.  Graph-Based Algorithms for Boolean Function Manipulation , 1986 .

[2]  Rina Dechter,et al.  Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs) , 2006, CP.

[3]  Rina Dechter,et al.  Constraint Processing , 1995, Lecture Notes in Computer Science.

[4]  Uue Kjjrull.  Triangulation of Graphs { Algorithms Giving Small Total State Space Triangulation of Graphs { Algorithms Giving Small Total State Space , 1990 .

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

[6]  Marc Gyssens,et al.  Decomposing Constraint Satisfaction Problems Using Database Techniques , 1994, Artif. Intell..

[7]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

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

[9]  Sathiamoorthy Subbarayan,et al.  Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems , 2005, CPAIOR.

[10]  B. Mohar,et al.  Graph Minors , 2009 .

[11]  B. A. Reed,et al.  Algorithmic Aspects of Tree Width , 2003 .

[12]  Pierre Marquis,et al.  A Knowledge Compilation Map , 2002, J. Artif. Intell. Res..

[13]  Hélène Fargier,et al.  Compiling CSPs into Tree-Driven Automata for Interactive Solving , 2003, Constraints.

[14]  Adnan Darwiche,et al.  DPLL with a Trace: From SAT to Knowledge Compilation , 2005, IJCAI.

[15]  Kenneth L. McMillan.  Hierarchical Representations of Discrete Functions, with Application to Model Checking , 1994, CAV.

[16]  Paul D. Seymour,et al.  Graph Minors. II. Algorithmic Aspects of Tree-Width , 1986, J. Algorithms.