{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T04:10:07Z","timestamp":1752379807040,"version":"3.41.2"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1023\/a:1025848402714","type":"journal-article","created":{"date-parts":[[2003,10,24]],"date-time":"2003-10-24T15:29:37Z","timestamp":1067009377000},"page":"335-338","source":"Crossref","is-referenced-by-count":0,"title":["Introduction to the Special Issue on Planning: Research Issues at the Intersection of Planning and Constraint Programming"],"prefix":"10.1007","volume":"8","author":[{"given":"Alexander","family":"Nareyek","sequence":"first","affiliation":[]},{"given":"Subbarao","family":"Kambhampati","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5141762_CR1","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0004-3702(96)00047-1","volume":"90","author":"A. L. Blum","year":"1997","unstructured":"Blum, A. L., & Furst, M. L. (1997). Fast planning through planning graph analysis. Artificial Intelligence, 90: 281\u2013300.","journal-title":"Artificial Intelligence"},{"key":"5141762_CR2","doi-asserted-by":"crossref","unstructured":"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\u2013251.","DOI":"10.1007\/10720246_19"},{"key":"5141762_CR3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R. Dechter","year":"1991","unstructured":"Dechter, R., Meiri, I., & Pearl, J. (1991). Temporal constraint networks. Artificial Intelligence, 49: 61\u201395.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"5141762_CR4","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0004-3702(01)00128-X","volume":"132","author":"M. Do","year":"2001","unstructured":"Do, M., & Kambhampati, S. (2001). Planning as constraint satisfaction: solving the planning graph by compiling it into CSP. Artificial Intelligence, 132(2): 151\u2013182.","journal-title":"Artificial Intelligence"},{"key":"5141762_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1613\/jair.655","volume":"12","author":"S. Kambhampati","year":"2000","unstructured":"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\u201334.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"5141762_CR6","unstructured":"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\u2013533."},{"key":"5141762_CR7","unstructured":"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\u2013325."},{"key":"5141762_CR8","unstructured":"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\u20131201."},{"key":"5141762_CR9","unstructured":"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\u20131649."},{"key":"5141762_CR10","unstructured":"Mittal, S., & Falkenhainer, B. (1990). Dynamic constraint satisfaction problems. In Proceedings of the Eighth National Conference on Artificial Intelligence (AAAI-90), pages 25\u201332."},{"key":"5141762_CR11","volume-title":"Constraint-Based Agents \u2014 An Architecture for Constraint-Based Modeling and Local-Search-Based Reasoning for Planning and Scheduling in Open and Dynamic Worlds","author":"A. Nareyek","year":"2001","unstructured":"Nareyek, A. (2001). Constraint-Based Agents \u2014 An Architecture for Constraint-Based Modeling and Local-Search-Based Reasoning for Planning and Scheduling in Open and Dynamic Worlds. Reading, Springer LNAI 2062."},{"key":"5141762_CR12","unstructured":"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\u2013625."},{"issue":"2","key":"5141762_CR13","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0004-3702(81)90007-2","volume":"16","author":"M. J. Stefik","year":"1981","unstructured":"Stefik, M. J. (1981). Planning with constraints (MOLGEN: Part 1). Artificial Intelligence, 16(2): 111\u2013140.","journal-title":"Artificial Intelligence"},{"issue":"1-2","key":"5141762_CR14","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0004-3702(01)00122-9","volume":"131","author":"B. Srivastava","year":"2001","unstructured":"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\u2013134.","journal-title":"Artificial Intelligence"},{"key":"5141762_CR15","unstructured":"Tate, A., Drabble, B., & Dalton, J. (1994). Reasoning with constraints within O-Plan2. In Proceedings of ARPI Workshop, Morgan Kaufmann Publishers."},{"key":"5141762_CR16","unstructured":"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\u2013590."},{"key":"5141762_CR17","unstructured":"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\u2013309."},{"key":"5141762_CR18","volume-title":"Practical Planning \u2014 Extending the classical AI Planning Paradigm","author":"D. E. Wilkins","year":"1988","unstructured":"Wilkins, D. E. (1988). Practical Planning \u2014 Extending the classical AI Planning Paradigm. Reading, Morgan Kaufmann Publishers."},{"key":"5141762_CR19","unstructured":"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\u2013316."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025848402714.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1025848402714\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025848402714.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:46:39Z","timestamp":1752378399000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1025848402714"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["5141762"],"URL":"https:\/\/doi.org\/10.1023\/a:1025848402714","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"type":"print","value":"1383-7133"},{"type":"electronic","value":"1572-9354"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}