SAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One Constraints.
Miquel BofillJordi CollPeter NightingaleJosep SuyFelix Ulrich-OlteanMateu VillaretPublished in: CoRR (2021)
Keyphrases
- sat encodings
- pseudo boolean constraints
- linear arithmetic constraints
- sat solvers
- combinatorial problems
- pseudo boolean
- integer linear programming
- graph coloring
- constraint satisfaction problems
- constraint programming
- solving problems
- optimal solution
- special case
- logic programming
- np complete
- constraint satisfaction