A Novel Approach to Combine a SLS- and a DPLL-Solver for the Satisfiability Problem-Reference-Cited by-同舟云学术

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

Published:2009 Issue: Volume: Page:284-297
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Balint Adrian,Henn Michael,Gableske Oliver

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-02777-2_28

Reference23 articles.

1. Cook, S.: The Complexity of Theorem-Proving Procedures. In: Proceedings of the 3rd ACM Symposium on Theory of Computing, vol. 1, pp. 151–158 (1971)

2. Crawford, J.M.: Solving satisfiability problems using a combination of systematic and local search. In: Second DIMACS Challenge, Rutgers University, NJ (1993)

3. The bwGRiD, http://www.bw-grid.de/

4. Davis, M., Putnam, H.: A Computing Procedure for Quantification Theory. Journal of the ACM 7(3), 201–215 (1960)

5. Ferris, B., Fröhlich, J.: WalkSAT as an Informed Heuristic to DPLL in SAT Solving. Technical report, CSE 573: Artificial Intelligence (2004)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Deep Cooperation of CDCL and Local Search for SAT;Theory and Applications of Satisfiability Testing – SAT 2021;2021

2. On the Effect of Learned Clauses on Stochastic Local Search;Theory and Applications of Satisfiability Testing – SAT 2020;2020

3. Evolutionary Computation and Constraint Satisfaction;Springer Handbook of Computational Intelligence;2015

4. Entrusting Private Computation and Data to Untrusted Networks;IEEE Transactions on Dependable and Secure Computing;2013-07

5. Boosting Local Search Thanks to cdcl;Logic for Programming, Artificial Intelligence, and Reasoning;2010