Van-Hau Nguyen

Learn More
Solving Constraint Satisfaction Problems (CSPs) through Boolean Satisfiability (SAT) requires suitable encodings for translating CSPs to equivalent SAT instances that can not only be efficiently generated, but also efficiently solved by SAT solvers. In this paper we investigate hierarchical and hybrid encodings, as proposed by Velev, namely a previously(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