Efficient local search for very large-scale satisfiability problems
ACM SIGART Bulletin
Boosting combinatorial search through randomization
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
On the run-time behaviour of stochastic local search algorithms for SAT
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
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)
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Information and Computation
Resolution versus Search: Two Strategies for SAT
Journal of Automated Reasoning
Nonsystematic Search and No-Good Learning
Journal of Automated Reasoning
Using Randomization and Learning to Solve Hard Real-World Instances of Satisfiability
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Resolution is Not Automatizable Unless W[P] is Tractable
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Formal methods for the validation of automotive product configuration data
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
Random backtracking in backtrack search algorithms for satisfiability
Discrete Applied Mathematics
Complete local search for propositional satisfiability
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Ten challenges in propositional reasoning and search
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
A new method for solving hard satisfiability problems
AAAI'92 Proceedings of the tenth national conference on Artificial intelligence
Encoding First Order Proofs in SAT
CADE-21 Proceedings of the 21st international conference on Automated Deduction: Automated Deduction
Refutation by randomised general resolution
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
A new incomplete method for CSP inconsistency checking
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
GUNSAT: a greedy local search algorithm for unsatisfiability
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Finding unsatisfiable subformulas with stochastic method
IDEAL'07 Proceedings of the 8th international conference on Intelligent data engineering and automated learning
Improvements to hybrid incremental SAT algorithms
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
A heuristic local search algorithm for unsatisfiable cores extraction
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part III
An overview of parallel SAT solving
Constraints
A survey of the satisfiability-problems solving algorithms
International Journal of Advanced Intelligence Paradigms
| Hi-index | 0.00 |
Local search is widely applied to satisfiable SAT problems, and on some classes outperforms backtrack search. An intriguing challenge posed by Selman, Kautz and McAllester in 1997 is to use it instead to prove unsatisfiability. We investigate two distinct approaches. Firstly we apply standard local search to a reformulation of the problem, such that a solution to the reformulation corresponds to a refutation of the original problem. Secondly we design a greedy randomised resolution algorithm that will eventually discover proofs of any size while using bounded memory. We show experimentally that both approaches can refute some problems more quickly than backtrack search.