Proceedings

Depth-Driven Circuit-Level Stochastic Local Search for SAT

Download BibTeX Cite

Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 504-508.

https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-092

Abstract

We develop a novel circuit-level stochastic local search (SLS) method D-CRSat for Boolean satisfiability by integrating a structure-based heuristic into the recent CRSat algorithm. D-CRSat significantly improves on CRSat on real-world application benchmarks on which other current CNF and circuit-level SLS methods tend to perform weakly. We also give an intricate proof of probabilistically approximate completeness for D-CRSat, highlighting key features of the method.

Anton Belov, Matti Järvisalo, and Zbigniew Stachniak. 2011. Depth-Driven Circuit-Level Stochastic Local Search for SAT. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11. IJCAI, 504–508. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-092
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards