Beyond DRAT: Challenges in Certifying UNSAT

5 pages•Published: November 8, 2017

Abstract

Contemporary SAT solvers are complex tools and may contain bugs. In
order to increase the trust in the results of SAT solving, SAT solvers
may produce certificates that can be checked independently. For
unsatisfiability certificates, DRAT is the de facto standard. As long
as the checkers are not formalized, extending the certificate format
would decrease the trust in the checker because its code complexity
increases. With the advent of formally verified checkers for DRAT
proofs, this is no longer the case. In this note I argue that
symmetry breaking is not adequately supported by DRAT proofs, and
propose to have dedicated certification for symmetry breaking instead.

Keyphrases: certification, drat, formalization, sat, symmetry breaking

In: Giles Reger and Dmitriy Traytel (editors). ARCADE 2017. 1st International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements, vol 51, pages 46-50.

Links:	https://easychair.org/publications/paper/TFMG
	https://doi.org/10.29007/2b78

BibTeX entry

@inproceedings{ARCADE2017:Beyond_DRAT_Challenges_Certifying,
  author    = {Bertram Felgenhauer},
  title     = {Beyond DRAT: Challenges in Certifying UNSAT},
  booktitle = {ARCADE 2017. 1st International Workshop on Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements},
  editor    = {Giles Reger and Dmitriy Traytel},
  series    = {EPiC Series in Computing},
  volume    = {51},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/TFMG},
  doi       = {10.29007/2b78},
  pages     = {46-50},
  year      = {2017}}

Download PDF Open PDF in browser