Seeking practical CDCL insights from theoretical SAT benchmarks
Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › fagfællebedømt
Over the last decades Boolean satisfiability (SAT) solvers based on conflict-driven clause learning (CDCL) have developed to the point where they can handle formulas with millions of variables. Yet a deeper understanding of how these solvers can be so successful has remained elusive. In this work we shed light on CDCL performance by using theoretical benchmarks, which have the attractive features of being a) scalable, b) extremal with respect to different proof search parameters, and c) theoretically easy in the sense of having short proofs in the resolution proof system underlying CDCL. This allows for a systematic study of solver heuristics and how efficiently they search for proofs. We report results from extensive experiments on a wide range of benchmarks. Our findings include several examples where theory predicts and explains CDCL behaviour, but also raise a number of intriguing questions for further study.
Originalsprog | Engelsk |
---|---|
Titel | Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018 |
Redaktører | Jerome Lang |
Antal sider | 9 |
Forlag | International Joint Conferences on Artificial Intelligence |
Publikationsdato | 2018 |
Sider | 1300-1308 |
ISBN (Elektronisk) | 9780999241127 |
DOI | |
Status | Udgivet - 2018 |
Eksternt udgivet | Ja |
Begivenhed | 27th International Joint Conference on Artificial Intelligence, IJCAI 2018 - Stockholm, Sverige Varighed: 13 jul. 2018 → 19 jul. 2018 |
Konference
Konference | 27th International Joint Conference on Artificial Intelligence, IJCAI 2018 |
---|---|
Land | Sverige |
By | Stockholm |
Periode | 13/07/2018 → 19/07/2018 |
Sponsor | International Joint Conferences on Artifical Intelligence (IJCAI) |
Navn | IJCAI International Joint Conference on Artificial Intelligence |
---|---|
Vol/bind | 2018-July |
ISSN | 1045-0823 |
ID: 251867360