Control-Based Clause Sharing in Parallel SAT Solving
Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence. Pages 499-503.
Abstract
Conflict driven clause learning, one of the most important component of modern SAT solvers, is also recognized as very important in parallel SAT solving. Indeed, it allows clause sharing between multiple processing units working on related (sub-)problems. However, without limitation, sharing clauses might lead to an exponential blow up in communication or to the sharing of irrelevant clauses. This paper, proposes two innovative policies to dynamically adjust the size of shared clauses between any pair of processing units. The first approach controls the overall number of exchanged clauses whereas the second additionally exploits the relevance quality of shared clauses. Experimental results show important improvements of the state-of the-art parallel SAT solver.Youssef Hamadi, Said Jabbour, Lakhdar Sais
@inproceedings{ijcai2009p90,
title = {Control-Based Clause Sharing in Parallel SAT Solving},
author = {Hamadi, Youssef and Jabbour, Said and Sais, Lakhdar},
booktitle = {Proceedings of the Twenty-First International Joint Conference on
Artificial Intelligence, {IJCAI-09}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Hiroaki Kitano},
pages = {499--503},
year = {2009},
url = {https://ijcai.org/proceedings/2009/90},
}
TY - CPAPER TI - Control-Based Clause Sharing in Parallel SAT Solving AU - Hamadi, Youssef AU - Jabbour, Said AU - Sais, Lakhdar T2 - Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, IJCAI-09 PB - International Joint Conferences on Artificial Intelligence PY - 2009 SP - 499 EP - 503 UR - https://ijcai.org/proceedings/2009/90 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
