TR01-077 Authors: Andrei Krokhin, Peter Jeavons, Peter Jonsson

Publication: 13th November 2001 08:45

Downloads: 3522

Keywords:

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 can be considered as examples of such CSPs.

One intersting question concerning such problems is to determine exactly

how the complexity of an interval-valued CSP depends on the set of

constraints allowed in instances. For the framework known as Allen's

interval algebra this question was completely answered earlier by the

authors by giving a complete description of the tractable cases and

showing that all remaining cases are NP-complete.