Computer Science – Logic in Computer Science
Scientific paper
2010-11-23
Short paper proceedings of LPAR-17, 17th International Conference on Logic for Programming, Artificial Intelligence and Reason
Computer Science
Logic in Computer Science
5 pages
Scientific paper
Generalizing the novel clause elimination procedures developed in [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.], 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.
Biere Armin
Heule Marijn
Järvisalo Matti
No associations
LandOfFree
Covered Clause Elimination does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Covered Clause Elimination, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Covered Clause Elimination will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-589456