Journal of the ACM (JACM)
Zero-suppressed BDDs for set manipulation in combinatorial problems
DAC '93 Proceedings of the 30th international Design Automation Conference
Handbook of combinatorics (vol. 1)
Handbook of combinatorics (vol. 1)
GRASP—a new search algorithm for satisfiability
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
An experimental study of an opportunistic index
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
A machine program for theorem-proving
Communications of the ACM
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Faster SAT and smaller BDDs via common function structure
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Ordered Binary Decision Diagrams and the Davis-Putnam Procedure
CCL '94 Proceedings of the First International Conference on Constraints in Computational Logics
Resolution and binary decision diagrams cannot simulate each other polynomially
Resolution and binary decision diagrams cannot simulate each other polynomially
Multi-resolution on compressed sets of clauses
ICTAI '00 Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence
Resolution cannot polynomially simulate compressed-BFS
Annals of Mathematics and Artificial Intelligence
Symbolic Techniques in Satisfiability Solving
Journal of Automated Reasoning
Extended resolution simulates binary decision diagrams
Discrete Applied Mathematics
A Resolution Calculus with Shared Literals
Fundamenta Informaticae
SymChaff: a structure-aware satisfiability solver
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Extended resolution proofs for conjoining BDDs
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Search vs. symbolic techniques in satisfiability solving
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Extended resolution proofs for symbolic SAT solving with quantification
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
A Resolution Calculus with Shared Literals
Fundamenta Informaticae
| Hi-index | 0.00 |
Leading algorithms for Boolean satisfiability (SAT) are based on either a depth-first tree traversal of the search space (the DLL procedure [6]) or resolution (the DP procedure [7]). In thiswork we introduce a variant of Breadth-First Search (BFS) based on the ability of Zero-Suppressed Binary Decision Diagrams (ZDDs) to compactly represent sparse or structured collections of subsets. While a BFS may require an exponential amount of memory, our new algorithm performs BFS directly with an implicit representation and achieves unconventional reductions in the search space.We empirically evaluate our implementation on classical SAT instances difficult for DLL/DP solvers. Our main result is the empirical 驴(n4) runtime for holen instances, on which DLL solvers require exponential time.