Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
On the hardness of approximate reasoning
Artificial Intelligence
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Decomposable negation normal form
Journal of the ACM (JACM)
Stochastic Boolean Satisfiability
Journal of Automated Reasoning
Efficient Boolean Manipulation with OBDD's Can be Extended to FBDD's
IEEE Transactions on Computers
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Algorithms and Complexity Results for #SAT and Bayesian Inference
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Equivalent literal propagation in the DLL procedure
Discrete Applied Mathematics - The renesse issue on satisfiability
Modeling and Reasoning with Bayesian Networks
Modeling and Reasoning with Bayesian Networks
Vivifying Propositional Clausal Formulae
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Extending SAT Solvers to Cryptographic Problems
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Performing Bayesian inference by weighted model counting
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Knowledge compilation properties of tree-of-BDDs
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Extending the knowledge compilation map: Krom, Horn, affine and beyond
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
New compilation languages based on structured decomposability
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
Journal of Artificial Intelligence Research
Journal of Artificial Intelligence Research
Compilation for critically constrained knowledge bases
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Trivium: a stream cipher construction inspired by block cipher design principles
ISC'06 Proceedings of the 9th international conference on Information Security
SDD: a new canonical representation of propositional knowledge bases
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Existential closures for knowledge compilation
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Dsharp: fast d-DNNF compilation with sharpSAT
Canadian AI'12 Proceedings of the 25th Canadian conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |
Counting the models of a propositional formula is a key issue for a number of AI problems, but few propositional languages offer the possibility to count models efficiently. In order to fill the gap, we introduce the language EADT of (extended) affine decision trees. An extended affine decision tree simply is a tree with affine decision nodes and some specific decomposable conjunction or disjunction nodes. Unlike standard decision trees, the decision nodes of an EADT formula are not labeled by variables but by affine clauses. We study EADT, and several subsets of it along the lines of the knowledge compilation map. We also describe a CNF-to-EADT compiler and present some experimental results. Those results show that the EADT compilation-based approach is competitive with (and in some cases is able to outperform) the model counter Cachet and the d-DNNF compilation-based approach to model counting.