loading...
Ultimately Periodic Simple Temporal Problems (UPSTPs)
Budapest, Hungary June 15-June 17
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TIME.2006.33Thirteenth International Symposium on ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Jean-Francois Condotta, Gerard Ligozat, Mahmoud Saade, Stavros Tripakis, "Ultimately Periodic Simple Temporal Problems (UPSTPs)," Temporal Representation and Reasoning, International Syposium on, pp. 69-77, Thirteenth International Symposium on Temporal Representation and Reasoning (TIME'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/TIME.2006.33,
author = {Jean-Francois Condotta and Gerard Ligozat and Mahmoud Saade and Stavros Tripakis},
title = {Ultimately Periodic Simple Temporal Problems (UPSTPs)},
journal ={Temporal Representation and Reasoning, International Syposium on},
volume = {0},
year = {2006},
issn = {1530-1311},
pages = {69-77},
doi = {http://doi.ieeecomputersociety.org/10.1109/TIME.2006.33},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Temporal Representation and Reasoning, International Syposium on
TI - Ultimately Periodic Simple Temporal Problems (UPSTPs)
SN - 1530-1311
SP69
EP77
A1 - Jean-Francois Condotta,
A1 - Gerard Ligozat,
A1 - Mahmoud Saade,
A1 - Stavros Tripakis,
PY - 2006
KW - null
VL - 0
JA - Temporal Representation and Reasoning, International Syposium on
ER -
 
Jean-Francois Condotta, CRIL-CNRS, Universite d?Artois, Rue de l?Universite, 62307 Lens, France
Gerard Ligozat, LIMSI-CNRS, Universite de Paris-Sud, 91403 Orsay, France
Mahmoud Saade, CRIL-CNRS, Universite d?Artois, Rue de l?Universite, 62307 Lens, France
Stavros Tripakis, VERIMAG, Centre Equation, 2, avenue de Vignate, 38610 Gieres, France
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.
Citation:
Jean-Francois Condotta, Gerard Ligozat, Mahmoud Saade, Stavros Tripakis, "Ultimately Periodic Simple Temporal Problems (UPSTPs)," time, pp.69-77, Thirteenth International Symposium on Temporal Representation and Reasoning (TIME'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.