A Novel Approach to Combine a SLS- and a DPLL-Solver for the Satisfiability Problem

Authors:
Adrian Balint;Michael Henn;Oliver Gableske
Affiliations:
Institute of Theoretical Computer Science, Ulm University, Ulm, Germany 89069;Institute of Theoretical Computer Science, Ulm University, Ulm, Germany 89069;Institute of Theoretical Computer Science, Ulm University, Ulm, Germany 89069
Venue:
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Year:
2009

Citing 15
Cited 5

A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
Boosting complete techniques thanks to local search methods

Annals of Mathematics and Artificial Intelligence
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
A Hybrid Approach for SAT

CP '02 Proceedings of the 8th 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
An adaptive noise mechanism for walkSAT

Eighteenth national conference on Artificial intelligence
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Configuration landscape analysis and backbone guided local search: part I: Satisfiability and maximum satisfiability

Artificial Intelligence
A New Simulation-Based Property Checking Algorithm Based on Partitioned Alternative Search Space Traversal

IEEE Transactions on Computers
A new hybrid solution to boost SAT solver performance

Proceedings of the conference on Design, automation and test in Europe
Complete local search for propositional satisfiability

AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Effective incorporation of double look-ahead procedures

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Advances in local search for satisfiability

AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Improvements to hybrid incremental SAT algorithms

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Diversification and determinism in local search for satisfiability

SAT'05 Proceedings of the 8th 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
Improving stochastic local search for SAT with a new probability distribution

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
IslandSAT

International Journal of Advanced Intelligence Paradigms
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper at hand presents a novel and generic approach on how to combine a SLS and a DPLL solver to create an incomplete hybrid SAT solver. In our approach, the SLS solver gets supported by a DPLL solver to boost its performance. In order to develop the idea behind our approach, we first define the term of a search space partition (SSP) and explain its construction and use. For testing our new approach, which utilizes SSPs, we implemented it in the solver hybridGM , using gNovelty+ and March_ks . After explaining the implementation details, we perform an empirical study on several publicly available benchmarks in order to test the performance of the new hybrid SAT solver. The results indicate a superior performance of hybridGM over gNovelty+ , proving our new approach to be worthwhile.