Handling structured and ambiguous constraints in constraint satisfaction problems.
Wady NaanaaSimone PimontPublished in: J. Exp. Theor. Artif. Intell. (1998)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- constraint solving
- non binary
- global constraints
- combinatorial problems
- solving constraint satisfaction problems
- finite domain
- constraint solver
- constraint networks
- constraint propagation
- soft constraints
- arc consistency algorithm
- constraint problems
- disjunctive temporal
- constraint graph
- search space
- hard constraints
- constraint optimization
- arc consistency
- decomposition methods
- dynamic constraint satisfaction problems
- binary constraints
- np complete
- forward checking
- disjunctive constraints
- constraint solvers
- configuration problems
- weighted constraint satisfaction
- phase transition
- maintaining arc consistency
- np hard
- partial assignment
- computational problems
- path consistency
- linear constraints
- binary csps
- arithmetic constraints
- partial constraint satisfaction
- satisfiability problem
- objective function
- variable ordering heuristics
- reasoning problems
- sat problem
- tractable classes
- symmetry breaking