Journal of the ACM (JACM)
Many hard examples for resolution
Journal of the ACM (JACM)
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
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Enhancing Davis Putnam with extended binary clause reasoning
Eighteenth national conference on Artificial intelligence
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
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 backbone-search heuristic for efficient solving of hard 3-SAT formulae
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Another complete local search method for SAT
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Effective preprocessing in SAT through variable and clause elimination
SAT'05 Proceedings of the 8th 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
Local search for unsatisfiability
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
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
Improving GASAT by replacing tabu search by DLM and enhancing the best members
Artificial Intelligence Review
International Journal of Advanced Intelligence Paradigms
A survey of the satisfiability-problems solving algorithms
International Journal of Advanced Intelligence Paradigms
| Hi-index | 0.00 |
Local search algorithms for satisfiability testing are still the best methods for a large number of problems, despite tremendous progresses observed on complete search algorithms over the last few years. However, their intrinsic limit does not allow them to address UNSAT problems. Ten years ago, this question challenged the community without any answer: was it possible to use local search algorithm for UNSAT formulae? We propose here a first approach addressing this issue, that can beat the best resolution-based completemethods. We define the landscape of the search by approximating the number of filtered clauses by resolution proof. Furthermore, we add high-level reasoning mechanism, based on Extended Resolution and Unit Propagation Look-Ahead to make this new and challenging approach possible. Our new algorithm also tends to be the first step on two other challenging problems: obtaining short proofs for UNSAT problems and build a real local-search algorithm for QBF.