Evaluating consistency algorithms for temporal metric constraints

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 970-971

  Shi, Yang ^a   Lal, Anagh ^a   Choueiry, Berthe Y ^a  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION THEORY (CSP); SIMPLE TEMPORAL PROBLEM (STP); TEMPORAL CONSTRAINT SATISFACTION PROBLEM (TCSP);

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; GRAPH THEORY; VECTORS;

PROBLEM SOLVING;

EID: 9444295877     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. Cesta, A., and Oddi, A. 1996. Gaining Efficiency and Flexibility in the Simple Temporal Problem. In TIME 96.
2. Choueiry, B., and Xu, L. 2004. An Efficient Consistency Algorithm for the Temporal Constraint Satisfaction Problem. In Submitted to AI Communications.
3. Cormen, T.; Leiserson, C.; and Rivest, R. L. 2001. Introduction to Algorithms. McGraw-Hill & MIT Press.
4. Dechter, R.; Meiri, I.; and Pearl, J. 1991. Temporal Constraint Networks. AIJ 49:61-95.
5. Dechter, R. 2003. Constraint Processing. Morgan Kaufmann.
6. Freuder, E. 1985. A Sufficient Condition for Backtrack-Bounded Search. JACM 32 (4):755-761.
7. Stergiou, K., and Koubarakis, M. 2000. Backtracking Algorithms for Disjunctions of Temporal Constraints. AIJ 12- (1):81-117.
8. Xu, L., and Choueiry, B. 2003a. A New Efficient Algorithm for Solving the Simple Temporal Problem. In TIME-ICTL 03, 212-222. IEEE Press.
9. Xu, L., and Choueiry, B. 2003b. Improving Backtrack Search for Solving the TCSP. In CP 03, 754-768. LNCS 2833.