Certifying Incremental SAT Solving

Katalin Fazekas; Florian Pollitt; Mathias Fleury; Armin Biere

doi:10.29007/pdcc

Download PDF Open PDF in browser

Certifying Incremental SAT Solving

20 pages•Published: May 26, 2024

Katalin Fazekas, Florian Pollitt, Mathias Fleury and Armin Biere

Abstract

Certifying results by checking proofs and models is an essential feature of modern SAT solving. While incremental solving with assumptions and core extraction is crucial for many applications, support for incremental proof certificates remains lacking. We propose a proof format and corresponding checkers for incremental SAT solving. We further extend it to leverage resolution hints. Experiments on incremental SAT solving for Bounded Model Checking and Satisfiability Modulo Theories demonstrate the feasibility of our approach, further confirming that resolution hints substantially reduce checking time.

Keyphrases: certification, Incremental SAT, proof checking, proofs

In: Nikolaj Bjorner, Marijn Heule and Andrei Voronkov (editors). Proceedings of 25th Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol 100, pages 321--340

Links:	https://easychair.org/publications/paper/TbPs
	https://doi.org/10.29007/pdcc

BibTeX entry

@inproceedings{LPAR2024:Certifying_Incremental_SAT_Solving,
  author    = {Katalin Fazekas and Florian Pollitt and Mathias Fleury and Armin Biere},
  title     = {Certifying Incremental SAT Solving},
  booktitle = {Proceedings of 25th Conference on Logic for Programming, Artificial Intelligence and Reasoning},
  editor    = {Nikolaj Bj\{\textbackslash{}o\}rner and Marijn Heule and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {100},
  pages     = {321--340},
  year      = {2024},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {https://easychair.org/publications/paper/TbPs},
  doi       = {10.29007/pdcc}}

Download PDF Open PDF in browser