Ultimately Periodic Qualitative Constraint Networks for Spatial and Temporal Reasoning

Hong Kong, China November 14-November 16

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/ICTAI.2005.124

17th IEEE International Conference on ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Jean-François Condotta Articles by Gérard Ligozat Articles by Stavros Tripakis

	ASCII Text	x
	Jean-François Condotta, Gérard Ligozat, Stavros Tripakis, "Ultimately Periodic Qualitative Constraint Networks for Spatial and Temporal Reasoning," Tools with Artificial Intelligence, IEEE International Conference on, pp. 584-588, 17th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'05), 2005.

	BibTex	x
	@article{ 10.1109/ICTAI.2005.124, author = {Jean-François Condotta and Gérard Ligozat and Stavros Tripakis}, title = {Ultimately Periodic Qualitative Constraint Networks for Spatial and Temporal Reasoning}, journal ={Tools with Artificial Intelligence, IEEE International Conference on}, volume = {0}, year = {2005}, issn = {1082-3409}, pages = {584-588}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICTAI.2005.124}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Tools with Artificial Intelligence, IEEE International Conference on TI - Ultimately Periodic Qualitative Constraint Networks for Spatial and Temporal Reasoning SN - 1082-3409 SP584 EP588 A1 - Jean-François Condotta, A1 - Gérard Ligozat, A1 - Stavros Tripakis, PY - 2005 KW - null VL - 0 JA - Tools with Artificial Intelligence, IEEE International Conference on ER -

Jean-François Condotta, Université déArtois

Gérard Ligozat, Université de Paris-Sud

Stavros Tripakis, VERIMAG

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.

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

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.