The complexity of maximal constraint languages
Many combinatorial search problems can be expressed as "constraint satisfaction problems" using an appropriate "constraint language", that is, a set of relations over some fixed finite set of values. It is well-known that there is a trade-off between the expressive power of a con...
Main Authors: | Bulatov, A, Krokhin, A, Jeavons, P |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2001
|
Similar Items
-
The complexity of maximal constraint languages
by: Bulatov, A, et al.
Published: (2001) -
The Complexity of Constraint Satisfaction: An Algebraic Approach
by: Krokhin, A, et al.
Published: (2004) -
Classifying the complexity of constraints using finite algebras
by: Bulatov, A, et al.
Published: (2005) -
Classifying the complexity of constraints using finite algebras
by: Bulatov, A, et al.
Published: (2005) -
Quantified constraints: Algorithms and complexity
by: Borner, F, et al.
Published: (2003)