{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:30:18Z","timestamp":1725467418603},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540639121"},{"type":"electronic","value":"9783540696650"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63912-8_91","type":"book-chapter","created":{"date-parts":[[2006,7,17]],"date-time":"2006-07-17T10:37:40Z","timestamp":1153132660000},"page":"260-272","source":"Crossref","is-referenced-by-count":18,"title":["Understanding and extending Graphplan"],"prefix":"10.1007","author":[{"given":"Subbarao","family":"Kambhampati","sequence":"first","affiliation":[]},{"given":"Eric","family":"Parker","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Lambrecht","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,29]]},"reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0004-3702(94)90012-4","volume":"67","author":"A. Barrett","year":"1994","unstructured":"Barrett, A. and Weld, D. 1994. Partial Order Planing: Evaluating possible efficiency gains. Artificial Intelligence, 67(1):71\u2013112.","journal-title":"Artificial Intelligence"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Blum, A. and Furst, M. 1995. Fast planning through planning graph analysis. In Proc. IJCAI-95 (Extended version appears in Artificial Intelligence, 90(1\u20132))","DOI":"10.21236\/ADA303260"},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Bayardo, R. and Schrag, R. 1997. Using CSP look-back techniques to improve real-word SAT instances. In Proc. AAAI-97.","DOI":"10.1007\/3-540-61551-2_65"},{"key":"21_CR4","unstructured":"Frost, D and Dechter, R. 1994. In search of best constraint satisfaction search. In Proc. AAAI-94."},{"key":"21_CR5","unstructured":"Drummond, M. 1989. Situated control rules. In Proceedings of the First International Conference on Knowledge Representation and Reasoning, 103\u2013113. Morgan Kau fmann."},{"issue":"12","key":"21_CR6","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0004-3702(94)00076-D","volume":"76","author":"S. Kambhampati","year":"1995","unstructured":"Kambhampati, S., Knoblock, C., and Yang, Q. 1995. Planning as refinement search: A unified framework for evaluating design tradeoffs in partial order planning. Artificial Intelligence, 76(12):167\u2013238.","journal-title":"Artificial Intelligence"},{"key":"21_CR7","unstructured":"Kambhampati, S. and Yang, X. 1996, On the role of disjunctive representations and constraint propagation in refinement planning. In Proceedings of the fifth International Conference on Principles of Knowledge Representation and Reasoning. 35\u2013147."},{"key":"21_CR8","unstructured":"Kambhampati, S. 1997a. Challenges in bridging plan synthesis paradigms. In Proc. UCAI-97."},{"key":"21_CR9","unstructured":"Kambhampati, S. 1997b. On the relations between intelligent backtracking and explanation-based learning in planning and constraint satisfaction. rakaposhi.eas.asu.edu\/pub\/rao\/jour-ddb.ps."},{"key":"21_CR10","unstructured":"Kambhampati. S. 1997c. Refinement planning as a unifying framework for plan synthesis. AI Magazine. 8(2)."},{"key":"21_CR11","unstructured":"Kautz, H. and Selman, B. 1996. Pushing the envelope: Planning Propositional Logic and Stochastic Search. In Proceedings of National Conference on Artificial Intelligence. 1194\u201311201"},{"key":"21_CR12","unstructured":"McDermott, D. 1996. A Heuristic estimator for means-ends analysis in planning. In: Proceedings of 3 rd International Conference on AI Planning Systems. AAAI Press. 142\u2013149."},{"key":"21_CR13","unstructured":"Mittal, S. and Falkenhainer, B. 1990. Dynamic Constraint Satisfaction Problems. In Proc. AAAI-90."},{"key":"21_CR14","unstructured":"Parker, E and Kambhampati, S. 1997. Making Graphplan goal-directed. Forthcoming."},{"key":"21_CR15","unstructured":"Reisig, W. 1982. Petrie Nets: An Introduction. Springer-Verlag."},{"key":"21_CR16","unstructured":"Smith, D and Peot, M. 1996. Suspending recursion in partial order planning. In Proc. 3 rd Intl. Conference on AI Planning Systems."},{"key":"21_CR17","unstructured":"Srivastava, B and Kambhampati, S. 1997. Teasing apart planning and scheduling in Graphplan. Forthcoming."},{"key":"21_CR18","unstructured":"Tsang, E. Constraint Satisfaction. Academic Press. 1993."}],"container-title":["Lecture Notes in Computer Science","Recent Advances in AI Planning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63912-8_91","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T22:06:27Z","timestamp":1555711587000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63912-8_91"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540639121","9783540696650"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-63912-8_91","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}