CSP Beyond Tractable Constraint Languages.
Jan DreierSebastian OrdyniakStefan SzeiderPublished in: CP (2022)
Keyphrases
- constraint satisfaction problems
- constraint networks
- constraint solving
- constraint language
- np complete
- constraint graph
- hypertree decomposition
- constraint problems
- disjunctive temporal
- expressive power
- np hard
- language independent
- global constraints
- computational complexity
- hard constraints
- constraint programming
- text summarization
- soft constraints
- computational problems
- max csp
- arc consistency
- constraint propagation
- constraint solvers
- binary constraints
- constraint satisfaction
- multi lingual
- linear constraints
- search space
- finite domain
- temporal reasoning
- tree decomposition
- language identification
- computationally tractable
- decomposition methods
- constraint solver
- search algorithm