Sciweavers

TACAS
2010
Springer
191views Algorithms» more  TACAS 2010»
14 years 18 hour ago
Blocked Clause Elimination
Boolean satisfiability (SAT) and its extensions are becoming a core technology for the analysis of systems. The SAT-based approach divides into three steps: encoding, preprocessin...
Matti Järvisalo, Armin Biere, Marijn Heule