{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,3]],"date-time":"2026-07-03T19:19:00Z","timestamp":1783106340684,"version":"3.54.6"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540678397","type":"print"},{"value":"9783540449140","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44914-0_17","type":"book-chapter","created":{"date-parts":[[2007,5,22]],"date-time":"2007-05-22T21:26:14Z","timestamp":1179869174000},"page":"271-280","source":"Crossref","is-referenced-by-count":5,"title":["On Reformulating Planning as Dynamic Constraint Satisfaction"],"prefix":"10.1007","author":[{"given":"Jeremy","family":"Frank","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ari K.","family":"J\u00f3nsson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"Morris","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2000,8,11]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0004-3702(96)00047-1","volume":"90","author":"A. Blum","year":"1997","unstructured":"A. Blum and M. Furst. \u201dfast planning through planning graph analysis\u201d. Artificial Intelligence, 90:281\u2013300, 1997.","journal-title":"Artificial Intelligence"},{"key":"17_CR2","unstructured":"R. Bayardo and D. Miranker. A complexity analysis of space bounded learning algorithms for the constraint satisfaction problem. Proceedings of the 13th National Conference on Artificial Intelligence, pages 298\u2013304, 1996."},{"key":"17_CR3","unstructured":"M. B. Do and S. Khambhampati. Solving planning-graph by compiling it into csp. In Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling, 2000."},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","volume":"49","author":"R. Dechter","year":"1991","unstructured":"R. Dechter, I. Meiri, and J. Pearl. Temporal constraint networks. Artificial Intelligence, 49:61\u201394, 1991.","journal-title":"Artificial Intelligence"},{"key":"17_CR5","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.1","volume":"1","author":"M. Ginsberg","year":"1993","unstructured":"M. Ginsberg. Dynamic backtracking. Journal of Artificial Intelligence Research, 1:25\u201346, 1993.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"F. Glover. Tabu search: Part i. ORSA Journal on Computing, 1989.","DOI":"10.1287\/ijoc.1.3.190"},{"key":"17_CR7","unstructured":"A. J\u00f3nsson and J. Frank. A framework for dynamic constraint reasoning using procedural constraints. Euopean Conference on Artificial Intelligence (to appear), 2000."},{"key":"17_CR8","unstructured":"Ari K. J\u00f3nsson, Paul H. Morris, Nicola Muscettola, Kanna Rajan, and Ben Smith. Planning in interplanetary space: Theory and practice. In Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling, 2000."},{"key":"17_CR9","unstructured":"A. J\u00f3nsson. Procedural Reasoning in Constraint Satisfaction PhD thesis, Stanford University Computer Science Department, 1997."},{"key":"17_CR10","unstructured":"D. Joslin. Passive and Active Decision Postponement in Plan Generation. PhD thesis, Carnegie Mellon University Computer Science Department, 1996."},{"key":"17_CR11","unstructured":"D. Weld M. Ernst, T. Millstein. 1169\u20131176. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997."},{"key":"17_CR12","unstructured":"N. Muscettola. Hsts: Integrated planning and scheduling. In M. Zweben and M. Fox, editors, Intelligent Scheduling, pages 169\u2013212. Morgan Kaufman, 1994."},{"key":"17_CR13","unstructured":"S. Penberthy. Planning with Continuous Change PhD thesis, University of Washington Department of Computer Science and Engineering, 1993."},{"issue":"1","key":"17_CR14","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1017\/S0269888900001089","volume":"15","author":"D. Smith","year":"2000","unstructured":"D. Smith, J. Frank, and A. J\u00f3nsson. Bridging the gap between planning and scheduling. Knowledge Engineering Review, 15(1):61\u201394, 2000.","journal-title":"Knowledge Engineering Review"},{"key":"17_CR15","unstructured":"B. Selman and H. Kautz. Pushing the envelope: Planning, propositional logic, and stochastic search. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, pages 1194\u20131201, 1996."}],"container-title":["Lecture Notes in Computer Science","Abstraction, Reformulation, and Approximation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44914-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T21:36:14Z","timestamp":1550352974000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44914-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678397","9783540449140"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-44914-0_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}