From path-consistency to global consistency in temporal qualitative constraint networks

Authors:
Nouhad Amaneddine;Jean-François Condotta
Affiliations:
Department of Information Technology and Computing, Faculty of Computer Studies, The Arab Open University, Lebanon;Université Lille-Nord de France, Artois CRIL-CNRS, UMR 8188, Lens, France
Venue:
AIMSA'12 Proceedings of the 15th international conference on Artificial Intelligence: methodology, systems, and applications
Year:
2012

Citing 10
Cited 1

Constraint propagation algorithms for temporal reasoning: a revised report

Readings in qualitative reasoning about physical systems
Exact and approximate reasoning about temporal relations

Computational Intelligence
Temporally distributed symptoms in technical diagnosis

Temporally distributed symptoms in technical diagnosis
Reasoning about qualitative temporal information

Artificial Intelligence - Special volume on constraint-based reasoning
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra

Journal of the ACM (JACM)
From local to global consistency in temporal constraint networks

Theoretical Computer Science - Special issue: principles and practice of constraint programming
Synthesizing constraint expressions

Communications of the ACM
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra

Journal of the ACM (JACM)
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

Efficient approach to solve the minimal labeling problem of temporal and spatial qualitative constraints

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study in this paper the problem of global consistency for qualitative constraints networks (QCNs) of the Point Algebra (PA) and the Interval Algebra (IA). In particular, we consider the subclass $\mathcal{S}_{\sf PA}$ corresponding to the set of relations of PA except the relations {,=}, and the subclass $\mathcal{S}_{\sf IA}$ corresponding to pointizable relations of IA one can express by means of relations of $\mathcal{S}_{\sf PA}$. We prove that path-consistency implies global consistency for QCNs defined on these subclasses. Moreover, we show that with the subclasses corresponding to convex relations, there are unique greatest subclasses of PA and IA containing singleton relations satisfying this property.