Title :
Ultimately Periodic Simple Temporal Problems (UPSTPs)
Author :
Condotta, Jean-François ; Ligozat, Gérard ; Saade, Mahmoud ; Tripakis, Stavros
Author_Institution :
CRIL-CNRS, Univ. d´´Artois, Lens
Abstract :
In this paper, we consider quantitative temporal or spatial constraint networks whose constraints evolve over time in an ultimately periodic fashion. These constraint networks are an extension of STPs (simple temporal problems). We study some properties of these new types of constraint networks. We also propose a constraint propagation algorithm. We show that this algorithm decides the consistency problem in some particular cases
Keywords :
constraint handling; consistency problem; constraint propagation algorithm; quantitative temporal network; spatial constraint network; ultimately periodic simple temporal problem; Artificial intelligence; Computer science; Lenses; Polynomials; Time factors; Upper bound;
Conference_Titel :
Temporal Representation and Reasoning, 2006. TIME 2006. Thirteenth International Symposium on
Conference_Location :
Budapest
Print_ISBN :
0-7695-2617-9
DOI :
10.1109/TIME.2006.33
