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 little or no discussion of the conversion to clause form that will be necessary. In this paper we present a fast and easy to implement conversion to equisatisfiable clause form for… (More)

6 Figures and Tables


  • Presentations referencing similar topics