{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T18:40:12Z","timestamp":1732905612944,"version":"3.30.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031739026"},{"type":"electronic","value":"9783031739033"}],"license":[{"start":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T00:00:00Z","timestamp":1729036800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,16]],"date-time":"2024-10-16T00:00:00Z","timestamp":1729036800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-73903-3_15","type":"book-chapter","created":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T21:01:53Z","timestamp":1729026113000},"page":"225-240","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Independent Relaxed Subproblems for\u00a0Dominance Testing in\u00a0CP-Nets"],"prefix":"10.1007","author":[{"given":"Liu","family":"Jiang","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-2119-4946","authenticated-orcid":false,"given":"Thomas E.","family":"Allen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,16]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed, S., Mouhoub, M.: A divide and conquer algorithm for dominance testing in acyclic CP-nets. In: Proceedings of the 31st IEEE ICTAI, pp. 392\u2013399 (2019)","DOI":"10.1109\/ICTAI.2019.00062"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"131214","DOI":"10.1109\/ACCESS.2021.3114637","volume":"9","author":"A Alashaikh","year":"2021","unstructured":"Alashaikh, A., Alanazi, E.: Conditional preference networks for cloud service selection and ranking with many irrelevant attributes. IEEE Access 9, 131214\u2013131222 (2021)","journal-title":"IEEE Access"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1613\/jair.5455","volume":"59","author":"TE Allen","year":"2017","unstructured":"Allen, T.E., Goldsmith, J., Justice, H.E., Mattei, N., Raines, K.: Uniform random generation and dominance testing for CP-nets. J. Artif. Intell. Res. 59, 771\u2013813 (2017)","journal-title":"J. Artif. Intell. Res."},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Bistarelli, S., Fioravanti, F., Peretti, P.: Using CP-nets as a guide for countermeasure selection. In: Proceedings of the 2007 ACM SAC, pp. 300\u2013304. ACM (2007)","DOI":"10.1145\/1244002.1244073"},{"key":"15_CR5","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":"15_CR6","doi-asserted-by":"crossref","unstructured":"Cadilhac, A., Asher, N., Benamara, F., Lascarides, A.: Grounding strategic conversation: Using negotiation dialogues to predict trades in a win-lose game. In: Proceedings of the EMNLP 2013, pp. 357\u2013368 (2013)","DOI":"10.18653\/v1\/D13-1035"},{"issue":"2","key":"15_CR7","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s10723-012-9235-2","volume":"11","author":"M Cafaro","year":"2013","unstructured":"Cafaro, M., Mirto, M., Aloisio, G.: Preference-based matchmaking of grid resources with CP-nets. J. Grid Comput. 11(2), 211\u2013237 (2013)","journal-title":"J. Grid Comput."},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Floyd, R.: Algorithm 97: shortest path. Commun. ACM 345 (1962)","DOI":"10.1145\/367766.368168"},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1613\/jair.2627","volume":"33","author":"J Goldsmith","year":"2008","unstructured":"Goldsmith, J., Lang, J., Truszczy\u0144ski, 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":"15_CR10","unstructured":"Knuth, D.E.: The art of computer programming, volume 4, pre-fascicle 12A: components and traversal (2022)"},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/S0004-3702(01)00092-3","volume":"134","author":"RE Korf","year":"2002","unstructured":"Korf, R.E., Felner, A.: Disjoint pattern database heuristics. Artif. Intell. 134(1), 9\u201322 (2002)","journal-title":"Artif. Intell."},{"key":"15_CR12","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1613\/jair.1.11323","volume":"64","author":"K Laing","year":"2019","unstructured":"Laing, K., Thwaites, P.A., Gosling, J.P.: Rank pruning for dominance queries in CP-nets. J. Artif. Intell. Res. 64, 55\u2013107 (2019)","journal-title":"J. Artif. Intell. Res."},{"key":"15_CR13","unstructured":"Li, M., Vo, Q.B., Kowalczyk, R., et\u00a0al.: Efficient heuristic approach to dominance testing in CP-nets. In: AAMAS, pp. 353\u2013360 (2011)"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Loreggia, A., Mattei, N., Rossi, F., Venable, K.B.: Value alignment via tractable preference distance, chap.\u00a018, pp. 249\u2013261. Chapman and Hall\/CRC (2018)","DOI":"10.1201\/9781351251389-18"},{"key":"15_CR15","unstructured":"Pearl, J.: Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley Longman Publishing Co., Inc. (1984)"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Rossi, F., Mattei, N.: Building ethically bounded AI. Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, no. 0101, pp. 9785\u20139789 (2019)","DOI":"10.1609\/aaai.v33i01.33019785"},{"key":"15_CR17","unstructured":"Rossi, F., Venable, K.B., Walsh, T.: mCP nets: representing and reasoning with preferences of multiple agents. In: Proceedings of the 19th AAAI Conference on Artificial Intelligence, pp. 729\u2013734 (2004)"},{"issue":"1","key":"15_CR18","first-page":"42","volume":"36","author":"O Tange","year":"2011","unstructured":"Tange, O.: GNU parallel: the command-line power tool. USENIX Mag. 36(1), 42\u201347 (2011)","journal-title":"USENIX Mag."},{"issue":"2","key":"15_CR19","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R Tarjan","year":"1972","unstructured":"Tarjan, R.: Depth-first search and linear graph algorithms. SIAM J. Comput. 1(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Decision Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-73903-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T18:25:12Z","timestamp":1732904712000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-73903-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,16]]},"ISBN":["9783031739026","9783031739033"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-73903-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,10,16]]},"assertion":[{"value":"16 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ADT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Decision Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Brunswick, NJ","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aldt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/preflib.github.io\/adt2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}