A filtering process for general constraint-satisfaction problems: achieving pairwise-consistency using an associated binary representation.
P. JanssenPhilippe JégouB. NouguierMarie-Catherine VilaremPublished in: TAI (1989)
Keyphrases
- constraint satisfaction problems
- binary representation
- non binary
- filtering process
- tractable subclasses
- pairwise
- constraint satisfaction
- constraint propagation
- constraint networks
- constraint programming
- path consistency
- search space
- np complete
- constraint problems
- special case
- pseudo boolean optimization
- soft constraints
- global constraints
- tractable classes
- disjunctive constraints
- maintaining arc consistency
- np hard
- filtering method
- graph coloring problems
- error measure
- evolutionary algorithm
- partial constraint satisfaction
- object recognition
- similarity measure