{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,14]],"date-time":"2025-12-14T15:58:00Z","timestamp":1765727880558,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030337919"},{"type":"electronic","value":"9783030337926"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-33792-6_24","type":"book-chapter","created":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T19:03:55Z","timestamp":1572030235000},"page":"387-404","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Non-monotonic Collective Decisions"],"prefix":"10.1007","author":[{"given":"Matteo","family":"Cristani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Olivieri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guido","family":"Governatori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,21]]},"reference":[{"issue":"1","key":"24_CR1","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1093\/logcom\/12.1.13","volume":"12","author":"H Andr\u00e9ka","year":"2002","unstructured":"Andr\u00e9ka, H., Ryan, M., Schobbens, P.Y.: Operators and laws for combining preference relations. J. Logic Comput. 12(1), 13\u201353 (2002)","journal-title":"J. Logic Comput."},{"issue":"2","key":"24_CR2","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1145\/371316.371517","volume":"2","author":"G Antoniou","year":"2001","unstructured":"Antoniou, G., Billington, D., Governatori, G., Maher, M.J.: Representation results for defeasible logic. ACM Trans. Comput. Logic 2(2), 255\u2013287 (2001)","journal-title":"ACM Trans. Comput. Logic"},{"issue":"4","key":"24_CR3","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1086\/256963","volume":"58","author":"KJ Arrow","year":"1950","unstructured":"Arrow, K.J.: A difficulty in the concept of social welfare. J. Polit. Econ. 58(4), 328\u2013346 (1950)","journal-title":"J. Polit. Econ."},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-540-69507-3_4","volume-title":"SOFSEM 2007: Theory and Practice of Computer Science","author":"Y Chevaleyre","year":"2007","unstructured":"Chevaleyre, Y., Endriss, U., Lang, J., Maudet, N.: A short introduction to computational social choice. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Pl\u00e1\u0161il, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 51\u201369. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-69507-3_4"},{"issue":"4","key":"24_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1609\/aimag.v29i4.2201","volume":"29","author":"Y Chevaleyre","year":"2008","unstructured":"Chevaleyre, Y., Endriss, U., Lang, J., Maudet, N.: Preference handling in combinatorial domains: from AI to social choice. AI Mag. 29(4), 37\u201346 (2008)","journal-title":"AI Mag."},{"doi-asserted-by":"publisher","unstructured":"Conitzer, V., Sandholm, T., Lang, J.: When are elections with few candidates hard to manipulate?. J. ACM 54(3) (2007). https:\/\/doi.org\/10.1145\/1236457.1236461 . ISSN 0004-5411","key":"24_CR6","DOI":"10.1145\/1236457.1236461"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.knosys.2013.09.021","volume":"58","author":"Y Dong","year":"2014","unstructured":"Dong, Y., Zhang, H.: Multiperson decision making with different preference representation structures: a direct consensus framework and its properties. Knowl.-Based Syst. 58, 45\u201357 (2014)","journal-title":"Knowl.-Based Syst."},{"doi-asserted-by":"crossref","unstructured":"Endriss, U.: Judgment aggregation (2016)","key":"24_CR8","DOI":"10.1017\/CBO9781107446984.018"},{"issue":"3","key":"24_CR9","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1016\/j.fss.2005.05.001","volume":"155","author":"L Fono","year":"2005","unstructured":"Fono, L., Andjiga, N.: Fuzzy strict preference and social choice. Fuzzy Sets Syst. 155(3), 372\u2013389 (2005)","journal-title":"Fuzzy Sets Syst."},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1613\/jair.3126","volume":"40","author":"C Geist","year":"2011","unstructured":"Geist, C., Endriss, U.: Automated search for impossibility theorems in social choice theory: ranking sets of objects. J. Artif. Intell. Res. 40, 143\u2013174 (2011)","journal-title":"J. Artif. Intell. Res."},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.ijar.2018.10.020","volume":"104","author":"G Governatori","year":"2019","unstructured":"Governatori, G., Olivieri, F., Cristani, M., Scannapieco, S.: Revision of defeasible preferences. Int. J. Approximate Reasoning 104, 205\u2013230 (2019)","journal-title":"Int. J. Approximate Reasoning"},{"key":"24_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-319-09870-8_12","volume-title":"Rules on the Web. From Theory to Applications","author":"G Governatori","year":"2014","unstructured":"Governatori, G., Olivieri, F., Scannapieco, S., Cristani, M.: The hardness of revising defeasible preferences. In: Bikakis, A., Fodor, P., Roman, D. (eds.) RuleML 2014. LNCS, vol. 8620, pp. 168\u2013177. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09870-8_12"},{"issue":"3","key":"24_CR13","first-page":"296","volume":"16","author":"G Governatori","year":"2016","unstructured":"Governatori, G., Olivieri, F., Scannapieco, S., Rotolo, A., Cristani, M.: The rationale behind the concept of goal. TPLP 16(3), 296\u2013324 (2016)","journal-title":"TPLP"},{"issue":"3","key":"24_CR14","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1016\/S0377-2217(03)00369-2","volume":"158","author":"G Munda","year":"2004","unstructured":"Munda, G.: Social multi-criteria evaluation: methodological foundations and operational consequences. Eur. J. Oper. Res. 158(3), 662\u2013677 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"24_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/978-3-319-25524-8_43","volume-title":"PRIMA 2015: Principles and Practice of Multi-Agent Systems","author":"F Olivieri","year":"2015","unstructured":"Olivieri, F., Cristani, M., Governatori, G.: Compliant business processes with exclusive choices from agent specification. In: Chen, Q., Torroni, P., Villata, S., Hsu, J., Omicini, A. (eds.) PRIMA 2015. LNCS (LNAI), vol. 9387, pp. 603\u2013612. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25524-8_43"},{"issue":"3","key":"24_CR16","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1093\/logcom\/exn012","volume":"19","author":"M Pini","year":"2009","unstructured":"Pini, M., Rossi, F., Venable, K., Walsh, T.: Aggregating partially ordered preferences. J. Logic Comput. 19(3), 475\u2013502 (2009)","journal-title":"J. Logic Comput."},{"key":"24_CR17","series-title":"Synthesis Lectures on Artificial Intelligence and Machine Learning","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-031-01556-4","volume-title":"A Short Introduction to Preferences. Between Artificial Intelligence and Social Choice","author":"F Rossi","year":"2011","unstructured":"Rossi, F., Venable, K., Walsh, T.: A Short Introduction to Preferences. Between Artificial Intelligence and Social Choice. Synthesis Lectures on Artificial Intelligence and Machine Learning, vol. 14, pp. 1\u2013102. Morgan & Claypool Publishers, San Rafael (2011)"},{"issue":"8","key":"24_CR18","doi-asserted-by":"publisher","first-page":"2027","DOI":"10.1016\/j.cor.2004.01.005","volume":"32","author":"YM Wang","year":"2005","unstructured":"Wang, Y.M., Yang, J.B., Xu, D.L.: A preference aggregation method through the estimation of utility intervals. Comput. Oper. Res. 32(8), 2027\u20132049 (2005)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"24_CR19","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.artint.2008.11.005","volume":"173","author":"M Zuckerman","year":"2009","unstructured":"Zuckerman, M., Procaccia, A., Rosenschein, J.: Algorithms for the coalitional manipulation problem. Artif. Intell. 173(2), 392\u2013412 (2009)","journal-title":"Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","PRIMA 2019: Principles and Practice of Multi-Agent Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-33792-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,2]],"date-time":"2022-10-02T17:21:31Z","timestamp":1664731291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-33792-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030337919","9783030337926"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-33792-6_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PRIMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Multi-Agent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"prima2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/prima2019.di.unito.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"112","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}