A polynomial-time algorithm for simple temporal problems with piecewise constant domain preference functions

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2004, Pages 67-72

  Kumar, T K Satish ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXTENDED SIMPLE TEMPORAL PROBLEMS (ESTP); RESOURCE CONSUMPTION; TEMPORAL CONSTRAINTS; TEMPORAL PROBLEMS;

ALGORITHMS; CONSTRAINT THEORY; MATHEMATICAL MODELS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

ARTIFICIAL INTELLIGENCE;

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

References (10)

1. Armando A., Castellini C. and Giunchiglia E. SAT-based Procedures for Temporal Reasoning. ECP 2000.
2. Cormen T. H., Leiserson C. E. and Rivest R. Introduction to Algorithms. Cambridge, MA, 1990.
3. Dechter R., Meiri I. and Pearl J. Temporal Constraint Networks. Artificial Intelligence Journal 49. 1991.
4. Khatib L., Morris P. H., Morris R. A. and Rossi F. Temporal Constraint Reasoning With Preferences. IJCAI 2001.
5. Kumar T. K. S. Incremental Computation of Resource-Envelopes in Producer-Consumer Models. CP 2003.
6. Nguyen X. and Kambhampati S. Reviving Partial Order Planning. IJCAI-2001.
7. Oddi A. and Cesta A. Incremental Forward Checking for the Disjunctive Temporal Problem. ECAI 2000.
8. Smith D., Frank J. and Jonsson A. Bridging the Gap Between Planning and Scheduling. Knowledge Engineering Review 15:1, 2000.
9. Stergiou K. and Koubarakis M. Backtracking Algorithms for Disjunctions of Temporal Constraints. In the 15th National Conference on Artificial Intelligence. 1998.
10. Tsamardinos I. and Pollack M. E. Efficient Solution Techniques for Disjunctive Temporal Reasoning Problems. Artificial Intelligence, 2003.