A Flexible Proof Format for SAT Solver-Elaborator Communication-Reference-Cited by-同舟云学术

A Flexible Proof Format for SAT Solver-Elaborator Communication

Published:2021 Issue: Volume: Page:59-75
ISSN:0302-9743
Container-title:Tools and Algorithms for the Construction and Analysis of Systems
language:
Short-container-title:

Author:

Baek Seulkee,Carneiro Mario,Heule Marijn J. H.

Abstract

AbstractWe introduce , a new proof format for unsatisfiable SAT problems, and its associated toolchain. Compared to , the format allows solvers to include more information in proofs to reduce the computational cost of subsequent elaboration to . The format is easy to parse forward and backward, and it is extensible to future proof methods. The provision of optional proof steps allows SAT solver developers to balance implementation effort against elaboration time, with little to no overhead on solver time. We benchmark our toolchain against a comparable toolchain and confirm >84% median reduction in elaboration time and >94% median decrease in peak memory usage.

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-72016-2_4

Reference26 articles.

1. Barbosa, H., Blanchette, J.C., Fleury, M., Fontaine, P.: Scalable fine-grained proofs for formula processing. Journal of Automated Reasoning pp. 1–26 (2019)

2. Biere, A., Cimatti, A., Clarke, E.M., Fujita, M., Zhu, Y.: Symbolic model checking using SAT procedures instead of BDDs. In: Proceedings 1999 Design Automation Conference (Cat. No. 99CH36361). pp. 317–320. IEEE (1999)

3. Cruz-Filipe, L., Heule, M.J.H., Hunt, W.A., Kaufmann, M., Schneider-Kamp, P.: Efficient certified RAT verification. In: International Conference on Automated Deduction. pp. 220–236. Springer (2017)

4. Fleury, M.: Optimizing a verified SAT solver. In: Badger, J.M., Rozier, K.Y. (eds.) NFM. LNCS, vol. 11460, pp. 148–165. Springer (2019)

5. Fleury, M., Blanchette, J.C., Lammich, P.: A verified SAT solver with watched literals using imperative HOL. In: Andronick, J., Felty, A.P. (eds.) CPP. pp. 158–171. ACM (2018)

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

1. CaDiCaL 2.0;Lecture Notes in Computer Science;2024

2. Fast and Verified UNSAT Certificate Checking;Lecture Notes in Computer Science;2024

3. CHC Model Validation with Proof Guarantees;iFM 2023;2023-11-06

4. Generating and Exploiting Automated Reasoning Proof Certificates;Communications of the ACM;2023-09-22

5. A Flexible Proof Format for SAT Solver-Elaborator Communication;Logical Methods in Computer Science;2022-04-18