Rewriting Numeric Constraint Satisfaction Problems for Consistency Algorithms.
Claudio LottazPublished in: CP (1999)
Keyphrases
- constraint satisfaction problems
- constraint problems
- constraint satisfaction
- decomposition methods
- computational problems
- path consistency
- pseudo boolean optimization
- tractable subclasses
- non binary
- combinatorial problems
- constraint programming
- constraint propagation
- global constraints
- constraint networks
- np complete
- forward checking
- constraint graph
- soft constraints
- orders of magnitude
- search space
- constraint optimization
- binary constraints
- problems in artificial intelligence
- weighted constraint satisfaction
- combinatorial optimization
- backtracking algorithm
- constraint solvers
- backtracking search
- finding optimal solutions
- linear constraints
- association rules