When the Decomposition Meets the Constraint Satisfaction Problem.
Youcef DjenouriDjamel DjenouriZineb HabbasJerry Chun-Wei LinTomasz P. MichalakAlberto CanoPublished in: IEEE Access (2020)
Keyphrases
- constraint satisfaction problems
- decomposition methods
- constraint satisfaction
- tree decomposition
- constraint programming
- search space
- np complete
- constraint propagation
- decomposition method
- np hard
- hypertree decomposition
- constraint networks
- arc consistency
- non binary
- constraint solving
- partial constraint satisfaction
- global constraints
- soft constraints
- problems in artificial intelligence
- constraint graph
- finite domain
- distributed constraint satisfaction
- tractable classes
- reasoning problems
- constraint solver
- phase transition
- tree decompositions
- graph based representations
- temporal constraints
- tractable subclasses
- pseudo boolean optimization