| Abstract |
|
We consider qualitative temporal or spatial constraint networks
whose constraints evolve over time in an ultimately periodic
fashion: after an initial stretch of time, a fixed pattern
of constraints (over an interval) is reproduced indefinitely.
We propose a local propagation algorithm which is polynomial,
and we show that it decides the consistency problem in
some particular cases. We also show that the general problem
of consistency for such networks is in PSPACE.
|
 Additional Information
|
Citation:
Jean-François Condotta, Gérard Ligozat, Stavros Tripakis,
"Ultimately Periodic Qualitative Constraint Networks for Spatial and Temporal Reasoning,"
ictai,
pp. 584-588,
17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05),
2005
|
