Freuder, E. C. (1978). Synthesizing constraint expressions. *Comm. of the ACM, 21 (11),* 958-965.

Freuder, E. C. (1982). A sufficient condition for backtrack-free search. *Journal of the ACM, 29 (1),*
24-32.

Garcia, F., & Laborie, P. (1996). *Hierarchisation of the Seach Space in Temporal Planning.* New Directions in AI Planning, 217-232, IOS Press.

Garrido, A., Marzal, E., Sebastiá, L., & Barber F. (1999). A model for planning and scheduling integration. In Proceedings of the 8 th. Conference of Spanish Association of A.I.

(CAEPIA'99).

Gerevini, A., & Schubert, L. (1995). Efficient algorithms for qualitative reasoning about time.

Artificial Intelligence, 74, 207-248.

Jeavons, P., Cohen, D., & Cooper M. (1998). Constraints, consistency and closure. Artificial Intelligence, 101, 251-268.

Jeavons, P., Cohen, D., Gyssens, M. (1999). How to determine the expressive power of constraints.

Constraints: An Int. Journal, 4, 113-131.

Jonsson, P., & Bäckström, C. (1996). A linear-programming approach to temporal reasoning. In Proceedings of the 13 th. National Conference on Artificial Intelligence (AAAI'96).AAAI
Press.

Jonsson, P., & Bäckström, C. (1998). A unifying approach to temporal constraint reasoning. Artificial Intelligence, 102, 143-155.

Jonsson, P., Drakengren, T., & Bäckström, C. (1999). Computational complexity of relating time points and intervals. *Artificial Intelligence, 109,* 273-295.

Kautz, H., & Ladkin, P. (1991). Integrating metric and qualitative temporal reasoning. *In Proceedings* of the 9th. National Conference on Artificial Intelligence (AAAI'91).AAAI Press.

Mackworth, A. K. (1977). Consistency in networks of relations, *Artificial Intelligence, 8,* 121-118,.

Meiri, I. (1996). Combining qualitative and quantitative constraints in temporal reasoning. *Artificial* Intelligence, 87, 343-385.

Montanari, U. (1974). Networks of constraints: fundamental properties and applications to picture processing. *Information Science, 7,* 95-132.

Navarrete, I., & Marin, R. (1997). Qualitative temporal reasoning with points and durations. In Proceedings of the 15 *th. International Joint Conference on Artificial Intelligence (IJCAI-97).*
Nebel, B., & Burckert, H.J. (1995). Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra. *Journal of the ACM, 42 (1),* 43-66.

Pujari, A., & Sattar, A. (1999). A new framework for reasoning about Points,. Intervals and Durations. *In Proceedings on the Int. Joint Conference on Artificial Intelligence (IJCAI'99).*
Schwalb, E., & Dechter, R. (1997). Processing disjunctions in temporal constraints networks.

Artificial Intelligence, 93, 29-61.