From Lo cal to Global Consistency in Temp oral
?
Constraint Networks
Manolis Koubarakis
Dept of Computation
UMIST
P O Box
Manchester M QD
U K
manolis sna co umist ac uk
Abstract
We study the problem of global consistency for several classes of quantitative
temp oral constraints which include inequalities inequations and disjunctions of in
equations In all cases that we consider we identify the level of lo cal consistency
that is necessary and su cient for achieving global consistency and present an al
gorithm which achieves this level As a bypro duct of our analysis we also develop
an interesting minimal network algorithm