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...

ver descrição completa

Detalhes bibliográficos
Principais autores: Krokhin, A, Jeavons, P, Jonsson, P
Formato: Journal article
Idioma:English
Publicado em: 2004