{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T19:55:24Z","timestamp":1769975724308,"version":"3.49.0"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319231136","type":"print"},{"value":"9783319231143","type":"electronic"}],"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_33","type":"book-chapter","created":{"date-parts":[[2015,8,27]],"date-time":"2015-08-27T09:01:33Z","timestamp":1440666093000},"page":"555-560","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["CP-nets: From Theory to Practice"],"prefix":"10.1007","author":[{"given":"Thomas E.","family":"Allen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,28]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","unstructured":"Allen, T.E.: CP-nets with indifference. In: 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton), pp. 1488\u20131495. IEEE (2013)","DOI":"10.1109\/Allerton.2013.6736703"},{"key":"33_CR2","unstructured":"Allen, T.E., Goldsmith, J., Mattei, N.: Counting, ranking, and randomly generating CP-nets. In: MPREF 2014 (AAAI-14 Workshop) (2014)"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"Allen, T.E., Chen, M., Goldsmith, J., Mattei, N., Popova, A., Regenwetter, M., Rossi, F., Zwilling, C.: Beyond theory and data in preference modeling: bringing humans into the loop. In: Proceedings of ADT. LNAI. Springer, Heidelberg (2015, In print)","DOI":"10.1007\/978-3-319-23114-3_1"},{"key":"33_CR4","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."},{"issue":"1","key":"33_CR5","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1613\/jair.2627","volume":"33","author":"J Goldsmith","year":"2008","unstructured":"Goldsmith, J., Lang, J., Truszczynski, M., Wilson, N.: The computational complexity of dominance and consistency in CP-nets. J. Artif. Intell. Res. 33(1), 403\u2013432 (2008)","journal-title":"J. Artif. Intell. Res."},{"key":"33_CR6","unstructured":"Guerin, J.T.: Graphical Models for Decision Support in Academic Advising. Ph.D. thesis. University of Kentucky (2012)"},{"key":"33_CR7","series-title":"LNCS","first-page":"208","volume-title":"ADT 2013","author":"JT Guerin","year":"2013","unstructured":"Guerin, J.T., Allen, T.E., Goldsmith, J.: Learning CP-net preferences online from user queries. In: Perny, P., Pirlot, M., Tsouki\u00e0s, A. (eds.) ADT 2013. LNCS, vol. 8176, pp. 208\u2013220. Springer, Heidelberg (2013)"},{"key":"33_CR8","volume-title":"Combinatorial Algorithms: Generation, Enumeration, and Search","author":"DL Kreher","year":"1999","unstructured":"Kreher, D.L., Stinson, D.: Combinatorial Algorithms: Generation, Enumeration, and Search. CRC Press, Boca Raton (1999). ISBN 9780849339882"},{"key":"33_CR9","unstructured":"Li, M., Vo, Q.B., Kowalczyk, R.: Efficient heuristic approach to dominance testing in CP-nets. In: Proceedings of AAMAS, pp. 353\u2013360 (2011)"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Santhanam, G.R., Basu, S., Honavar, V.: Dominance testing via model checking. In: AAAI (2010)","DOI":"10.1609\/aaai.v24i1.7599"},{"key":"33_CR11","doi-asserted-by":"publisher","unstructured":"Steinsky, B.: Efficient coding of labeled directed acyclic graphs. Soft Comput. 7(5), 350\u2013356 (2003). doi:10.1007\/s00500-002-0223-5. http:\/\/dx.doi.org\/10.1007\/s00500-002-0223-5. ISSN 1432-7643","DOI":"10.1007\/s00500-002-0223-5"}],"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_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,13]],"date-time":"2023-08-13T12:51:50Z","timestamp":1691931110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23114-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319231136","9783319231143"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23114-3_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"28 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}