Van-Hau Nguyen

Learn More
Propositional satisfiability solving (SAT) has been considerably successful in numerous industrial applications. Whereas the speed and the capacity of SAT solvers significantly improved in the last two decades, the understanding of SAT encodings is still limited and often challenging. Two well-known variable encodings, namely the order encoding and the(More)
  • 1