Covered Clause Elimination

6 pages•Published: March 25, 2013

Marijn Heule, Matti Järvisalo and Armin Biere

Abstract

Generalizing the novel clause elimination procedures developed in [1], we introduce explicit (CCE), hidden (HCCE), and asymmetric (ACCE) variants of a procedure that eliminates covered clauses from CNF formulas. We show that these procedures are more effective in reducing CNF formulas than the respective variants of blocked clause elimination, and may hence be interesting as new preprocessing/simplification techniques for SAT solving.

Keyphrases: clause elimination, sat preprocessing, satisfiability checking, simplification

In: Andrei Voronkov, Geoff Sutcliffe, Matthias Baaz and Christian Fermüller (editors). LPAR-17-short. short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning., vol 13, pages 41-46.

Links:	https://easychair.org/publications/paper/hR8
	https://doi.org/10.29007/cl8s

BibTeX entry

@inproceedings{LPAR-17-short:Covered_Clause_Elimination,
  author    = {Marijn Heule and Matti Järvisalo and Armin Biere},
  title     = {Covered Clause Elimination},
  booktitle = {LPAR-17-short. short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning.},
  editor    = {Andrei Voronkov and Geoff Sutcliffe and Matthias Baaz and Christian Fermüller},
  series    = {EPiC Series in Computing},
  volume    = {13},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/hR8},
  doi       = {10.29007/cl8s},
  pages     = {41-46},
  year      = {2013}}

Download PDF Open PDF in browser