{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:56:44Z","timestamp":1742957804513,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540859574"},{"type":"electronic","value":"9783540859581"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85958-1_50","type":"book-chapter","created":{"date-parts":[[2008,9,20]],"date-time":"2008-09-20T03:26:13Z","timestamp":1221881173000},"page":"603-607","source":"Crossref","is-referenced-by-count":3,"title":["Computing All Optimal Solutions in Satisfiability Problems with Preferences"],"prefix":"10.1007","author":[{"given":"Emanuele","family":"Di Rosa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Giunchiglia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Maratea","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"50_CR1","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. J. Artif. Intell. Res (JAIR)\u00a021, 135\u2013191 (2004)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"50_CR2","unstructured":"Giunchiglia, E., Maratea, M.: Solving optimization problems with DLL. In: Proc. of 17th European Conference on Artificial Intelligence (ECAI), pp. 377\u2013381 (2006)"},{"issue":"2","key":"50_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1111\/j.0824-7935.2004.00234.x","volume":"20","author":"C. Boutilier","year":"2004","unstructured":"Boutilier, C., Brafman, R.I., Domshlak, C., Hoos, H.H., Poole, D.: Preference-based constrained optimization with CP-nets. Computational Intelligence\u00a020(2), 137\u2013157 (2004)","journal-title":"Computational Intelligence"},{"issue":"4","key":"50_CR4","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., 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":"50_CR5","first-page":"987","volume-title":"Proc. of 22nd AAAI Conference on Artificial Intelligence","author":"E. Giunchiglia","year":"2007","unstructured":"Giunchiglia, E., Maratea, M.: Planning as satisfiability with preferences. In: Proc. of 22nd AAAI Conference on Artificial Intelligence, pp. 987\u2013992. AAAI Press, Menlo Park (2007)"},{"issue":"7","key":"50_CR6","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.W.: A machine program for theorem proving. Communication of ACM\u00a05(7), 394\u2013397 (1962)","journal-title":"Communication of ACM"},{"key":"50_CR7","doi-asserted-by":"crossref","unstructured":"Tseitin, G.: On the complexity of proofs in propositional logics. Seminars in Mathematics\u00a08 (1970); Reprinted in [9]","DOI":"10.1007\/978-1-4899-5327-8_25"},{"key":"50_CR8","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0747-7171(86)80028-1","volume":"2","author":"D.A. Plaisted","year":"1986","unstructured":"Plaisted, D.A., Greenbaum, S.: A Structure-preserving Clause Form Translation. Journal of Symbolic Computation\u00a02, 293\u2013304 (1986)","journal-title":"Journal of Symbolic Computation"},{"volume-title":"Automation of Reasoning: Classical Papers in Computational Logic 1967\u20131970","year":"1983","key":"50_CR9","unstructured":"Siekmann, J., Wrightson, G. (eds.): Automation of Reasoning: Classical Papers in Computational Logic 1967\u20131970, vol.\u00a01-2. Springer, Heidelberg (1983)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85958-1_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T07:07:37Z","timestamp":1715238457000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85958-1_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540859574","9783540859581"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85958-1_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}