A hybrid tractable class for non-binary CSPs.
Achref El MouelhiPhilippe JégouCyril TerriouxPublished in: Constraints An Int. J. (2015)
Keyphrases
- non binary
- constraint satisfaction problems
- binary csps
- tractable classes
- arc consistency
- constraint satisfaction
- np complete
- binary representation
- np hard
- constraint programming
- path consistency
- computational complexity
- frequent pattern mining
- search space
- constraint propagation
- forward checking
- state space
- data sets