Broken triangles: From value merging to a tractable class of general-arity constraint satisfaction problems.
Martin C. CooperAymeric DucheinAchref El MouelhiGuillaume EscamocherCyril TerriouxBruno ZanuttiniPublished in: Artif. Intell. (2016)
Keyphrases
- tractable classes
- constraint satisfaction problems
- non binary
- constraint satisfaction
- reasoning problems
- np complete
- constraint propagation
- constraint programming
- global constraints
- computational problems
- np hard
- constraint solving
- search space
- combinatorial problems
- bounded treewidth
- tractable subclasses
- pseudo boolean optimization
- path consistency
- decomposition methods
- arc consistency
- description logics
- sat problem
- constraint networks
- constraint solvers
- special case
- symmetry breaking
- finite domain
- random instances
- forward checking
- constraint graph