Efficient local search for very large-scale satisfiability problems
ACM SIGART Bulletin
Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Improvements to propositional satisfiability search algorithms
Improvements to propositional satisfiability search algorithms
Experimental results on the crossover point in random 3-SAT
Artificial Intelligence - Special volume on frontiers in problem solving: phase transitions and complexity
A machine program for theorem-proving
Communications of the ACM
Tabu Search
Boosting complete techniques thanks to local search methods
Annals of Mathematics and Artificial Intelligence
Implementing the Davis–Putnam Method
Journal of Automated Reasoning
Local Search Algorithms for SAT: An Empirical Evaluation
Journal of Automated Reasoning
CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Local Search with Constraint Propagation and Conflict-Based Heuristics
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Test Pattern Generation for Realistic Bridge Faults in CMOS ICs
Proceedings of the IEEE International Test Conference on Test: Faster, Better, Sooner
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Journal of Artificial Intelligence Research
Ten challenges in propositional reasoning and search
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Heuristics based on unit propagation for satisfiability problems
IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Pushing the envelope: planning, propositional logic, and stochastic search
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
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
Heuristic-guided counterexample search in FLAVERS
Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering
A competitive and cooperative approach to propositional satisfiability
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
A new hybrid solution to boost SAT solver performance
Proceedings of the conference on Design, automation and test in Europe
Discrete Applied Mathematics
A Novel Approach to Combine a SLS- and a DPLL-Solver for the Satisfiability Problem
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Disco - Novo - GoGo: integrating local search and complete search with restarts
AAAI'06 proceedings of the 21st national conference on Artificial intelligence - Volume 2
Three truth values for the SAT and Max-SAT problems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A decision-making procedure for resolution-based SAT-solvers
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Improvements to hybrid incremental SAT algorithms
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Boosting local search thanks to CDCL
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
A component language for hybrid solver cooperations
ADVIS'04 Proceedings of the Third international conference on Advances in Information Systems
Using cross-entropy for satisfiability
Proceedings of the 28th Annual ACM Symposium on Applied Computing
A survey of the satisfiability-problems solving algorithms
International Journal of Advanced Intelligence Paradigms
| Hi-index | 0.00 |
Exploiting variable dependencies has been shown very useful in local search algorithms for SAT. In this paper, we extend the use of such dependencies by hybridizing a local search algorithm, Walksat, and the DPLL procedure, Satz. At each node reached in the DPLL search tree to a fixed depth, we construct the literal implication graph. Its strongly connected components are viewed as equivalency classes. Each one is substituted by a unique representative literal to reduce the constructed graph and the input formula. Finally, the implication dependencies are closed under transitivity. The resulted implications and equivalencies are exploited by Walksat at each node of the DPLL tree. Our approach is motivated by the power of the branching rule used in Satz that may provide a valid path to a solution, and generate more implications at deep nodes. Experimental results confirm the efficiency of our approach.