{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:31:47Z","timestamp":1762101107707,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152450"},{"type":"electronic","value":"9783642152467"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15246-7_23","type":"book-chapter","created":{"date-parts":[[2010,8,24]],"date-time":"2010-08-24T02:28:27Z","timestamp":1282616907000},"page":"231-243","source":"Crossref","is-referenced-by-count":7,"title":["Partial Weighted MaxSAT for Optimal Planning"],"prefix":"10.1007","author":[{"given":"Nathan","family":"Robinson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles","family":"Gretton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Duc Nghia","family":"Pham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abdul","family":"Sattar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","unstructured":"Hoffmann, J., Gomes, C.P., Selman, B., Kautz, H.A.: Sat encodings of state-space reachability problems in numeric domains. In: Proc. IJCAI (2007)"},{"key":"23_CR2","unstructured":"Kautz, H.A.: Deconstructing planning as satisfiability. In: Proc. AAAI (2006)"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Russell, R., Holden, S.: Handling goal utility dependencies in a satisfiability framework. In: Proc. ICAPS (2010)","DOI":"10.1609\/icaps.v20i1.13401"},{"key":"23_CR4","unstructured":"Giunchiglia, E., Maratea, M.: Planning as satisfiability with preferences. In: Proc. ICAPS (2007)"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Robinson, N., Gretton, C., Pham, D.N., Sattar, A.: Sat-based parallel planning using a split representation of actions. In: Proc. ICAPS (2009)","DOI":"10.1609\/icaps.v19i1.13368"},{"key":"23_CR6","unstructured":"Streeter, M., Smith, S.: Using decision procedures efficiently for optimization. In: Proc. ICAPS (2007)"},{"key":"23_CR7","unstructured":"Rintanen, J.: Evaluation strategies for planning as satisfiability. In: Proc. ECAI (2004)"},{"key":"23_CR8","unstructured":"Kautz, H., Selman, B.: Unifying SAT-based and graph-based planning. In: Proc. IJCAI (1999)"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Keyder, E., Geffner, H.: Soft goals can be compiled away. Journal of Artificial Intelligence Research\u00a036(1) (2009)","DOI":"10.1613\/jair.2857"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0004-3702(94)90081-7","volume":"69","author":"T. Bylander","year":"1994","unstructured":"Bylander, T.: The computational complexity of propositional strips planning. Artificial Intelligence\u00a069, 165\u2013204 (1994)","journal-title":"Artificial Intelligence"},{"key":"23_CR11","doi-asserted-by":"crossref","first-page":"251","DOI":"10.3233\/SAT190047","volume":"4","author":"J. Argelic","year":"2008","unstructured":"Argelic, J., Li, C.M., Manya, F., Planes, J.: The first and second max-sat evaluations. Journal on Satisfiability, Boolean Modeling and Computation\u00a04, 251\u2013278 (2008)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/11814948_25","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"Z. Fu","year":"2006","unstructured":"Fu, Z., Malik, S.: On solving the partial max-sat problem. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 252\u2013265. Springer, Heidelberg (2006)"},{"key":"23_CR13","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.: Fast planning through planning graph analysis. Artificial Intelligence\u00a0(90), 281\u2013300 (1997)","journal-title":"Artificial Intelligence"},{"key":"23_CR14","unstructured":"Rintanen, J.: Planning graphs and propositional clause learning. In: Proc. KR (2008)"},{"key":"23_CR15","unstructured":"Kautz, H., McAllester, D., Selman, B.: Encoding plans in propositional logic. In: Proc. KR (1996)"},{"key":"23_CR16","unstructured":"Pipatsrisawat, K., Darwiche, A.: Rsat 2.0: SAT solver description. Technical Report D\u2013153, Automated Reasoning Group, Computer Science Department, UCLA (2007)"},{"key":"23_CR17","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. DAC (2001)","DOI":"10.1145\/378239.379017"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: Grasp - a new search algorithm for satisfiability. In: Proc. ICCAD (1996)","DOI":"10.1109\/ICCAD.1996.569607"},{"key":"23_CR19","unstructured":"Huang, J.: The effect of restarts on the efficiency of clause learning. In: Proc. IJCAI (2007)"},{"key":"23_CR20","unstructured":"Robinson, N., Gretton, C., Pham, D.N.: Co-plan: Combining SAT-based planning with forward-search. In: Proc. IPC-6 (2008)"},{"key":"23_CR21","unstructured":"B\u00fcttner, M., Rintanen, J.: Satisfiability planning with constraints on the number of actions. In: Proc. ICAPS (2005)"},{"key":"23_CR22","unstructured":"Wolfman, S.A., Weld, D.S.: The LPSAT engine and its application to resource planning. In: Proc. IJCAI (1999)"},{"issue":"1-2","key":"23_CR23","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.artint.2005.04.001","volume":"166","author":"J.A. Shin","year":"2005","unstructured":"Shin, J.A., Davis, E.: Processes and continuous change in a sat-based planner. Artif. Intell.\u00a0166(1-2), 194\u2013253 (2005)","journal-title":"Artif. Intell."},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"Helmert, M., Domshlak, C.: Landmarks, critical paths and abstractions: What\u2019s the difference anyway? In: Proc. ICAPS (2009)","DOI":"10.1609\/icaps.v19i1.13370"}],"container-title":["Lecture Notes in Computer Science","PRICAI 2010: Trends in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15246-7_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T23:47:33Z","timestamp":1740440853000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15246-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152450","9783642152467"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15246-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}