Conflict Directed Variable Selection Strategies for Constraint Satisfaction Problems.
Thanasis BalafoutisKostas StergiouPublished in: SETN (2010)
Keyphrases
- selection strategies
- constraint satisfaction problems
- forward checking
- conflict directed
- variable ordering
- ordering heuristics
- constraint satisfaction
- selection strategy
- constraint programming
- arc consistency
- search strategies
- branch and bound algorithm
- constraint propagation
- np complete
- non binary
- combinatorial problems
- search space
- max sat
- partial assignment
- np hard
- tree search
- propositional satisfiability
- constraint networks
- random instances
- genetic algorithm
- reinforcement learning
- graph coloring
- search tree
- temporal reasoning