Constraint satisfaction problems on intervals and lengths
We study interval-valued constraint satisfaction problems (CSPs), in which the aim is to find an assignment of intervals to a given set of variables subject to constraints on the relative positions of intervals. Many well-known problems such as INTERVAL GRAPH RECOGNITION and INTERVAL SATISFIABILITY...
Main Authors: | Krokhin, A, Jeavons, P, Jonsson, P |
---|---|
Format: | Journal article |
Language: | English |
Published: |
2004
|
Similar Items
-
Constraint satisfaction problems on intervals and lengths
by: Krokhin, A, et al.
Published: (2004) -
Constraint satisfaction problems and finite algebras
by: Bulatov, A, et al.
Published: (2000) -
Constraint satisfaction problems and finite algebras
by: Bulatov, A, et al.
Published: (2000) -
Binarisation for Valued Constraint Satisfaction Problems
by: Cohen, D, et al.
Published: (2016) -
Binarisation for valued constraint satisfaction problems
by: Cohen, D, et al.
Published: (2017)