Fast Theta-Subsumption with Constraint Satisfaction Algorithms.
Jérôme MalobertiMichèle SebagPublished in: Mach. Learn. (2004)
Keyphrases
- constraint satisfaction
- constraint satisfaction problems
- combinatorial problems
- constraint problems
- learning algorithm
- constrained problems
- worst case
- heuristic search
- constraint relaxation
- constraint networks
- np complete
- search strategies
- path consistency
- product configuration
- constraint optimization
- forward checking
- russian doll search
- constraint solving
- relaxation labeling
- phase transition
- description logics
- computational complexity