Evaluating consistency algorithms for temporal metric constraints

Authors:
Yang Shi;Anagh Lal;Berthe Y. Choueiry
Affiliations:
Constraint Systems Laboratory, Computer Science & Engineering, University of Nebraska-Lincoln;Constraint Systems Laboratory, Computer Science & Engineering, University of Nebraska-Lincoln;Constraint Systems Laboratory, Computer Science & Engineering, University of Nebraska-Lincoln
Venue:
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Year:
2004

Citing 7
Cited 1

A sufficient condition for backtrack-bounded search

Journal of the ACM (JACM)
Temporal constraint networks

Artificial Intelligence - Special issue on knowledge representation
Backtracking algorithms for disjunctions of temporal constraints

Artificial Intelligence
Introduction to Algorithms

Introduction to Algorithms
Gaining efficiency and flexibility in the simple temporal problem

TIME '96 Proceedings of the 3rd Workshop on Temporal Representation and Reasoning (TIME'96)
Constraint Processing

Constraint Processing
An efficient consistency algorithm for the temporal constraint satisfaction problem

AI Communications - Special issue on: Spatial and temporal reasoning

Review:

The Knowledge Engineering Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the performance of some known algorithms for solving the Simple Temporal Problem (STP) and the Temporal Constraint Satisfaction Problem (TCSP). In particular, we empirically compare the Bellman-Ford (BF) algorithm and its incremental version (incBF) by (Cesta & Oddi 1996) to the ΔSTP of (Xu & Choueiry 2003a). Among the tested algorithms, we show that ΔSTP is the most efficient for determining the consistency of an STP, and that incBF combined with the heuristics of (Xu & Choueiry 2003b) is the most efficient for solving the TCSP. We plan to improve ΔSTP by exploiting incrementality as in incBF and other new incremental algorithms.