Practical Aspects of SAT Solving

1 pages•Published: August 19, 2013

Abstract

SAT solving techniques are used in many automated reasoning engines. This talk gives an overview on recent developments in practical aspects of SAT solver development. Beside improvements of the basic conflict driven clause learning (CDCL) algorithm, we also discuss improving and integrating advanced preprocessing techniques as inprocessing during search. The talk concludes with a brief overview on current trends in parallelizing SAT.

In: Pascal Fontaine and Amit Goel (editors). SMT 2012. 10th International Workshop on Satisfiability Modulo Theories, vol 20, pages 1.

Links:	https://easychair.org/publications/paper/G
	https://doi.org/10.29007/kbw9

BibTeX entry

@inproceedings{SMT2012:Practical_Aspects_SAT_Solving,
  author    = {Armin Biere},
  title     = {Practical Aspects of SAT Solving},
  booktitle = {SMT 2012. 10th International Workshop on Satisfiability Modulo Theories},
  editor    = {Pascal Fontaine and Amit Goel},
  series    = {EPiC Series in Computing},
  volume    = {20},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/G},
  doi       = {10.29007/kbw9},
  pages     = {1},
  year      = {2013}}

Download PDF Open PDF in browser