{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:12:34Z","timestamp":1743052354305,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642239533"},{"type":"electronic","value":"9783642239540"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-23954-0_19","type":"book-chapter","created":{"date-parts":[[2011,9,10]],"date-time":"2011-09-10T20:30:34Z","timestamp":1315686634000},"page":"189-200","source":"Crossref","is-referenced-by-count":2,"title":["Exploiting Macro-actions and Predicting Plan Length in Planning as Satisfiability"],"prefix":"10.1007","author":[{"given":"Alfonso Emilio","family":"Gerevini","sequence":"first","affiliation":[]},{"given":"Alessandro","family":"Saetti","sequence":"additional","affiliation":[]},{"given":"Mauro","family":"Vallati","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0004-3702(96)00047-1","volume":"90","author":"A. Blum","year":"1997","unstructured":"Blum, A., Furst, M.L.: Fast planning through planning graph analysis. Artificial Intelligence\u00a090, 281\u2013300 (1997)","journal-title":"Artificial Intelligence"},{"unstructured":"Botea, A., M\u00fcller, M., Schaeffer, J.: Learning partial-order macros from solutions. In: Proc. of ICAPS 2005 (2005)","key":"19_CR2"},{"unstructured":"Celorrio, S.J., Coles, A., Coles, A.: 7th Int. Planning Competition \u2013 Learning Track (2011), \n                    \n                      http:\/\/www.plg.inf.uc3m.es\/ipc2011-learning","key":"19_CR3"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M. Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem-proving. Communications of the ACM\u00a05, 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. Een","year":"2004","unstructured":"Een, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"unstructured":"Fern, A., Khardon, R., Tadepalli, P.: 6th Int. Planning Competition \u2013 Learning Track (2008), \n                    \n                      http:\/\/eecs.oregonstate.edu\/ipc-learn\/","key":"19_CR6"},{"key":"19_CR7","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1613\/jair.1183","volume":"20","author":"A. Gerevini","year":"2003","unstructured":"Gerevini, A., Saetti, A., Serina, I.: Planning through stochastic local search and temporal action graphs. Journal of Artificial Intelligence Research\u00a020, 239\u2013290 (2003)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","volume-title":"Advanced Topics in Artificial Intelligence","author":"M. Hall","year":"1999","unstructured":"Hall, M., Holmes, G., Frank, E.: Generating Rule Sets from Model Trees. In: Foo, N.Y. (ed.) AI 1999. LNCS, vol.\u00a01747. Springer, Heidelberg (1999)"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10462-007-9049-y","volume":"26","author":"M. Helmert","year":"2006","unstructured":"Helmert, M.: The Fast downward planning system. Journal of Artificial Intelligence Research\u00a026, 191\u2013246 (2006)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"19_CR10","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1613\/jair.855","volume":"14","author":"J. Hoffmann","year":"2001","unstructured":"Hoffmann, J., Nebel, B.: The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research\u00a014, 253\u2013302 (2001)","journal-title":"Journal of Artificial Intelligence Research"},{"unstructured":"Kautz, H., Selman, B.: Planning as satisfiability. In: Proc. of ECAI 1992 (1992)","key":"19_CR11"},{"unstructured":"Kautz, H., Selman, B.: Unifying SAT-based and graph-based planning. In: Proc. of IJCAI 1999 (1999)","key":"19_CR12"},{"unstructured":"Kautz, H., Selman, B., Hoffmann, J.: SatPlan: Planning as satisfiability. In: Abstract Booklet of the 5th Int. Planning Competition (2006)","key":"19_CR13"},{"doi-asserted-by":"crossref","unstructured":"Marques, S.J.P., Karem, S.A.: GRASP a new search algorithm for satisfiability. In: Proc. of ICCD 1996 (1996)","key":"19_CR14","DOI":"10.1109\/ICCAD.1996.569607"},{"doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: Proc. of DAC 2001 (2001)","key":"19_CR15","DOI":"10.1145\/378239.379017"},{"unstructured":"Newton, M., Levine, J., Fox, M., Long, D.: Learning macro-actions for arbitrary planners and domains. In: Proc. of ICAPS 2007 (2007)","key":"19_CR16"},{"key":"19_CR17","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1613\/jair.2972","volume":"39","author":"S. Richter","year":"2010","unstructured":"Richter, S., Westphal, M.: The LAMA planner: Guiding cost-based anytime planning with landmarks. Journal of Artificial Intelligence Research\u00a039, 127\u2013177 (2010)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"19_CR18","volume-title":"Data mining: Practical machine learning tools and techniques","author":"I.H. Witten","year":"2005","unstructured":"Witten, I.H., Frank, E.: Data mining: Practical machine learning tools and techniques. Morgan Kaufmann, San Francisco (2005)"}],"container-title":["Lecture Notes in Computer Science","AI*IA 2011: Artificial Intelligence Around Man and Beyond"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23954-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,3]],"date-time":"2019-04-03T16:38:42Z","timestamp":1554309522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23954-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642239533","9783642239540"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23954-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}