There Are No CNF Problems

  • Peter J. Stuckey
Conference paper

DOI: 10.1007/978-3-642-39071-5_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7962)
Cite this paper as:
Stuckey P.J. (2013) There Are No CNF Problems. In: Järvisalo M., Van Gelder A. (eds) Theory and Applications of Satisfiability Testing – SAT 2013. SAT 2013. Lecture Notes in Computer Science, vol 7962. Springer, Berlin, Heidelberg


SAT technology has improved rapidly in recent years, to the point now where it can solve CNF problems of immense size. But solving CNF problems ignores one important fact: there are NO problems that are originally CNF. All the CNF that SAT solvers tackle is the result of modelling some real world problem, and mapping the high-level constraints and decisions modelling the problem into clauses on binary variables. But by throwing away the high level view of the problem SAT solving may have lost a lot of important insight into how the problem is best solved. In this talk I will hope to persuade you that by keeping the original high level model of the problem one can realise immense benefits in solving hard real world problems.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Peter J. Stuckey
    • 1
  1. 1.National ICT Australia, Victoria Laboratory, Department of Computing and Information SystemsUniversity of MelbourneAustralia

Personalised recommendations