Proceedings of the 38th annual Design Automation Conference
Satometer:: how much have we searched?
Proceedings of the 39th annual Design Automation Conference
SAT and ATPG: algorithms for Boolean decision problems
Logic Synthesis and Verification
A Compressed Breadth-First Search for Satisfiability
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
The Quest for Efficient Boolean Satisfiability Solvers
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Journal of Symbolic Computation
Annals of Mathematics and Artificial Intelligence
Resolution cannot polynomially simulate compressed-BFS
Annals of Mathematics and Artificial Intelligence
Integrating CNF and BDD based SAT solvers
HLDVT '03 Proceedings of the Eighth IEEE International Workshop on High-Level Design Validation and Test Workshop
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Symbolic Techniques in Satisfiability Solving
Journal of Automated Reasoning
Extended resolution simulates binary decision diagrams
Discrete Applied Mathematics
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Compiling all possible conflicts of a CSP
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Search vs. symbolic techniques in satisfiability solving
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
On subsumption removal and on-the-fly CNF simplification
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Embedding memoization to the semantic tree search for deciding QBFs
AI'04 Proceedings of the 17th Australian joint conference on Advances in Artificial Intelligence
| Hi-index | 0.00 |
Abstract: The paper presents a system based on new operators for handling sets of propositional clauses represented by means of ZBDDs (zero-suppressed binary decision diagrams). The high compression power of such data structures allows efficient encodings of structured instances. A specialized operator for the distribution of sets of clauses is introduced and used for performing multi-resolution on clause sets. Cut eliminations between sets of clauses of exponential size may then be performed using polynomial size data structures. The ZREs system, a new implementation of the Davis-Putnam procedure (M. Davis and H. Putnam, 1960), solves two hard problems for resolution, that are currently out of the scope of the best SAT provers.