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.

Keyphrases: automated reasoning, cdcl, propositional reasoning, sat solving, satisfiability

In: Pascal Fontaine, Renate A. Schmidt and Stephan Schulz (editors). PAAR-2012. Third Workshop on Practical Aspects of Automated Reasoning, vol 21, pages 1.

Links:	https://easychair.org/publications/paper/R26c
	https://doi.org/10.29007/hnks

BibTeX entry

@inproceedings{PAAR-2012:Practical_Aspects_SAT_Solving,
  author    = {Armin Biere},
  title     = {Practical Aspects of SAT Solving},
  booktitle = {PAAR-2012. Third Workshop on Practical Aspects of Automated Reasoning},
  editor    = {Pascal Fontaine and Renate A. Schmidt and Stephan Schulz},
  series    = {EPiC Series in Computing},
  volume    = {21},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/R26c},
  doi       = {10.29007/hnks},
  pages     = {1},
  year      = {2013}}

Download PDF Open PDF in browser