Sciweavers

AAAI
2008
13 years 9 months ago
Efficiently Exploiting Dependencies in Local Search for SAT
We propose a new local search platform that splits a CNF formula into three sub-components: i) a minimal dependency lattice (representing the core connections between logic gates)...
Duc Nghia Pham, John Thornton, Abdul Sattar
SAT
2004
Springer
158views Hardware» more  SAT 2004»
14 years 9 days ago
Aligning CNF- and Equivalence-Reasoning
Structural logical formulas sometimes yield a substantial fraction of so called equivalence clauses after translating to CNF. The best known example of this feature is probably pro...
Marijn Heule, Hans van Maaren