Sciweavers

SAT
2004
Springer
106views Hardware» more  SAT 2004»
13 years 10 months ago
The Optimality of a Fast CNF Conversion and its Use with SAT
Despite the widespread use and study of Boolean satisfiability for a diverse range of problem domains, encoding of problems is usually given to general propositional logic with li...
Daniel Sheridan