{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T07:10:02Z","timestamp":1746169802321,"version":"3.40.4"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319035239"},{"type":"electronic","value":"9783319035246"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03524-6_24","type":"book-chapter","created":{"date-parts":[[2013,12,9]],"date-time":"2013-12-09T12:35:00Z","timestamp":1386592500000},"page":"276-287","source":"Crossref","is-referenced-by-count":0,"title":["Underestimation vs. Overestimation in SAT-Based Planning"],"prefix":"10.1007","author":[{"given":"Mauro","family":"Vallati","sequence":"first","affiliation":[]},{"given":"Luk\u00e1\u0161","family":"Chrpa","sequence":"additional","affiliation":[]},{"given":"Andrew","family":"Crampton","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Biere, A.: P{re,i}cosat@sc\u201909. In: SAT Competition 2009 (2009)"},{"key":"24_CR2","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"},{"key":"24_CR3","unstructured":"Celorrio, S.J., Coles, A., Coles, A.: Learning track of the 7th International Planning Competition (2011), https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/http\/www.plg.inf.uc3m.es\/ipc2011-learning"},{"issue":"7","key":"24_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(7), 394\u2013397 (1962)","journal-title":"Communications of the ACM"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-642-23954-0_19","volume-title":"AI*IA 2011: Artificial Intelligence Around Man and Beyond","author":"A.E. Gerevini","year":"2011","unstructured":"Gerevini, A.E., Saetti, A., Vallati, M.: Exploiting macro-actions and predicting plan length in planning as satisfiability. In: Pirrone, R., Sorbello, F. (eds.) AI*IA 2011. LNCS, vol.\u00a06934, pp. 189\u2013200. Springer, Heidelberg (2011)"},{"issue":"1","key":"24_CR6","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1656274.1656278","volume":"11","author":"M. Hall","year":"2009","unstructured":"Hall, M., Holmes, F.G., Pfahringer, B., Reutemann, P., Witten, I.H.: The WEKA data mining software: An update. SIGKDD Explorations\u00a011(1), 10\u201318 (2009)","journal-title":"SIGKDD Explorations"},{"issue":"3","key":"24_CR7","first-page":"57","volume":"22","author":"J. Hoffmann","year":"2001","unstructured":"Hoffmann, J.: FF: The Fast-Forward Planning System. AI Magazine\u00a022(3), 57\u201362 (2001)","journal-title":"AI Magazine"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Huang, R., Chen, Y., Zhang, W.: A novel transition based encoding scheme for planning as satisfiability. In: Proceedings of the 24th AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 89\u201394. AAAI (2010)","DOI":"10.1609\/aaai.v24i1.7544"},{"key":"24_CR9","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1613\/jair.3442","volume":"43","author":"R. Huang","year":"2012","unstructured":"Huang, R., Chen, Y., Zhang, W.: SAS+ planning as satisfiability. Journal of Artificial Intelligence Research\u00a043, 293\u2013328 (2012)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"24_CR10","unstructured":"Kautz, H., Selman, B.: Planning as satisfiability. In: Proceedings of the 10th European Conference on Artificial Intelligence (ECAI 1992), pp. 359\u2013363. John Wiley and Sons (1992)"},{"key":"24_CR11","unstructured":"Kautz, H., Selman, B.: Unifying sat-based and graph-based planning. In: Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI 1999), pp. 318\u2013325. Morgan Kaufmann (1999)"},{"key":"24_CR12","unstructured":"Kautz, H., Selman, B., Hoffmann, J.: SatPlan: Planning as satisfiability. In: Abstract Booklet of the 5th International Planning Competition (2006)"},{"key":"24_CR13","unstructured":"Mitchell, D., Selman, B., Levesque, H.: Hard and easy distributions of SAT problems. In: Proceedings of the 10th National Conference on Artificial Intelligence (AAAI 1992), pp. 459\u2013465. AAAI (1992)"},{"key":"24_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1007\/978-3-540-30201-8_33","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"E. Nudelman","year":"2004","unstructured":"Nudelman, E., Leyton-Brown, K., Hoos, H.H., Devkar, A., Shoham, Y.: Understanding random SAT: Beyond the clauses-to-variables ratio. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 438\u2013452. Springer, Heidelberg (2004)"},{"key":"24_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/3-540-45357-1_50","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"B. Pfahringer","year":"2001","unstructured":"Pfahringer, B., Holmes, G., Kirkby, R.: Optimizing the induction of alternating decision trees. In: Cheung, D., Williams, G.J., Li, Q. (eds.) PAKDD 2001. LNCS (LNAI), vol.\u00a02035, pp. 477\u2013487. Springer, Heidelberg (2001)"},{"key":"24_CR16","doi-asserted-by":"crossref","unstructured":"Rintanen, J.: Engineering efficient planners with SAT. In: Proceedings of the 20th European Conference on Artificial Intelligence (ECAI 2012), pp. 684\u2013689. IOS Press (2012)","DOI":"10.3233\/978-1-61499-098-7-684"},{"key":"24_CR17","unstructured":"Rintanen, J.: Evaluation strategies for planning as satisfiability. In: Proceedings of the 16th European Conference on Artificial Intelligence (ECAI 2004), pp. 682\u2013687. IOS Press (2004)"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Sideris, A., Dimopoulos, Y.: Constraint propagation in propositional planning. In: Proceedings of the 20th International Conference on Automated Planning and Scheduling (ICAPS 2010), pp. 153\u2013160. AAAI (2010)","DOI":"10.1609\/icaps.v20i1.13422"},{"key":"24_CR19","unstructured":"Sideris, A., Dimopoulos, Y.: Propositional planning as optimization. In: Proceedings of the 20th European Conference on Artificial Intelligence (ECAI 2012), pp. 732\u2013737. IOS Press (2012)"},{"key":"24_CR20","unstructured":"Streeter, M.J., Smith, S.F.: Using decision procedures efficiently for optimization. In: Proceedings of the 17th International Conference on Automated Planning and Scheduling (ICAPS 2007), pp. 312\u2013319. AAAI (2007)"},{"key":"24_CR21","unstructured":"Xing, Z., Chen, Y., Zhang, W.: MaxPlan: Optimal planning by decomposed satisfiability and backward reduction. In: Proceedings of the 5th International Planning Competition, IPC-5 (2006)"}],"container-title":["Lecture Notes in Computer Science","AI*IA 2013: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03524-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T03:31:15Z","timestamp":1746070275000},"score":1,"resource":{"primary":{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/link.springer.com\/10.1007\/978-3-319-03524-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319035239","9783319035246"],"references-count":21,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.1007\/978-3-319-03524-6_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}