Some New Tractable Classes of CSPs and Their Relations with Backtracking Algorithms.
Achref El MouelhiPhilippe JégouCyril TerriouxBruno ZanuttiniPublished in: CPAIOR (2013)
Keyphrases
- backtracking algorithms
- tractable classes
- path consistency
- constraint satisfaction problems
- constraint propagation
- constraint networks
- constraint satisfaction
- temporal reasoning
- arc consistency
- non binary
- forward checking
- backtracking algorithm
- backtracking search
- constraint programming
- interval algebra
- search space
- constraint graph
- temporal constraints
- np complete
- decomposition methods
- qualitative and quantitative
- temporal information
- reasoning problems
- probabilistic model
- np hard