{"type":"ScholarlyArticle","title":"Answer Set Programming for Judgment Aggregation","authors":[{"name":"Ronald de Haan","slug":"ronald-de-haan","given":"Ronald","family":"de Haan","affiliation":"Institute for Logic, Language and Computation (ILLC) , University of Amsterdam"},{"name":"Marija Slavkovik","slug":"marija-slavkovik","given":"Marija","family":"Slavkovik","affiliation":"University of Bergen"}],"abstract":"Judgment aggregation (JA) studies how to aggregate truth valuations on logically related issues. Computing the outcome of aggregation procedures is notoriously computationally hard, which is the likely reason that no implementation of them exists as of yet. However, even hard problems sometimes need to be solved. The worst-case computational complexity of answer set programming (ASP) matches that of most problems in judgment aggregation. We take advantage of this and propose a natural and modular encoding of various judgment aggregation procedures and related problems in JA into ASP. With these encodings, we achieve two results: (1) paving the way towards constructing a wide range of new benchmark instances (from JA) for answer set solving algorithms; and (2) providing an automated tool for researchers in the area of judgment aggregation.","doi":"10.24963/ijcai.2019/231","url":"https://ijcai.org/proceedings/2019/231","pdf":"https://ijcai.org/proceedings/2019/0231.pdf","markdown":"https://ijcai.org/proceedings/2019/231.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/231","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Knowledge Representation and Reasoning","track":"Main track","number":231,"pages":{"first":1668,"last":1674},"keywords":["Knowledge Representation and Reasoning: Knowledge Representation and  Game Theory ; Social Choice","Agent-based and Multi-agent Systems: Computational Social Choice"],"videos":[],"references":[{"position":1,"raw":"agent (vrt(X)) :-assign (X), lit(X).","title":"agent (vrt(X)) :-assign (X)","authors":null,"year":null,"venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"js(vrt(Y),X) :-agent (vrt(Y)), lit(X), assign (X), Y != X. References [Baumeister et al., 2013]","title":"X) :-agent (vrt(Y)), lit(X), assign","authors":null,"year":"2013","venue":null,"doi":null,"url":"js","internal_url":null},{"position":3,"raw":"D. Baumeister, G. Erdélyi, O.J. Erdélyi, and J. Rothe. Computational aspects of manipula- tion and control in judgment aggregation. In Proceedings of ADT'13, pages 71-85, 2013.","title":"Computational aspects of manipulation and control in judgment aggregation","authors":"D Baumeister, G Erdélyi, O J Erdélyi, J Rothe","year":"2013","venue":"Proceedings of ADT'13","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Baumeister et al., 2015] D. Baumeister, G. Erdélyi, O.J. Erdélyi, and J. Rothe. Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules. Mathematical Social Sciences, 76:19-30, 2015.","title":"Complexity of manipulation and bribery in judgment aggregation for uniform premise-based quota rules","authors":"D Baumeister, G Erdélyi, O J Erdélyi, J Rothe","year":"2015","venue":"Mathematical Social Sciences","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Biere et al., 2009] A. Biere, M. Heule, H. van Maaren, and T. Walsh, editors. Handbook of Satisfiability, volume 185. IOS Press, 2009.","title":"Handbook of Satisfiability","authors":null,"year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Botan et al., 2016] S. Botan, A. Novaro, and U. Endriss. Group manipulation in judgment aggregation. In Proceed- ings of AAMAS'16, pages 411-419, 2016.","title":"Group manipulation in judgment aggregation","authors":"S Botan, A Novaro, U Endriss","year":"2016","venue":"Proceedings of AAMAS'16","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Calimeri et al., 2013] F. Calimeri, W. Faber, M. Gebser, G. Ianni, R. Kaminski, T. Krennwallner, N. Leone, F. Ricca, and T. Schaub. ASP-Core-2: 4th ASP competition official input language format, 2013. https://www.mat.unical.it/ aspcomp2013/files/ASP-CORE-2.01c.pdf.","title":"ASP-Core-2: 4th ASP competition official input language format","authors":"F Calimeri, W Faber, M Gebser, G Ianni, R Kaminski, T Krennwallner, N Leone, F Ricca, T Schaub","year":"2013","venue":null,"doi":null,"url":"https://www.mat.unical.it/aspcomp2013/files/ASP-CORE-2.01c.pdf","internal_url":null},{"position":8,"raw":"[Charwat and Pfandler, 2015] G. Charwat and A. Pfandler. Democratix: A declarative approach to winner determi- nation. In T. Walsh, editor, Algorithmic Decision Theory, pages 253-269. Springer, 2015.","title":"Democratix: A declarative approach to winner determination","authors":"G Charwat, A Pfandler","year":"2015","venue":"Algorithmic Decision Theory","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Dokow and Holzman, 2010] E. Dokow and R. Holzman. Ag- gregation of binary evaluations. J. Economic Theory, 145(2):495-511, 2010.","title":"Aggregation of binary evaluations","authors":"E Dokow, R Holzman","year":"2010","venue":"J. Economic Theory","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Eiter and Gottlob, 1995] T. Eiter and G. Gottlob. On the computational cost of disjunctive logic programming: propositional case. Annals of Mathematics and Artificial Intelligence, 15(3-4):289-323, 1995.","title":"On the computational cost of disjunctive logic programming: propositional case","authors":"T Eiter, G Gottlob","year":"1995","venue":"Annals of Mathematics and Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Endriss and de Haan, 2015] U. Endriss and R. de Haan. Complexity of the winner determination problem in judg- ment aggregation: Kemeny, Slater, Tideman, Young. In Proceedings of AAMAS'15, pages 117-125, 2015.","title":"Complexity of the winner determination problem in judgment aggregation: Kemeny, Slater, Tideman, Young","authors":"U Endriss, R De Haan","year":"2015","venue":"Proceedings of AAMAS'15","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Endriss and Grandi, 2017] U. Endriss and U. Grandi. Graph aggregation. Artificial Intelligence, 245:86-114, 2017.","title":"Graph aggregation","authors":"U Endriss, U Grandi","year":"2017","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Endriss et al., 2012] Ulle Endriss, Umberto Grandi, and Daniele Porello. Complexity of judgment aggregation. J. Artif. Intell. Res., 45:481-514, 2012.","title":"Complexity of judgment aggregation","authors":"Ulle Endriss, Umberto Grandi, Daniele Porello","year":"2012","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Endriss et al., 2016] U. Endriss, U. Grandi, R. de Haan, and J. Lang. Succinctness of languages for judgment aggrega- tion. In KR'16, pages 176-186, 2016.","title":"Succinctness of languages for judgment aggregation","authors":"U Endriss, U Grandi, R De Haan, J Lang","year":"2016","venue":"KR'","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Endriss, 2018] U. Endriss. Judgment aggregation with ratio- nality and feasibility constraints. In Proceedings of AAMAS' 18, pages 946-954, 2018.","title":"Judgment aggregation with rationality and feasibility constraints","authors":"U Endriss","year":"2018","venue":"Proceedings of AAMAS' 18","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Gebser et al., 2011a] M. Gebser, R. Kaminski, and T. Schaub. Complex optimization in answer set program- ming. TPLP, 11(4-5):821-839, 2011.","title":"Complex optimization in answer set programming","authors":"Gebser","year":"2011","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Gebser et al., 2011b] M. Gebser, B. Kaufmann, R. Kamin- ski, M. Ostrowski, T. Schaub, and M. Schneider. Potassco: The potsdam answer set solving collection. AI Communi- cations, 24(2):107-124, April 2011.","title":"Potassco: The potsdam answer set solving collection","authors":"Gebser","year":"2011","venue":"AI Communications","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Gebser et al., 2017] M. Gebser, R. Kaminski, B. Kaufmann, M. Lindauer, Ostrowski. M, J. Romero, T. Schaub, and S Schiele. Potassco user guide (v2.1.0). https://github.com/ potassco/guide/releases/tag/v2.1.0, 2017.","title":"Potassco user guide","authors":"M Gebser, R Kaminski, B Kaufmann, M Lindauer, J M Ostrowski, T Romero, Schaub, Schiele","year":null,"venue":null,"doi":null,"url":"https://github.com/potassco/guide/releases/tag/v2.1.0,2017","internal_url":null},{"position":19,"raw":"[Gebser et al., 2018] M. Gebser, N. Leone, M. Maratea, S. Perri, F. Ricca, and T. Schaub. Evaluation techniques and systems for answer set programming: a survey. In Proceedings of IJCAI'18, pages 5450-5456, 7 2018.","title":"Evaluation techniques and systems for answer set programming: a survey","authors":"M Gebser, N Leone, M Maratea, S Perri, F Ricca, T Schaub","year":"2018","venue":"Proceedings of IJCAI'18","doi":null,"url":null,"internal_url":"/proceedings/2018/769"},{"position":20,"raw":"[Grossi and Pigozzi, 2014] D. Grossi and G. Pigozzi. Judg- ment Aggregation: A Primer. Morgan and Claypool, 2014.","title":"Judgment Aggregation: A Primer","authors":"D Grossi, G Pigozzi","year":"2014","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[de Haan and Slavkovik, 2017] R. de Haan and M. Slavkovik. Complexity results for aggregating judgments using scor- ing or distance-based procedures. In Proceedings of AA- MAS'17, 2017.","title":"Complexity results for aggregating judgments using scoring or distance-based procedures","authors":"R De Haan, M Slavkovik","year":"2017","venue":"Proceedings of AA-MAS'17","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[de Haan, 2016] R. de Haan. Parameterized complexity re- sults for the kemeny rule in judgment aggregation. In Proceedings of ECAI'16, volume 285, pages 1502-1510, 2016.","title":"Parameterized complexity results for the kemeny rule in judgment aggregation","authors":"R De Haan","year":"2016","venue":"Proceedings of ECAI'16","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[de Haan, 2017] R. de Haan. Complexity results for manipu- lation, bribery and control of the kemeny judgment aggre- gation procedure. In Proceedings of AAMAS'17, 2017.","title":"Complexity results for manipulation, bribery and control of the kemeny judgment aggregation procedure","authors":"R De Haan","year":"2017","venue":"Proceedings of AAMAS'17","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[de Haan, 2018] R. de Haan. Hunting for tractable languages for judgment aggregation. In Proceedings of KR'18. AAAI Press, 2018.","title":"Hunting for tractable languages for judgment aggregation","authors":"R De Haan","year":"2018","venue":"Proceedings of KR'18","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Jamroga and Slavkovik, 2013] W. Jamroga and M. Slavkovik. Some complexity results for distance-based judgment aggregation. In LNCS Proceedings PRIMA'13, pages 313-325, 2013.","title":"Some complexity results for distance-based judgment aggregation","authors":"W Jamroga, M Slavkovik","year":"2013","venue":"LNCS Proceedings PRIMA'13","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Konczak, 2006] K. Konczak. Voting theory in answer set programming. In WLP, volume 1843-06-02 of INFSYS Re- search Report, pages 45-53. Technische Universität Wien, Austria, 2006.","title":"Voting theory in answer set programming","authors":"K Konczak","year":"2006","venue":"-06-02 of INFSYS Research Report","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Lang and Slavkovik, 2013] J. Lang and M. Slavkovik. Judg- ment aggregation rules and voting rules. In Proceedings of ADT'13, volume 8176 of LNAI, pages 230-244. Springer, 2013.","title":"Judgment aggregation rules and voting rules","authors":"J Lang, M Slavkovik","year":"2013","venue":"Proceedings of ADT'13","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Lang and Slavkovik, 2014] J. Lang and M. Slavkovik. How hard is it to compute majority-preserving judgment aggrega- tion rules? In Proceedings of ECAI'14, volume 263, pages 501-506, 2014.","title":"How hard is it to compute majority-preserving judgment aggregation rules?","authors":"J Lang, M Slavkovik","year":"2014","venue":"Proceedings of ECAI'14","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Lang and Xia, 2016] J. Lang and L. Xia. Voting in combi- natorial domains. In F. Brandt, V. Conitzer, U. Endriss, J. Lang, and A. Procaccia, editors, Handbook of Compu- tational Social Choice. Cambridge University Press, Cam- bridge, 2016.","title":"Voting in combinatorial domains","authors":"J Lang, L Xia","year":"2016","venue":"Handbook of Computational Social Choice","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Lang et al., 2016] J. Lang, M. Slavkovik, and S. Vesic. Agenda separability in judgment aggregation. In Proceed- ings of AAAI'16, pages 1016-1022, 2016.","title":"Agenda separability in judgment aggregation","authors":"J Lang, M Slavkovik, S Vesic","year":"2016","venue":"Proceedings of AAAI'16","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Lang et al., 2017] J. Lang, G. Pigozzi., M. Slavkovik, L. van der Torre, and S. Vesic. A partial taxonomy of judgment aggregation rules and their properties. Social Choice and Welfare, 48(2):327-356, 2017.","title":"A partial taxonomy of judgment aggregation rules and their properties","authors":"J Lang, G Pigozzi, M Slavkovik, L Van Der Torre, S Vesic","year":"2017","venue":"Social Choice and Welfare","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Slavkovik, 2016] M. Slavkovik. An introductory course to judgment aggregation. CoRR, abs/1607.03307, 2016.","title":"An introductory course to judgment aggregation","authors":"M Slavkovik","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}