Random constraint satisfaction: Easy generation of hard (satisfiable) instances.
Ke XuFrédéric BoussemartFred HemeryChristophe LecoutrePublished in: Artif. Intell. (2007)
Keyphrases
- constraint satisfaction
- random instances
- phase transition
- constraint satisfaction problems
- random sat
- randomly generated
- satisfiability problem
- sat instances
- sat solvers
- hard problems
- constraint propagation
- np complete
- combinatorial problems
- constraint problems
- heuristic search
- relaxation labeling
- np complete problems
- constraint relaxation
- sat problem
- product configuration
- robust fault detection
- soft constraints
- constraint solving
- russian doll search
- backtrack search
- forward checking
- constraint programming
- constraint optimization
- arc consistency
- search strategies
- np hard
- search space