Small Promise CSPs that reduce to large CSPs.
Alexandr KazdaPeter MayrDmitriy ZhukPublished in: Log. Methods Comput. Sci. (2022)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- arc consistency
- constraint propagation
- non binary
- hypertree decomposition
- constraint networks
- solving constraint satisfaction problems
- symmetry breaking
- tree decomposition
- np complete
- significantly reduced
- constraint problems
- distributed constraint satisfaction
- computational complexity
- backtracking algorithm
- search space