Login / Signup

The Order Encoding: From Tractable CSP to Tractable SAT.

Justyna PetkePeter Jeavons
Published in: SAT (2011)
Keyphrases
  • np complete
  • constraint satisfaction problems
  • np hard
  • sat encodings
  • constraint satisfaction
  • propositional logic
  • sat problem
  • encoding scheme
  • tractable classes
  • hypertree decomposition