Solving the Constraint Satisfaction Problem Using Genetic Algorithms.
Hassan NajadatHadeel AmmariIsmail HmeidiPublished in: IC-AI (2008)
Keyphrases
- constraint satisfaction problems
- partial constraint satisfaction
- constraint problems
- constraint satisfaction
- finite domain
- dynamic constraint satisfaction problems
- backtracking algorithm
- distributed constraint satisfaction problems
- constraint propagation
- disjunctive temporal
- finding optimal solutions
- constraint optimization
- constraint programming
- problems in artificial intelligence
- graph coloring
- constraint solving
- arc consistency
- search space
- np complete
- soft constraints
- configuration problems
- solving constraint satisfaction problems
- non binary
- combinatorial problems
- constraint networks
- product configuration
- randomly generated
- genetic algorithm
- solving planning problems
- graph coloring problems
- pseudo boolean optimization
- distributed constraint satisfaction
- np complete problems
- global constraints
- sat encodings
- graph based representations
- hard constraints
- decomposition methods
- sat problem
- temporal constraints