Nogood-FC for solving partitionable constraint satisfaction problems.
Montserrat AbrilMiguel A. SalidoFederico BarberPublished in: J. Intell. Manuf. (2010)
Keyphrases
- constraint satisfaction problems
- global constraints
- constraint satisfaction
- constraint problems
- partial constraint satisfaction
- finite domain
- dynamic constraint satisfaction problems
- constraint optimization
- constraint programming
- backtracking algorithm
- solving constraint satisfaction problems
- constraint propagation
- disjunctive temporal
- np complete
- search space
- graph coloring
- problems in artificial intelligence
- non binary
- finding optimal solutions
- configuration problems
- arc consistency
- soft constraints
- combinatorial problems
- graph coloring problems
- np hard
- set bounds propagation
- constraint networks
- constraint solving
- decomposition methods
- computational problems
- constraint solvers
- forward checking
- partial solutions
- backtracking search
- simulated annealing
- branch and bound
- product configuration
- constraint solver
- sat problem
- solving problems
- constraint graph
- search tree
- solving planning problems
- sat encodings
- np complete problems