{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:54:40Z","timestamp":1725540880199},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642102905"},{"type":"electronic","value":"9783642102912"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10291-2_26","type":"book-chapter","created":{"date-parts":[[2009,11,16]],"date-time":"2009-11-16T03:14:47Z","timestamp":1258341287000},"page":"253-263","source":"Crossref","is-referenced-by-count":1,"title":["Improving Plan Quality in SAT-Based Planning"],"prefix":"10.1007","author":[{"given":"Enrico","family":"Giunchiglia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Maratea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"Kautz, H., Selman, B.: Planning as satisfiability. In: Neumann, B. (ed.) Proc. of ECAI 1992, pp. 359\u2013363 (1992)","DOI":"10.1038\/359363a0"},{"key":"26_CR2","first-page":"318","volume-title":"Proc. of IJCAI 1999","author":"H. Kautz","year":"1999","unstructured":"Kautz, H., Selman, B.: Unifying SAT-based and graph-based planning. In: Dean, T. (ed.) Proc. of IJCAI 1999, pp. 318\u2013325. Morgan Kaufmann, San Francisco (1999)"},{"key":"26_CR3","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1613\/jair.1677","volume":"24","author":"J. Hoffmann","year":"2005","unstructured":"Hoffmann, J., Edelkamp, S.: The deterministic part of IPC-4: An overview. Journal of Artificial Intelligence Research\u00a024, 519\u2013579 (2005)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"5-6","key":"26_CR4","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1016\/j.artint.2008.10.012","volume":"173","author":"A. Gerevini","year":"2009","unstructured":"Gerevini, A., Haslum, P., Long, D., Saetti, A., Dimopoulos, Y.: Deterministic planning in the 5th IPC: PDDL3 and experimental evaluation of the planners. Artificial Intelligence\u00a0173(5-6), 619\u2013668 (2009)","journal-title":"Artificial Intelligence"},{"key":"26_CR5","unstructured":"Xing, Z., Chen, Y., Zhang, W.: Maxplan: Optimal planning by decomposed satisfiability and backward reduction. In: Proc. of 5th IPC, ICAPS 2006, pp. 53\u201355 (2006)"},{"key":"26_CR6","first-page":"987","volume-title":"Proc. of AAAI 2007","author":"E. Giunchiglia","year":"2007","unstructured":"Giunchiglia, E., Maratea, M.: Planning as satisfiability with preferences. In: Proc. of AAAI 2007, pp. 987\u2013992. AAAI Press, Menlo Park (2007)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Giunchiglia, E., Maratea, M.: SAT-based planning with minimal-#actions plans and \u201dsoft\u201d goals. In: Proc. of AI*IA 2007, pp. 422\u2013433 (2007)","DOI":"10.1007\/978-3-540-74782-6_37"},{"issue":"4","key":"26_CR8","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s10472-005-7034-1","volume":"44","author":"M. J\u00e4rvisalo","year":"2005","unstructured":"J\u00e4rvisalo, M., Junttila, T.A., Niemel\u00e4, I.: Unrestricted vs restricted cut in a tableau method for boolean circuits. Annals of Mathematics and Artificial Intelligence\u00a044(4), 373\u2013399 (2005)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"26_CR9","unstructured":"Castell, T., Cayrol, C., Cayrol, M., Berre, D.L.: Using the Davis and Putnam procedure for an efficient computation of preferred models. In: Proc. of ECAI 1996, pp. 350\u2013354 (1996)"},{"key":"26_CR10","first-page":"136","volume-title":"Proc. of ECAI 2002","author":"M. Gavanelli","year":"2002","unstructured":"Gavanelli, M.: An algorithm for multi-criteria optimization in CSPs. In: Proc. of ECAI 2002, pp. 136\u2013140. IOS Press, Amsterdam (2002)"},{"key":"26_CR11","first-page":"510","volume-title":"Proc. of ECAI 2008","author":"E. DiRosa","year":"2008","unstructured":"DiRosa, E., Giunchiglia, E., Maratea, M.: A new approach for solving satisfiability problems with qualitative preferences. In: Proc. of ECAI 2008, pp. 510\u2013514. IOS Press, Amsterdam (2008)"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Tseitin, G.: On the complexity of proofs in propositional logics. Seminars in Mathematics\u00a08 (1970)","DOI":"10.1007\/978-1-4899-5327-8_25"},{"issue":"2","key":"26_CR13","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0020-0190(98)00144-6","volume":"68","author":"J.P. Warners","year":"1998","unstructured":"Warners, J.P.: A linear-time transformation of linear inequalities into CNF. Information Processing Letters\u00a068(2), 63\u201369 (1998)","journal-title":"Information Processing Letters"},{"key":"26_CR14","first-page":"182","volume-title":"Proc. of ICAPS 2005","author":"R.I. Brafman","year":"2005","unstructured":"Brafman, R.I., Chernyavsky, Y.: Planning with goal preferences and constraints. In: Proc. of ICAPS 2005, pp. 182\u2013191. AAAI Press, Menlo Park (2005)"},{"key":"26_CR15","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1613\/jair.1234","volume":"21","author":"C. Boutilier","year":"2004","unstructured":"Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., Poole, D.: CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. Journal of Artificial Intelligence Research\u00a021, 135\u2013191 (2004)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"26_CR16","first-page":"292","volume-title":"Proc. of ICAPS 2005","author":"M. B\u00fcttner","year":"2005","unstructured":"B\u00fcttner, M., Rintanen, J.: Satisfiability planning with constraints on the number of actions. In: Proc. of ICAPS 2005, pp. 292\u2013299. AAAI Press, Menlo Park (2005)"},{"key":"26_CR17","unstructured":"Chen, Y., Lv, Q., Huang, R.: Plan-A: A cost-optimal planner based on SAT-constrained optimization. In: Proc. of 6th IPC, ICAPS 2008 (2008)"},{"key":"26_CR18","first-page":"588","volume-title":"Proc. of ECAI 2008","author":"E. Keyder","year":"2008","unstructured":"Keyder, E., Geffner, H.: Heuristics for planning with action costs revisited. In: Proc. of ECAI 2008, pp. 588\u2013592. IOS Press, Amsterdam (2008)"}],"container-title":["Lecture Notes in Computer Science","AI*IA 2009: Emergent Perspectives in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10291-2_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,13]],"date-time":"2021-10-13T23:07:33Z","timestamp":1634166453000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10291-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102905","9783642102912"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10291-2_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}