Eligible and frozen constraints for solving temporal qualitative constraint networks

Authors:
Jean-François Condotta;Gérard Ligozat;Mahmoud Saade
Affiliations:
CRIL, CNRS, Université d'Artois, Lens Cedex, France;LIMSI, CNRS, Université de Paris-Sud, Orsay, France;CRIL, CNRS, Université d'Artois, Lens Cedex, France
Venue:
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Year:
2007

Citing 5
Cited 5

Effective solution of qualitative interval constraint problems

Artificial Intelligence
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra

Journal of the ACM (JACM)
The design and experimental analysis of algorithms for temporal reasoning

Journal of Artificial Intelligence Research
An interval-based representation of temporal knowledge

IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1
A new proof of tractability for 0RD-horn relations

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1

A divide-and-conquer approach for solving interval algebra networks

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Qualitative CSP, finite CSP, and SAT: comparing methods for qualitative constraint-based reasoning

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Semantic adaptation of multimedia documents

Multimedia Tools and Applications
Nogoods in qualitative constraint-based reasoning

KI'12 Proceedings of the 35th Annual German conference on Advances in Artificial Intelligence
Decomposition and tractability in qualitative spatial and temporal reasoning

Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider the consistency problem for qualitative constraint networks representing temporal or spatial information. The most efficient method for solving this problem consists in a search algorithm using, on the one hand, the weak composition closure method as a local propagation method, and on the other hand, a decomposition of the constraints into subrelations of a tractable set. We extend this algorithm with the notion of eligibility and the notion of frozen constraints. The first concept allows to characterise constraints which will not be considered during the search. The second one allows to freeze constraints in order to avoid unnecessary updates.