Using Resolution Proofs to Analyse CDCL Solvers-Reference-Cited by-同舟云学术

Using Resolution Proofs to Analyse CDCL Solvers

Published:2020 Issue: Volume: Page:427-444
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Kokkala Janne I.,Nordström Jakob

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-58475-7_25

Reference41 articles.

1. Alwen, J., de Rezende, S.F., Nordström, J., Vinyals, M.: Cumulative space in black-white pebbling and resolution. In: Proceedings of the 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Leibniz International Proceedings in Informatics (LIPIcs), vol. 67, pp. 38:1–38:21, January 2017

2. Audemard, G., Simon, L.: Predicting learnt clauses quality in modern SAT solvers. In: Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI 2009), pp. 399–404, July 2009

3. Lecture Notes in Computer Science;G Audemard,2012

4. Lecture Notes in Computer Science;G Audemard,2014

5. Bayardo Jr., R.J., Schrag, R.: Using CSP look-back techniques to solve real-world SAT instances. In: Proceedings of the 14th National Conference on Artificial Intelligence (AAAI 1997), pp. 203–208, July 1997

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

1. QCDCL with cube learning or pure literal elimination – What is best?;Artificial Intelligence;2024-11

2. Too much information: Why CDCL solvers need to forget learned clauses;PLOS ONE;2022-08-26

3. Chapter 7. Proof Complexity and SAT Solving;Frontiers in Artificial Intelligence and Applications;2021-02-02