@inproceedings{HeuleJB:LPAR2010short,
 author = {Marijn Heule and Matti J\"arvisalo and Armin Biere},
 title  = {Covered Clause Elimination},
 editor = {Andrei Voronkov and Geoff Sutcliffe and Matthias Baaz and Christian Ferm\"uller},
 booktitle = {Short Paper Proceedings of the 17th International Conference on 
              Logic for Programming, Artificial Intelligence and Reasoning 
              (LPAR-17 / 2010)},
 volume = {13},
 series = {EasyChair Proceedings in Computing},
 volume = {13},
 year   = {2013},
 pages = {41--46},
}

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.

[1] M. Heule, M. J\"arvisalo, and A. Biere. 
Clause elimination procedures for CNF formulas.
In Proc. LPAR-17, volume 6397 of LNCS, pages 357-371. Springer, 2010.