SAT Encodings for Pseudo-Boolean Constraints Together With At-Most-One Constraints (Extended Abstract).
Miquel BofillJordi CollPeter NightingaleJosep SuyFelix Ulrich-OlteanMateu VillaretPublished in: IJCAI (2023)
Keyphrases
- extended abstract
- sat encodings
- pseudo boolean constraints
- combinatorial problems
- sat solvers
- constraint satisfaction problems
- graph coloring
- linear arithmetic constraints
- constraint programming
- planning problems
- np complete
- solving problems
- metaheuristic
- temporal planning
- pseudo boolean
- logic programming
- evolutionary algorithm