A new effcient algorithm for solving the simple temporal problem

Proceedings of the International Workshop on Temporal Representation and Reasoning

Volumn 2003-January, Issue , 2003, Pages 210-220

  Xu, Lin ^a   Choueiry, Berthe Y ^a  

^a UNIVERSITY OF NEBRASKA LINCOLN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; CONSTRAINT SATISFACTION PROBLEMS; CONSTRAINT THEORY; SEMANTICS; TEMPORAL LOGIC; TOPOLOGY;

ALGORITHM FOR SOLVING; ARTICULATION POINTS; CONSTRAINT PROPAGATION; EMPIRICAL EVALUATIONS; FLOYD-WARSHALL ALGORITHMS; SEMANTIC PROPERTIES; SIMPLE TEMPORAL PROBLEMS; TOPOLOGICAL PROPERTIES;

ALGORITHMS;

EID: 84944046159     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TIME.2003.1214898     Document Type: Conference Paper

References (14)

1. th IJCAI, pages 456-461, Stockholm, Sweden, 1999.
2. Mark Boddy. Personal communication, 2002.
3. Amedeo Cesta, Angelo Oddi, and Stephen Smith. A constraint-based method for project scheduling with time windows. Journal of Heuristics, 8(1):109-136, April 2002.
4. Boris V. Cherkasskyn, Andrew V. Goldberg, and Tomasz Radzik. Shortest Paths Algorithms: Theory and Experimental Evaluation. Mathematical Programming, 73:129-174, 1996.
5. Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. McGraw-Hill Book Co & MIT Press, 2001.
6. Thomas Dean and Drew McDermott. Temporal Data Base Management. Artificial Intelligence, 32:1-55, 1987.
7. Rina Dechter. Constraint Processing. Manuscript, forthcoming, 2003.
8. Rina Dechter, Itay Meiri, and Judea Pearl. Temporal Constraint Networks. Artificial Intelligence, 49:61-95, 1991.
9. Eugene C. Freuder. A Sufficient Condition for Backtrack-Bounded Search. JACM, 32 (4):755-761, 1985.
10. Alan K. Mackworth. Consistency in Networks of Relations. Artificial Intelligence, 8:99-118, 1977.
11. Ugo Montanari. Networks of Constraints: Fundamental Properties and Application to Picture Processing. Information Sciences, 7:95-132, 1974.
12. Nicolas Muscettola, Paul Morris, and Ioannis Tsamardinos. Reformulating Temporal Plans for Efficient Execution. In Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), pages 444-452, Trento Italy, 1998.
13. U. Kjærulff. Triagulation of Graphs - Algorithms Giving Small Total State Space. Research Report R-90-09, Aalborg University, Denmark, 1990.
14. Ioannis Tsamardinos. Reformulating Temporal Plans for Efficient Excution. Master's thesis, Intelligent Systems Program, University of Pittsburgh, 1998.