Ultimately Periodic Simple Temporal Problems (UPSTPs)

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.

• Type: Conference
• Year: 2006
• Where: TIME
• Authors: Jean-François Condotta, Gérard Ligozat, Mahmoud Saade, Stavros Tripakis
• Keywords: Constraint Networks, Constraint Propagation Algorithm, Logical Reasoning, Spatial Constraint Networks, TIME 2006