2 search results - page 1 / 1 » Aligning CNF- and Equivalence-Reasoning |
SAT
2004
Springer
13 years 10 months ago
2004
Springer
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...
SAT
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. Preprocessing has proven important in enabling efficient Boolean satisfiability (SAT) solving. For many real application scenarios of SAT it is important to be able to ...