A Theory of Satisfiability-Preserving Proofs in SAT Solving

Rebola-Pardo, Adrián; Suda, Martin

by Adrián Rebola-Pardo, Martin Suda

Reference:

A Theory of Satisfiability-Preserving Proofs in SAT SolvingAdrián Rebola-Pardo, Martin SudaLPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Awassa, Ethiopia, 16-21 November 2018 (Gilles Barthe, Geoff Sutcliffe, Margus Veanes, eds.), volume 57 of EPiC Series in Computing, pages 583–603, 2018, EasyChair.

Bibtex Entry:

@inproceedings{DBLP:conf/lpar/Rebola-PardoS18,
  author    = {Adri{\'{a}}n Rebola{-}Pardo and
               Martin Suda},
  editor    = {Gilles Barthe and
               Geoff Sutcliffe and
               Margus Veanes},
  title     = {A Theory of Satisfiability-Preserving Proofs in {SAT} Solving},
  booktitle = {{LPAR-22.} 22nd International Conference on Logic for Programming,
               Artificial Intelligence and Reasoning, Awassa, Ethiopia, 16-21 November
               2018},
  series    = {EPiC Series in Computing},
  volume    = {57},
  pages     = {583--603},
  publisher = {EasyChair},
  year      = {2018},
  url       = {https://easychair.org/publications/paper/zr7z},
  timestamp = {Wed, 27 May 2020 16:02:35 +0200},
  biburl    = {https://dblp.org/rec/conf/lpar/Rebola-PardoS18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}