RAT Elimination

26 pages•Published: May 27, 2020

Adrian Rebola Pardo and Georg Weissenbacher

Abstract

Inprocessing techniques have become one of the most promising advancements in SAT solving over the last decade. Some inprocessing techniques modify a propositional formula in non model-perserving ways. These operations are very problematic when Craig inter- polants must be extracted: existing methods take resolution proofs as an input, but these inferences require stronger proof systems; state-of-the-art solvers generate DRAT proofs. We present the first method to transform DRAT proofs into resolution-like proofs by elim- inating satisfiability-preserving RAT inferences. This solves the problem of extracting interpolants from DRAT proofs.

Keyphrases: drat proofs, proof based interpolation, propositional logic, sat solving

In: Elvira Albert and Laura Kovacs (editors). LPAR23. LPAR-23: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol 73, pages 423-448.

Links:	https://easychair.org/publications/paper/cMtF
	https://doi.org/10.29007/fccb

BibTeX entry

@inproceedings{LPAR23:RAT_Elimination,
  author    = {Adrian Rebola Pardo and Georg Weissenbacher},
  title     = {RAT Elimination},
  booktitle = {LPAR23. LPAR-23: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning},
  editor    = {Elvira Albert and Laura Kovacs},
  series    = {EPiC Series in Computing},
  volume    = {73},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/cMtF},
  doi       = {10.29007/fccb},
  pages     = {423-448},
  year      = {2020}}

Download PDF Open PDF in browser