Skip to main content
SpringerLink
Log in

Introduction to the Special Issue on Planning: Research Issues at the Intersection of Planning and Constraint Programming

  • Introduction
  • Published:
Constraints Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Blum, A. L., & Furst, M. L. (1997). Fast planning through planning graph analysis. Artificial Intelligence, 90: 281–300.

    Google Scholar 

  2. Bockmayr, A., & Dimopoulos, Y. (1999). Integer programs and valid inequalities for planning problems. In Proceedings of the Fifth European Conference on Planning (ECP'99), pages 239–251.

  3. Dechter, R., Meiri, I., & Pearl, J. (1991). Temporal constraint networks. Artificial Intelligence, 49: 61–95.

    Google Scholar 

  4. Do, M., & Kambhampati, S. (2001). Planning as constraint satisfaction: solving the planning graph by compiling it into CSP. Artificial Intelligence, 132(2): 151–182.

    Google Scholar 

  5. Kambhampati, S. (2000). Planning graph as a (Dynamic) CSP: exploiting EBL, DDB and other CSP search techniques in graphplan. Journal of Artificial Intelligence Research, 12: 1–34.

    Google Scholar 

  6. Kautz, H. A., & Walser, J. P. (1999). State-space planning by integer optimization. In Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99), pages 526–533.

  7. Kautz, H. A., & Selman, B. (1999). Unifying SAT-based and graph-based planning. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI-99), pages 318–325.

  8. Kautz, H. A., & Selman, B. (1996). Pushing the envelope: planning, propositional logic and stochastic search. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI-96), pages 1194–1201.

  9. Laborie, P., & Ghallab, M. (1995). Planning with sharable resource constraints. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95), pages 1643–1649.

  10. Mittal, S., & Falkenhainer, B. (1990). Dynamic constraint satisfaction problems. In Proceedings of the Eighth National Conference on Artificial Intelligence (AAAI-90), pages 25–32.

  11. Nareyek, A. (2001). Constraint-Based Agents — An Architecture for Constraint-Based Modeling and Local-Search-Based Reasoning for Planning and Scheduling in Open and Dynamic Worlds. Reading, Springer LNAI 2062.

    Google Scholar 

  12. Rintanen, J. (1998). A planning algorithm not based on directional search. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), pages 617–625.

  13. Stefik, M. J. (1981). Planning with constraints (MOLGEN: Part 1). Artificial Intelligence, 16(2): 111–140.

    Google Scholar 

  14. Srivastava, B., Kambhampati, S., & Do, M. B. (2001). Planning the project management way: efficient planning by effective integration of causal and resource reasoning in RealPlan. Artificial Intelligence, 131(1-2): 73–134.

    Google Scholar 

  15. Tate, A., Drabble, B., & Dalton, J. (1994). Reasoning with constraints within O-Plan2. In Proceedings of ARPI Workshop, Morgan Kaufmann Publishers.

  16. Van Beek, P., & Chen, X. (1999). CPlan: a constraint programming approach to planning. In Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99), pages 585–590.

  17. Vossen, T., Ball, M., Lotem, A., & Nau, D. (1999). On the use of integer programming models in AI planning. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI-99), pages 304–309.

  18. Wilkins, D. E. (1988). Practical Planning — Extending the classical AI Planning Paradigm. Reading, Morgan Kaufmann Publishers.

    Google Scholar 

  19. Wolfman, S. A., & Weld, D. S. (1999). The LPSAT engine & and its application to resource planning. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI-99), pages 310–316.

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA, 15213-3891, USA

    Alexander Nareyek

  2. Department of Computer Science, College of Engineering and Applied Sciences, Arizona State University, Tempe, AZ, 85287-5406, USA

    Subbarao Kambhampati

Authors
  1. Alexander Nareyek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Subbarao Kambhampati
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nareyek, A., Kambhampati, S. Introduction to the Special Issue on Planning: Research Issues at the Intersection of Planning and Constraint Programming. Constraints 8, 335–338 (2003). https://doi.org/10.1023/A:1025848402714

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1025848402714

Search

Navigation