{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T04:05:30Z","timestamp":1748664330969,"version":"3.41.0"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319231136"},{"type":"electronic","value":"9783319231143"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-23114-3_2","type":"book-chapter","created":{"date-parts":[[2015,8,27]],"date-time":"2015-08-27T09:01:33Z","timestamp":1440666093000},"page":"19-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Reasoning with Preference Trees over Combinatorial Domains"],"prefix":"10.1007","author":[{"given":"Xudong","family":"Liu","sequence":"first","affiliation":[]},{"given":"Miroslaw","family":"Truszczynski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,28]]},"reference":[{"key":"2_CR1","unstructured":"Booth, R., Chevaleyre, Y., Lang, J., Mengin, J., Sombattheera, C.: Learning conditionally lexicographic preference relations. In: ECAI, pp. 269\u2013274 (2010)"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1613\/jair.1234","volume":"21","author":"C Boutilier","year":"2004","unstructured":"Boutilier, C., Brafman, R., Domshlak, C., Hoos, H., Poole, D.: CP-nets: a tool for representing and reasoning with conditional ceteris paribus preference statements. J. Artif. Intell. Res. 21, 135\u2013191 (2004)","journal-title":"J. Artif. Intell. Res."},{"key":"2_CR3","unstructured":"Brewka, G., Niemel\u00e4, I., Truszczynski, M.: Answer set optimization. In: IJCAI, pp. 867\u2013872 (2003)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Dubois, D., Lang, J., Prade, H.: A brief overview of possibilistic logic. In: ECSQARU, pp. 53\u201357 (1991)","DOI":"10.1007\/3-540-54659-6_65"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Fraser, N.M.: Applications of preference trees. In: Proceedings of IEEE Systems Man and Cybernetics Conference, pp. 132\u2013136. IEEE (1993)","DOI":"10.1109\/ICSMC.1993.384733"},{"issue":"1","key":"2_CR6","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01075297","volume":"36","author":"NM Fraser","year":"1994","unstructured":"Fraser, N.M.: Ordinal preference representations. Theory Decis. 36(1), 45\u201367 (1994)","journal-title":"Theory Decis."},{"key":"2_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"2_CR8","series-title":"Cognitive Technologies","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17280-9","volume-title":"Working with Preferences: Less Is More","author":"S Kaci","year":"2011","unstructured":"Kaci, S.: Working with Preferences: Less Is More. Cognitive Technologies. Springer, Berlin (2011)"},{"issue":"3","key":"2_CR9","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1016\/0022-0000(88)90039-6","volume":"36","author":"MW Krentel","year":"1988","unstructured":"Krentel, M.W.: The complexity of optimization problems. J. Comput. Syst. Sci. 36(3), 490\u2013509 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Lang, J., Mengin, J., Xia, L.: Aggregating conditionally lexicographic preferences on multi-issue domains. In: CP, pp. 973\u2013987 (2012)","DOI":"10.1007\/978-3-642-33558-7_69"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/978-3-642-41575-3_19","volume-title":"Algorithmic Decision Theory","author":"X Liu","year":"2013","unstructured":"Liu, X., Truszczynski, M.: Aggregating Conditionally lexicographic preferences using answer set programming solvers. In: Perny, P., Pirlot, M., Tsouki\u00e0s, A. (eds.) ADT 2013. LNCS, vol. 8176, pp. 244\u2013258. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-23114-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T05:33:21Z","timestamp":1748583201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23114-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319231136","9783319231143"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23114-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}