On the speed of constraint propagation and the time complexity of arc consistency testing
Christoph BerkholzOleg VerbitskyPublished in: CoRR (2013)
Keyphrases
- constraint propagation
- arc consistency
- space complexity
- constraint reasoning
- worst case time complexity
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- soft constraints
- non binary
- constraint solving
- constraint networks
- global constraints
- temporal constraints
- backtracking algorithms
- constraint graph
- path consistency
- systematic search
- max csp
- computational complexity
- binary constraints
- tree search
- constraint solver
- worst case
- constraint problems
- forward checking
- search algorithm
- finite domain
- combinatorial problems
- linear programming
- objective function
- constraint logic programming
- np complete
- special case
- xml documents
- maintaining arc consistency