Knowledge compilation properties of tree-of-BDDs

Authors:
Sathiamoorthy Subbarayan;Lucas Bordeaux;Youssef Hamadi
Affiliations:
IT University of Copenhagen, Denmark;Microsoft Research, Cambridge, UK;Microsoft Research, Cambridge, UK
Venue:
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Year:
2007

Citing 11
Cited 7

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Decomposing constraint satisfaction problems using database techniques

Artificial Intelligence
Decomposable negation normal form

Journal of the ACM (JACM)
Hierarchical Representations of Discrete Functions, with Application to Model Checking

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Constraint Processing

Constraint Processing
Compiling CSPs into Tree-Driven Automata for Interactive Solving

Constraints
On the use of partially ordered decision graphs for knowledge compilation and quantified Boolean formulae

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
A knowledge compilation map

Journal of Artificial Intelligence Research
DPLL with a trace: from SAT to knowledge compilation

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Compiling constraint networks into AND/OR multi-valued decision diagrams (AOMDDs)

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Integrating CSP decomposition techniques and BDDs for compiling configuration problems

CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Extending the Knowledge Compilation Map: Closure Principles

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Extending the knowledge compilation map: Krom, Horn, affine and beyond

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Knowledge compilation properties of trees-of-BDDs, revisited

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Existential closures for knowledge compilation

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Distributed tree decomposition with privacy

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Just-in-time compilation of knowledge bases

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Knowledge compilation for model counting: affine decision trees

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.