{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:39:24Z","timestamp":1725536364612},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027338"},{"type":"electronic","value":"9783642027345"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02734-5_6","type":"book-chapter","created":{"date-parts":[[2009,8,1]],"date-time":"2009-08-01T12:43:31Z","timestamp":1249130611000},"page":"77-96","source":"Crossref","is-referenced-by-count":0,"title":["Bounded-Resource Reasoning as (Strong or Classical) Planning"],"prefix":"10.1007","author":[{"given":"Alexandre","family":"Albore","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Natasha","family":"Alechina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Piergiorgio","family":"Bertoli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chiara","family":"Ghidini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brian","family":"Logan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"6_CR1","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1137\/S0097539700366735","volume":"31","author":"M. Alekhnovich","year":"2002","unstructured":"Alekhnovich, M., Ben-Sasson, E., Razborov, A.A., Wigderson, A.: Space complexity in propositional calculus. SIAM J. Comput.\u00a031(4), 1184\u20131211 (2002)","journal-title":"SIAM J. Comput."},{"issue":"1-2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0004-3702(99)00071-5","volume":"116","author":"F. Bacchus","year":"2000","unstructured":"Bacchus, F., Kabanza, F.: Using Temporal Logics to Express Search Control Knowledge for Planning. Artificial Intelligence\u00a0116(1-2), 123\u2013191 (2000)","journal-title":"Artificial Intelligence"},{"key":"6_CR3","unstructured":"Bertoli, P., Cimatti, A., Pistore, M., Roveri, M., Traverso, P.: MBP: a model based planner. In: Proceedings of the IJCAI 2001 Workshop on Planning under Uncertainty and Incomplete Information, Seattle (August 2001)"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF03037438","volume":"4","author":"W. Bibel","year":"1986","unstructured":"Bibel, W.: A Deductive Solution for Plan Generation. New Generation Computing\u00a04, 115\u2013132 (1986)","journal-title":"New Generation Computing"},{"key":"6_CR5","unstructured":"Chien, S., Rabideau, G., Knight, R., Sherwood, R., Engelhardt, B., Mutz, D., Estlin, T., Smith, B., Fisher, F., Barrett, T., Stebbins, G., Tran, D.: ASPEN - Automated Planning and Scheduling for Space Mission Operations. In: Proc. of SpaceOps (2000)"},{"issue":"1\/2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0004-3702(02)00374-0","volume":"147","author":"A. Cimatti","year":"2003","unstructured":"Cimatti, A., Pistore, M., Roveri, M., Traverso, P.: Weak, Strong, and Strong Cyclic Planning via Symbolic Model Checking. Artificial Intelligence\u00a0147(1\/2), 35\u201384 (2003)","journal-title":"Artificial Intelligence"},{"issue":"2-3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","volume":"39","author":"A. Haken","year":"1985","unstructured":"Haken, A.: The intractability of resolution. Journal of Theoretical Computer Science\u00a039(2-3), 297\u2013308 (1985)","journal-title":"Journal of Theoretical Computer Science"},{"key":"6_CR8","first-page":"62","volume-title":"AAAI Fall Symposium on Automated Deduction in Nonstandard Logics","author":"E. Jacopin","year":"1993","unstructured":"Jacopin, E.: Classical AI planning as theorem proving: The case of a fragment of linear logic. In: AAAI Fall Symposium on Automated Deduction in Nonstandard Logics, Palo Alto, California, pp. 62\u201366. AAAI Press, Menlo Park (1993)"},{"key":"6_CR9","first-page":"1194","volume-title":"Proceedings of the Thirteenth National Conference on Artificial Intelligence","author":"H. Kautz","year":"1996","unstructured":"Kautz, H., Selman, B.: Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence, pp. 1194\u20131201. AAAI Press, Menlo Park (1996)"},{"key":"6_CR10","unstructured":"Petrik, M., Zilberstein, S.: Anytime Coordination Using Separable Bilinear Programs. In: Proceedings of the Twenty-Second National Conference on Artificial Intelligence (AAAI 2007) (2007)"},{"key":"6_CR11","unstructured":"Smullyan, R.M.: First-Order Logic. Dover Publications (1995)"}],"container-title":["Lecture Notes in Computer Science","Computational Logic in Multi-Agent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02734-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T07:45:46Z","timestamp":1552117546000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02734-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027338","9783642027345"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02734-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}