Arc and path consistence revisited
Artificial Intelligence
Constraint satisfaction algorithms
Computational Intelligence
Artificial Intelligence - Special issue on knowledge representation
Effective solution of qualitative interval constraint problems
Artificial Intelligence
Reasoning about qualitative temporal information
Artificial Intelligence - Special volume on constraint-based reasoning
An interval logic for space based on “connection”
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Arc-consistency and arc-consistency again
Artificial Intelligence
Maintaining knowledge about temporal intervals
Communications of the ACM
A Symbolic Approach to Interval Constraint Problems
AISMC-1 Proceedings of the International Conference on Artificial Intelligence and Symbolic Mathematical Computation
TAI '95 Proceedings of the Seventh International Conference on Tools with Artificial Intelligence
Managing efficiently temporal relations through indexed spanning trees
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 2
Efficient temporal reasoning through timegraphs
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Using inference to reduce arc consistency computation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Sparse constraint graphs and exceptionally hard problems
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Combining topological and size information for spatial reasoning
Artificial Intelligence
Combining Topological and Qualitative Size Constraints for Spatial Reasoning
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Exploiting the structure of hierarchical plans in temporal constraint propagation
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
Incremental tractable reasoning about qualitative temporal constraints
IJCAI'03 Proceedings of the 18th international joint conference on Artificial 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
Hi-index | 0.00 |
Reasoning about qualitative temporal information is essential in many artificial intelligence problems. In particular, many tasks can be solved using the interval-based temporal algebra introduced by Allen (All83). In this framework, one of the main tasks is to compute the transitive closure of a network of relations between intervals (also called path consistency in a CSP-like terminology). Almost all previous path consistency algorithms proposed in the temporal reasoning literature were based on the constraint reasoning algorithms PC-1 and PC-2 (Mac77). In this paper, we first show that the most efficient of these algorithms is the one which stays the closest to PC-2. Afterwards, we propose a new algorithm, using the idea "one support is sufficient" (as AC-3 (Mac77) does for arc consistency in constraint networks). Actually, to apply this idea, we simply changed the way composition-intersection of relations was achieved during the path consistency process in previous algorithms.