{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T06:10:02Z","timestamp":1748585402282,"version":"3.41.0"},"publisher-location":"Cham","reference-count":35,"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_16","type":"book-chapter","created":{"date-parts":[[2015,8,27]],"date-time":"2015-08-27T09:01:33Z","timestamp":1440666093000},"page":"253-269","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Democratix: A Declarative Approach to Winner Determination"],"prefix":"10.1007","author":[{"given":"G\u00fcnther","family":"Charwat","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Pfandler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,28]]},"reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.mathsocsci.2011.08.008","volume":"64","author":"A Ali","year":"2012","unstructured":"Ali, A., Meila, M.: Experiments with Kemeny ranking: what works when? Math. Soc. Sci. 64(1), 28\u201340 (2012)","journal-title":"Math. Soc. Sci."},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-40564-8_6","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Alviano","year":"2013","unstructured":"Alviano, M., Dodaro, C., Faber, W., Leone, N., Ricca, F.: WASP: a native ASP solver based on constraint learning. In: Cabalar, P., Son, T.C. (eds.) LPNMR 2013. LNCS, vol. 8148, pp. 54\u201366. Springer, Heidelberg (2013)"},{"key":"16_CR3","unstructured":"Bennett, J., Lanning, S.: The Netflix prize. In: Proceedings of KDD Cup and Workshop (2007)"},{"issue":"2","key":"16_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.ic.2009.10.001","volume":"208","author":"N Betzler","year":"2010","unstructured":"Betzler, N., Guo, J., Niedermeier, R.: Parameterized computational complexity of Dodgson and Young elections. Inf. Comput. 208(2), 165\u2013177 (2010)","journal-title":"Inf. Comput."},{"issue":"5","key":"16_CR5","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1007\/s10458-013-9236-y","volume":"28","author":"N Betzler","year":"2014","unstructured":"Betzler, N., Bredereck, R., Niedermeier, R.: Theoretical and empirical evaluation of data reduction for exact Kemeny rank aggregation. Auton. Agent. Multi-Agent Syst. 28(5), 721\u2013748 (2014)","journal-title":"Auton. Agent. Multi-Agent Syst."},{"key":"16_CR6","unstructured":"Bouveret, S.: Whale$$^3$$: Which alternative is elected (2013). http:\/\/whale3.noiraudes.net\/whale3\/"},{"key":"16_CR7","unstructured":"Brandt, F., Geist, C.: Finding strategyproof social choice functions via SAT solving. In: Proceedings of AAMAS 2014, pp. 1193\u20131200. IFAAMAS (2014)"},{"key":"16_CR8","unstructured":"Brandt, F., Chabin, G., Geist, C.: Pnyx: a powerful and user-friendly tool for preference aggregation. In: Proceedings of AAMAS 2015, pp. 1915\u20131916. IFAAMAS (2015)"},{"key":"16_CR9","unstructured":"Bredereck, R.: Fixed-parameter algorithms for computing Kemeny scores - theory and practice. Pre-diploma thesis, Department of Mathematics and Computer Science, University of Jena (2009)"},{"issue":"12","key":"16_CR10","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczy\u0144ski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92\u2013103 (2011)","journal-title":"Commun. ACM"},{"key":"16_CR11","unstructured":"Calimeri, F., Faber, W., Gebser, M., Ianni, G., Kaminski, R., Krennwallner, T., Leone, N., Ricca, F., Schaub, T.: ASP-Core-2: 4th ASP competition official input language format (2013)"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.artint.2012.04.004","volume":"187","author":"I Caragiannis","year":"2012","unstructured":"Caragiannis, I., Covey, J., Feldman, M., Homan, C., Kaklamanis, C., Karanikolas, N., Procaccia, A., Rosenschein, J.: On the approximability of Dodgson and Young elections. Artif. Intell. 187, 31\u201351 (2012)","journal-title":"Artif. Intell."},{"key":"16_CR13","unstructured":"Conitzer, V., Davenport, A., Kalagnanam, J.: Improved bounds for computing Kemeny rankings. In: Proceedings of AAAI 2006, pp. 620\u2013626. AAAI Press (2006)"},{"key":"16_CR14","unstructured":"Davenport, A., Kalagnanam, J.: A computational study of the Kemeny rule for preference aggregation. In: Proceedings of AAAI 2004, pp. 697\u2013702. AAAI Press (2004)"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: Proceedings of WWW 2001, pp. 613\u2013622. ACM (2001)","DOI":"10.1145\/371920.372165"},{"key":"16_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1007\/978-3-642-03754-2_2","volume-title":"Reasoning Web","author":"T Eiter","year":"2009","unstructured":"Eiter, T., Ianni, G., Krennwallner, T.: Answer set programming: a primer. In: Tessaris, S., Franconi, E., Eiter, T., Gutierrez, C., Handschuh, S., Rousset, M.-C., Schmidt, R.A. (eds.) Reasoning Web. LNCS, vol. 5689, pp. 40\u2013110. Springer, Heidelberg (2009)"},{"key":"16_CR17","unstructured":"Gebser, M., Janhunen, T., Rintanen, J.: ASP encodings of acyclicity properties. In: Proceedings of KR 2014. AAAI Press (2014)"},{"key":"16_CR18","series-title":"Synthesis Lectures on Artificial Intelligence and Machine Learning","doi-asserted-by":"publisher","DOI":"10.2200\/S00457ED1V01Y201211AIM019","volume-title":"Answer Set Solving in Practice","author":"M Gebser","year":"2012","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Answer Set Solving in Practice. Synthesis Lectures on Artificial Intelligence and Machine Learning. Morgan and Claypool, San Rafael (2012)"},{"issue":"2","key":"16_CR19","doi-asserted-by":"publisher","first-page":"107","DOI":"10.3233\/AIC-2011-0491","volume":"24","author":"M Gebser","year":"2011","unstructured":"Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T., Schneider, M.: Potassco: the Potsdam answer set solving collection. AI Comm. 24(2), 107\u2013124 (2011)","journal-title":"AI Comm."},{"key":"16_CR20","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."},{"issue":"3\/4","key":"16_CR21","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF03037169","volume":"9","author":"M Gelfond","year":"1991","unstructured":"Gelfond, M., Lifschitz, V.: Classical negation in logic programs and disjunctive databases. New Generat. Comput. 9(3\/4), 365\u2013386 (1991)","journal-title":"New Generat. Comput."},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Ghosh, S., Mundhe, M., Hernandez, K., Sen, S.: Voting for movies: the anatomy of a recommender system. In: Proceedings of Agents 1999, pp. 434\u2013435. ACM (1999)","DOI":"10.1145\/301136.301303"},{"issue":"6","key":"16_CR23","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1145\/268999.269002","volume":"44","author":"E Hemaspaandra","year":"1997","unstructured":"Hemaspaandra, E., Hemaspaandra, L., Rothe, J.: Exact analysis of Dodgson elections: Lewis Carroll\u2019s 1876 voting system is complete for parallel access to NP. J. ACM 44(6), 806\u2013825 (1997)","journal-title":"J. ACM"},{"issue":"3","key":"16_CR24","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.tcs.2005.08.031","volume":"349","author":"E Hemaspaandra","year":"2005","unstructured":"Hemaspaandra, E., Spakowski, H., Vogel, J.: The complexity of Kemeny elections. Theor. Comput. Sci. 349(3), 382\u2013391 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR25","unstructured":"Konczak, K.: Voting theory in answer set programming. In: Proceedings of WLP 2006. INFSYS Research Report, vol. 1843\u201306-02, pp. 45\u201353. Technische Universit\u00e4t Wien (2006)"},{"issue":"3","key":"16_CR26","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1145\/1149114.1149117","volume":"7","author":"N Leone","year":"2006","unstructured":"Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., Scarcello, F.: The DLV system for knowledge representation and reasoning. ACM Trans. Comput. Log. 7(3), 499\u2013562 (2006)","journal-title":"ACM Trans. Comput. Log."},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Mao, A., Procaccia, A., Chen, Y.: Better human computation through principled voting. In: Proceedings of AAAI 2013, pp. 1142\u20131148. AAAI Press (2013)","DOI":"10.1609\/aaai.v27i1.8460"},{"key":"16_CR28","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-41575-3_20","volume-title":"Algorithmic Decision Theory","author":"N Mattei","year":"2013","unstructured":"Mattei, N., Walsh, T.: PrefLib: a library for preferences. In: Perny, P., Pirlot, M., Tsouki\u00e0s, A. (eds.) ADT 2013. LNCS (LNAI), vol. 8176, pp. 259\u2013270. Springer, Heidelberg (2013)"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Narodytska, N., Walsh, T., Xia, L.: Combining voting rules together. In: Proceedings of ECAI 2012. FAIA, vol. 242, pp. 612\u2013617. IOS Press (2012)","DOI":"10.3233\/978-1-61499-098-7-612"},{"issue":"3\u20134","key":"16_CR30","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I.: Logic programming with stable model semantics as a constraint programming paradigm. Ann. Math. Artif. Intell. 25(3\u20134), 241\u2013273 (1999)","journal-title":"Ann. Math. Artif. Intell."},{"key":"16_CR31","unstructured":"O\u2019Neill, J.: www.OpenSTV.org (2013)"},{"issue":"03","key":"16_CR32","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1017\/S147106841100007X","volume":"12","author":"F Ricca","year":"2012","unstructured":"Ricca, F., Grasso, G., Alviano, M., Manna, M., Lio, V., Iiritano, S., Leone, N.: Team-building with answer set programming in the Gioia-Tauro seaport. Theor. Pract. Log. Prog. 12(03), 361\u2013381 (2012)","journal-title":"Theor. Pract. Log. Prog."},{"issue":"4","key":"16_CR33","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s00224-002-1093-z","volume":"36","author":"J Rothe","year":"2003","unstructured":"Rothe, J., Spakowski, H., Vogel, J.: Exact complexity of the winner problem for Young elections. Theor. Comput. Syst. 36(4), 375\u2013386 (2003)","journal-title":"Theor. Comput. Syst."},{"key":"16_CR34","unstructured":"Simjour, N.: Parameterized enumeration of neighbour strings and Kemeny aggregations. Ph.D. thesis, University of Waterloo (2013)"},{"issue":"11","key":"16_CR35","doi-asserted-by":"publisher","first-page":"1041","DOI":"10.1016\/j.artint.2009.02.005","volume":"173","author":"P Tang","year":"2009","unstructured":"Tang, P., Lin, F.: Computer-aided proofs of Arrow\u2019s and other impossibility theorems. Artif. Intell. 173(11), 1041\u20131053 (2009)","journal-title":"Artif. Intell."}],"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_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,30]],"date-time":"2025-05-30T05:34:16Z","timestamp":1748583256000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-23114-3_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319231136","9783319231143"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23114-3_16","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"}}]}}