Converting Programs into Constraint Satisfaction Problems.
Franz WotawaMihai NicaPublished in: IDC (2007)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- constraint propagation
- search space
- arc consistency
- np complete
- np hard
- constraint solving
- global constraints
- non binary
- constraint networks
- combinatorial problems
- soft constraints
- backtracking search
- partial constraint satisfaction
- solving constraint satisfaction problems
- constraint optimization
- tractable subclasses
- product configuration
- pseudo boolean optimization
- arithmetic constraints
- tractable classes
- constraint graph
- forward checking
- reasoning problems
- sat problem
- temporal constraints
- special case
- random instances
- backtracking algorithm
- decomposition methods
- path consistency
- fixpoint
- logic programs
- maintaining arc consistency
- lower bound