Armando, A., Castellini, C., & Giunchiglia, E. (1999). SAT-based procedures for temporal reasoning. In 5th European Conference on Planning (ECP-99).
Barber, F. (2000). Reasoning on interval and point-based disjunctive metric constraints in temporal contexts. Journal of Artificial Intelligence Research, 12: 35–86.
Bessiere, C. (1999). Non-binary constraints. In Principles and Practice of Constraint Programming (CP'99). Springer, Alexandria, Virginia, USA.
Chleq, N. (1995). Efficient algorithms for networks of quantitative temporal constraints. In Proceedings of the Workshop CONSTRAINTS'95, pages 40–45.
Dechter, R., Meiri, I., & Pearl, J. (1991). Temporal constraint networks. Artificial Intelligence, 49: 61–95.
Georgakopoulos, D., Hornick, M., & Sheth, A. (1995). An overview of workflow management: from process modeling to workflow autonomation infastructure. Distributed and Parallel Databases, 3: 119–153.
Goldman, R. P., & Boddy, M. S. (1996). Expressive planning and explicit knowledge. In Proceedings of the 3rd International Conference on Artificial Intelligence Planning Systems, pages 110–117.
Laborie, P., & Ghallab, M. (1995). Planning with sharable constraints. In Proceedings of the 14th International Joint Conference on A.I. (IJCAI-95), pages 1643–1649.
Mackworth, A., & Freuder, E. (1985). The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence, 25(1): 65–74.
Morris, P., Muscettola, N., & Vidal, T. (2001). Dynamic control of plans with temporal uncertainty. In Proceedings of the 17th International Joint Conference on A.I. (IJCAI-01), pages 494–499.
Muscettola, N., Nayak, P. P., Pell, B., & Williams, B. C. (1998). Remote agent: to boldly go where no AI system has gone before. Artificial Intellience, 103: 5–47.
Myers, K. L. (1997). Procedural reasoning system: user's guide. Technical report, SRI International.
Oddi, A., & Cesta, A. (2000). Incremental forward checking for the disjunctive temporal problem. In European Conference on Artificial Intelligence (ECAI-2002).
Onder, N., & Pollack, M. E. (1999). Conditional, probabilistic planning: a unifying algorithm and effective search control mechanisms. In Proceedings of the 16th National Conference on Artificial Intelligence, pages 577–584.
Peot, M., & Smith, D. E. (1992). Conditional nonlinear planning. In Proceedings of the First International Conference on AI Planning Systems (AIPS-92), pages 189–197. College Park, MD.
Pollack, M. E., McCarthy, C., Ramakrishnan, S., Tsamardinos, I., Brown, L., Carrion, S., Colbry, D., Orosz, C., & Peintner, B. (2002). Autominder: a planning, monitoring, and reminding assistive agent. In 7th International Conference on Intelligent Autonomous Systems, pages 265–272.
Pryor, L., & Collins, G. (1996). Planning for contingencies: a decision-based approach. Journal of Artificial Intelligence Research, 4: 287–339.
Schwalb, E., & Dechter, R. (1997). Processing disjunctions in temporal constraint networks. Artificial Intelligence, 93: 29–61.
Schwalb, E., Kask, K., & Dechter, R. (1994). Temporal reasoning with constraints on fluents and events. In Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-94), Vol. 2, pages 1067–1072. AAAI Press/MIT Press, Seattle, Washington, USA.
Smith, D., Frank, J., & Jónsson, A. (2000). Bridging the gap between planning and scheduling. Knowledge Engineering Review, 15: 61–94.
Stergiou, K., & Koubarakis, M. (2000). Backtracking algorithms for disjunctions of temporal constraints. Artificial Intelligence, 120: 81–117.
Tsamardinos, I., (2001). Constrained-Based Temporal Reasoning Algorithms with Applications to Planning. Ph.D. thesis, University of Pittsburgh, PA.
Tsamardinos, I., Morris, P., & Muscettola, N. (1998). Fast transformation of temporal plans for efficient execution. In Proceedings of the 15th National Conference on Artificial Intelligence, pages 254–261.
Tsamardinos, I., Pollack, M. E., & Ganchev, P. (2001). Flexible dispatch of disjunctive plans. In 6th European Conference in Planning, pages 417–422.
Tsamardinos, I., Pollack, M. E., & Horty, J. F. (2000). Merging plans with quantitative temporal constraints, temporally extended actions, and conditional branches. In Proceedings of the 5th International Conference on Artificial Intelligence Planning and Scheduling, pages 264–272.
Vidal, T., & Fargier, H. (1999). Handling contingency in temporal constraint networks: from consistency to controllabilities. Journal of Experimental & Theoretical Artificial Intelligence, 11: 23–45.