{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:53:24Z","timestamp":1725490404112},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540747819"},{"type":"electronic","value":"9783540747826"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74782-6_37","type":"book-chapter","created":{"date-parts":[[2007,8,25]],"date-time":"2007-08-25T14:51:49Z","timestamp":1188053509000},"page":"422-433","source":"Crossref","is-referenced-by-count":3,"title":["SAT-Based Planning with Minimal-#actions Plans and \u201csoft\u201d Goals"],"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":"37_CR1","doi-asserted-by":"crossref","unstructured":"Kautz, H., Selman, B.: Planning as satisfiability. In: Proc.\u00a0ECAI 1992, pp. 359\u2013363 (1992)","DOI":"10.1038\/359363a0"},{"key":"37_CR2","first-page":"318","volume-title":"Proc.\u00a0IJCAI 1999","author":"H. Kautz","year":"1999","unstructured":"Kautz, H., Selman, B.: Unifying SAT-based and graph-based planning. In: Proc.\u00a0IJCAI 1999, pp. 318\u2013325. Morgan-Kaufmann, San Francisco (1999)"},{"key":"37_CR3","unstructured":"Kautz, H., Selman, B.: SATPLAN04: Planning as satisfiability. In: ICAPS 2006. Proc. of 5th International Planning Competition, Internation Conference on Automated Planning and Scheduling, pp. 45\u201347 (2006)"},{"key":"37_CR4","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 (JAIR)\u00a024, 519\u2013579 (2005)","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"37_CR5","unstructured":"Xing, Z., Chen, Y., Zhang, W.: MaxPlan: Optimal planning by decomposed satisfiability and backward reduction. In: ICAPS 2006. Proc. of 5th International Planning Competition, Internation Conference on Automated Planning and Scheduling, pp. 53\u201355 (2006)"},{"key":"37_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/11853886_43","volume-title":"Logics in Artificial Intelligence","author":"E. Giunchiglia","year":"2006","unstructured":"Giunchiglia, E., Maratea, M.: OPTSAT: A Tool for Solving SAT related optimization problems. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006. LNCS (LNAI), vol.\u00a04160, pp. 485\u2013489. Springer, Heidelberg (2006)"},{"key":"37_CR7","first-page":"377","volume-title":"ECAI","author":"E. Giunchiglia","year":"2006","unstructured":"Giunchiglia, E., Maratea, M.: Solving Optimization Problems with DLL. In: ECAI. Proc. of the 17th European Conference on Artificial Intelligence, pp. 377\u2013381. IOS Press, Amsterdam (2006)"},{"key":"37_CR8","unstructured":"Hsu, C., Wah, B., Huang, R., Chen, Y.: Constraint Partitioning for Solving Planning Problems with Trajectory Constraints and Goal Preferences. In: Proc. IJCAI, pp. 1924\u20131929 (2007)"},{"issue":"2","key":"37_CR9","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":"37_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"O. Bailleux","year":"2003","unstructured":"Bailleux, O., Boufkhad, Y.: Efficient CNF Encoding of Boolean Cardinality Constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, Springer, Heidelberg (2003)"},{"key":"37_CR11","unstructured":"Giunchiglia, E., Maratea, M.: Planning as Satisfiability with Preferences. In: AAAI. Proc. of 22th National Conference of the American Association for Artificial Intelligence (to appear, 2007)"},{"key":"37_CR12","unstructured":"B\u00fcttner, M., Rintanen, J.: Satisfiability planning with constraints on the number of actions. In: Proc. ICAPS, pp. 292\u2013299 (2005)"},{"key":"37_CR13","unstructured":"Gerevini, A., Long, D.: Plan constraints and preferences in PDDL3. In: ICAPS 2006. Proc. of 5th International Planning Competition, Internation Conference on Automated Planning and Scheduling, pp. 7\u201313 (2006)"}],"container-title":["Lecture Notes in Computer Science","AI*IA 2007: Artificial Intelligence and Human-Oriented Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74782-6_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,22]],"date-time":"2021-08-22T10:41:16Z","timestamp":1629628876000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74782-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540747819","9783540747826"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74782-6_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}