Constraint satisfaction tractability from semi-lattice operations on infinite sets.
Manuel BodirskyH. Dugald MacphersonJohan ThapperPublished in: ACM Trans. Comput. Log. (2013)
Keyphrases
- constraint satisfaction
- constraint satisfaction problems
- heuristic search
- constraint programming
- phase transition
- russian doll search
- constraint problems
- constraint propagation
- relaxation labeling
- combinatorial problems
- probabilistic reasoning
- product configuration
- constraint relaxation
- robust fault detection
- real numbers
- constraint solving
- learning algorithm
- np hard
- sat solvers
- neural network
- constraint networks
- expert systems
- search algorithm
- optimal solution