Schu¨rr, A. (1990). Introduction to PROGRES, an attribute graph grammar based specification language. In Nagl, M. (Ed.), Graph-Theoretic Concepts in Computer Science, Vol. 411 of Lecture Notes in Computer Science, pp. 151-165.

Schürr, A. (1997).  Programmed graph replacement systems.  In Rozenberg, G. (Ed.),
Handbook on Graph Grammars: Foundations, Vol. 1, pp. 479-546. World Scientific, Singapore.

Sellis, T. K. (1988). Multiple-query optimization. ACM Transactions on Database Systems, 13 (1), 23–52.

Selman, B., Levesque, H., & Mitchell, D. (1992). A new method for solving hard satisfiability problems. In Proceedings of the Tenth National Conference on Artificial Intelligence
(AAAI-92), pp. 440–446 San Jose, California. AAAI Press.

Silberschatz, A., Korth, H. F., & Sudarshan, S. (1997). Database System Concepts (Third edition). McGraw-Hill.

Simon, H. (1969). The sciences of the artificial. MIT Press.

Slaney, J., & Thiébaux, S. (1996). Linear time near-optimal planning in the blocks world. In Proceedings of the Thirteenth National Conference on Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conference, pp. 1208-1214.

Menlo Park. AAAI Press / MIT Press Sussman, G. J. (1975). A Computer Model of Skill Acquisition. American Elsevier, New York.

Veloso, M. (1994). Planning and Learning by Analogical Reasoning. Springer Verlag. Veloso, M. M., Perez, M. A., & Carbonell, J. G. (1990). Nonlinear planning with parallel resource allocation. In Proceedings of the Workshop on Innovative Approaches to Planning, Scheduling and Control, pp. 207–212 San Diego, CA.

Weld, D. S. (1994). An introduction to least commitment planning. AI Magazine, 15 (4). Weld, D. S. (1999). Recent advances in AI planning. AI Magazine, 20 (2).

Yu, C., & Chang, C. (1984). Distributed query processing. ACM Computing Surveys, 16 (4),
39-433.

Zweben, M., Daun, B., & Deale, M. (1994).  Scheduling and rescheduling with iterative repair. In Intelligent Scheduling, pp. 241–255. Morgan Kaufman, San Mateo, CA.