Lingeling Essentials, A Tutorial on Design and Implementation Aspects of the the SAT Solver Lingeling

1 pages•Published: July 28, 2014

Abstract

One of the design principles of the state-of-the-art SAT solver Lingeling is to use as compact data structures as possible. These reduce memory usage, increase cache efficiency and thus improve run-time, particularly, when using multiple solver instances on multi-core machines, as in our parallel portfolio solver Plingeling and our cube and conquer solver Treengeling. The scheduler of a dozen inprocessing algorithms is an important aspect of Lingeling as well. In this talk we explain these design and implementation aspects of Lingeling and discuss new direction of solver design.

In: Daniel Le Berre (editor). POS-14. Fifth Pragmatics of SAT workshop, vol 27, pages 88.

Links:	https://easychair.org/publications/paper/xJs
	https://doi.org/10.29007/jhd7

BibTeX entry

@inproceedings{POS-14:Lingeling_Essentials_Tutorial_Design,
  author    = {Armin Biere},
  title     = {Lingeling Essentials, A Tutorial on Design and Implementation Aspects of the the SAT Solver Lingeling},
  booktitle = {POS-14. Fifth Pragmatics of SAT workshop},
  editor    = {Daniel Le Berre},
  series    = {EPiC Series in Computing},
  volume    = {27},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/xJs},
  doi       = {10.29007/jhd7},
  pages     = {88},
  year      = {2014}}

Download PDF Open PDF in browser