Promises Make Finite (Constraint Satisfaction) Problems Infinitary.
Libor BartoPublished in: LICS (2019)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- constraint programming
- np complete
- search space
- combinatorial problems
- computational problems
- arc consistency
- constraint networks
- np hard
- non binary
- soft constraints
- backtracking search
- decomposition methods
- forward checking
- disjunctive temporal
- constraint solving
- constraint solver
- sat problem
- global constraints
- solving constraint satisfaction problems
- real numbers
- dynamic constraint satisfaction problems
- reasoning problems
- satisfiability problem
- partial constraint satisfaction
- pseudo boolean optimization
- path consistency
- tractable subclasses
- finding optimal solutions
- arithmetic constraints
- constraint graph
- finite domain
- propositional satisfiability
- product configuration