Turing machines with atoms, constraint satisfaction problems, and descriptive complexity.
Bartek KlinSlawomir LasotaJoanna OchremiakSzymon TorunczykPublished in: CSL-LICS (2014)
Keyphrases
- constraint satisfaction problems
- turing machine
- constraint satisfaction
- constraint propagation
- constraint programming
- np complete
- search space
- arc consistency
- non binary
- computational problems
- constraint solving
- combinatorial problems
- constraint optimization
- space complexity
- constraint problems
- decomposition methods
- constraint graph
- computational complexity
- soft constraints
- constraint networks
- pseudo boolean optimization
- graph based representations
- partial constraint satisfaction
- finding optimal solutions
- solving constraint satisfaction problems
- backtracking search
- constraint solver
- finite domain
- reasoning problems
- sat problem
- logic programs
- configuration problems
- forward checking
- state space
- metaheuristic