Resolution tunnels for improved SAT solver performance

Authors:
Michal Kouril;John Franco
Affiliations:
University of Cincinnati, Cincinnati, OH;University of Cincinnati, Cincinnati, OH
Venue:
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Year:
2005

Citing 18
Cited 5

Graph-Based Algorithms for Boolean Function Manipulation

IEEE Transactions on Computers
Hard examples for resolution

Journal of the ACM (JACM)
Many hard examples for resolution

Journal of the ACM (JACM)
Efficient implementation of a BDD package

DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Efficient local search for very large-scale satisfiability problems

ACM SIGART Bulletin
Progressions in every two-coloration of Zn

Journal of Combinatorial Theory Series A
Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
On the complexity of unsatisfiability proofs for random k-CNF formulas

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
Short proofs are narrow—resolution made simple

Journal of the ACM (JACM)
Random 3-SAT and BDDs: The Plot Thickens Further

CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Simplified and improved resolution lower bounds

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Binary Decision Diagrams

IEEE Transactions on Computers
Solving satisfiability in less than 2n steps

Discrete Applied Mathematics
Towards an understanding of hill-climbing procedures for SAT

AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Evidence for invariants in local search

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Search vs. symbolic techniques in satisfiability solving

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing

Finding Lean Induced Cycles in Binary Hypercubes

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Dynamic interoperable message passing

PVM/MPI'05 Proceedings of the 12th European PVM/MPI users' group conference on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Constraint Satisfaction Problems in Clausal Form I: Autarkies and Deficiency

Fundamenta Informaticae
SCSat: a soft constraint guided SAT solver

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Double-wheel graphs are graceful

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show how to aggressively add uninferred constraints, in a controlled manner, to formulae for finding Van der Waerden numbers during search. We show that doing so can improve the performance of standard SAT solvers on these formulae by orders of magnitude. We obtain a new and much greater lower bound for one of the Van der Waerden numbers, specifically a bound of 1132 for W(2,6). We believe this bound to actually be the number we seek. The structure of propositional formulae for solving Van der Waerden numbers is similar to that of formulae arising from Bounded Model Checking. Therefore, we view this as a preliminary investigation into solving hard formulae in the area of Formal Verification.