{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T19:51:24Z","timestamp":1776109884921,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642303524","type":"print"},{"value":"9783642303531","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30353-1_10","type":"book-chapter","created":{"date-parts":[[2012,5,25]],"date-time":"2012-05-25T13:44:29Z","timestamp":1337953469000},"page":"109-120","source":"Crossref","is-referenced-by-count":10,"title":["Preference-Based Planning via MaxSAT"],"prefix":"10.1007","author":[{"given":"Farah","family":"Juma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric I.","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheila A.","family":"McIlraith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-642-02777-2_39","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"C. Ans\u00f3tegui","year":"2009","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J.: Solving (Weighted) Partial MaxSAT through Satisfiability Testing. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol.\u00a05584, pp. 427\u2013440. Springer, Heidelberg (2009)"},{"issue":"5-6","key":"10_CR2","first-page":"593","volume":"173","author":"J.A. Baier","year":"2009","unstructured":"Baier, J.A., Bacchus, F., McIlraith, S.A.: A heuristic search approach to planning with temporally extended preferences. AIJ\u00a0173(5-6), 593\u2013618 (2009)","journal-title":"AIJ"},{"issue":"4","key":"10_CR3","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1609\/aimag.v29i4.2204","volume":"29","author":"J.A. Baier","year":"2008","unstructured":"Baier, J.A., McIlraith, S.A.: Planning with preferences. AI Magazine\u00a029(4), 25\u201336 (2008)","journal-title":"AI Magazine"},{"key":"10_CR4","doi-asserted-by":"crossref","first-page":"59","DOI":"10.3233\/SAT190075","volume":"7","author":"D.L. Berre","year":"2010","unstructured":"Berre, D.L., Parrain, A.: The SAT4J library, release 2.2. Journal on Satisfiability, Boolean Modeling and Computation\u00a07, 59\u201364 (2010)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Coles, A.J., Coles, A.: LPRPG-P: Relaxed plan heuristics for planning with preferences. In: ICAPS (2011)","DOI":"10.1609\/icaps.v21i1.13445"},{"issue":"5-6","key":"10_CR6","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 fifth international planning competition: PDDL3 and experimental evaluation of the planners. Artificial Intelligence\u00a0173(5-6), 619\u2013668 (2009)","journal-title":"Artificial Intelligence"},{"key":"10_CR7","unstructured":"Giunchiglia, E., Maratea, M.: A pseudo-boolean approach for solving planning problems with IPC simple preferences. In: COPLAS, pp. 23\u201331 (2010)"},{"key":"10_CR8","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1613\/jair.1705","volume":"26","author":"M. Helmert","year":"2006","unstructured":"Helmert, M.: The Fast Downward planning system. JAIR\u00a026, 191\u2013246 (2006)","journal-title":"JAIR"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-72788-0_8","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2007","author":"F. Heras","year":"2007","unstructured":"Heras, F., Larrosa, J., Oliveras, A.: MiniMaxSat: A New Weighted Max-SAT Solver. In: Marques-Silva, J., Sakallah, K.A. (eds.) SAT 2007. LNCS, vol.\u00a04501, pp. 41\u201355. Springer, Heidelberg (2007)"},{"key":"10_CR10","unstructured":"Hsu, C.-W., Wah, B., Huang, R., Chen, Y.: Constraint partitioning for solving planning problems with trajectory constraints and goal preferences. In: IJCAI, pp. 1924\u20131929 (2007)"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Huang, R., Chen, Y., Zhang, W.: A novel transition based encoding scheme for planning as satisfiability. In: AAAI, Atlanta, GA, pp. 89\u201394 (2010)","DOI":"10.1609\/aaai.v24i1.7544"},{"key":"10_CR12","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1613\/jair.2857","volume":"36","author":"E. Keyder","year":"2009","unstructured":"Keyder, E., Geffner, H.: Soft goals can be compiled away. JAIR\u00a036, 547\u2013556 (2009)","journal-title":"JAIR"},{"key":"10_CR13","unstructured":"Knecht, M.: Efficient Domain-Independent Planning using Declarative Programming. Master\u2019s thesis, University of Potsdam (December 2009)"},{"key":"10_CR14","unstructured":"Maratea, M.: An experimental evaluation of Max-SAT and PB solvers on over-subscription planning problems. In: RCRA, vol.\u00a0616 (2010)"},{"key":"10_CR15","unstructured":"Marques-Silva, J.: The MSUncore MaxSAT solver (2009)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Robinson, N., Gretton, C., Pham, D.N., Sattar, A.: Partial weighted MaxSAT for optimal planning. In: PRICAI, Daegu, Korea, pp. 231\u2013243 (2010)","DOI":"10.1007\/978-3-642-15246-7_23"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30353-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,22]],"date-time":"2023-06-22T23:15:24Z","timestamp":1687475724000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30353-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642303524","9783642303531"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30353-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}