Endriss, U. (2013) Recent Developments in Collective Decision Making in Combinatorial Domains.

In Bonizzoni, P. Brattka, V. Löwe, B. (Eds.), The Nature of Computation : Logic, Algorithms, Applications: 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013 : proceedings (pp 123) (Lecture Notes in Computer Science, Vol. 7921). Springer.

Endriss, U. (2013) Computational Social Choice (with a Special Emphasis on the Use of Logic).

In Bezhanishvili, G. Löbner, S. Marra, V. Richter, F. (Eds.), Logic, Language and Computation: 9th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2011, Kutaisi, Georgia, September 26-30, 2011 : revised selected papers (pp 1-3) (Lecture Notes in Computer Science
FoLLI Publications on Logic, Language and Information, Vol. 7758). Springer.

Endriss, U. (2013) Sincerity and Manipulation under Approval Voting.

Theory and Decision, Vol. 74 (pp 335-355)

Article | https://doi.org/10.1007/s11238-012-9301-z | UvA-DARE

Endriss, U. (2014) Social Choice Theory as a Foundation for Multiagent Systems.

In Müller, J.P. Weyrich, M. Bazzan, A.L.C. (Eds.), Multiagent System Technologies: 12th German Conference, MATES 2014, Stuttgart, Germany, September 23-25, 2014 : proceedings (pp 1-6) (Lecture Notes in Computer Science
Lecture Notes in Artificial Intelligence, Vol. 8732). Springer.

Endriss, U. (2016) Judgment Aggregation.

In Brandt, F. Conitzer, V. Endriss, U. Lang, J. Procaccia, A.D. (Eds.), Handbook of Computational Social Choice (pp 399-426). Cambridge University Press.

Endriss, U. (2017) Trends in Computational Social Choice.

AI Access Foundation.

Book (Editorship) | UvA-DARE

Endriss, U. (2018) Judgment Aggregation with Rationality and Feasibility Constraints.

In Dastani, M. Sukthankar, G. André, E. Koenig, S. (Eds.), AAMAS '18: proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems : July 10-15, 2018, Stockholm, Sweden (pp 946-954). International Foundation for Autonomous Agents and Multiagent Systems.

Endriss, U. (2020) Analysis of One-to-One Matching Mechanisms via SAT Solving: Impossibilities for Universal Axioms.

In AAAI-20, IAAI-20, EAAI-20 proceedings: Thirty-Fourth AAAI Conference on Artificial Intelligence, Thirty-Second Conference on Innovative Applications of Artificial Intelligence, The Tenth Symposium on Educational Advances in Artificial Intelligence : February 7–12th, 2020, New York Hilton Midto (pp 1918-1925) (Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 34). AAAI Press.

Endriss, U. (2020) Collective Information.

In AAAI-20, IAAI-20, EAAI-20 proceedings: Thirty-Fourth AAAI Conference on Artificial Intelligence, Thirty-Second Conference on Innovative Applications of Artificial Intelligence, The Tenth Symposium on Educational Advances in Artificial Intelligence : February 7–12th, 2020, New York Hilton Midto (pp 13520-13524) (Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 34). AAAI Press.

Engonopoulos, N., Villalba, M., Titov, I., Koller, A. (2013) Predicting the Resolution of Referring Expressions from User Behavior.

In Yarowsky, D. Baldwin, T. Korhonen, A. Livescu, K. Bethard, S. (Eds.), EMNLP 2013 : 2013 Conference on Empirical Methods in Natural Language Processing: proceedings of the conference : 18-21 October 2013, Grand Hyatt Seattle, Seattle, Washington, USA (pp 1354-1359). The Association for Computational Linguistics.

Engström, F., Kontinen, J., Väänänen, J. (2013) Dependence logic with generalized quantifiers: Axiomatizations.

In Libkin, L. Kohlenbach, U. de Queiroz, R. (Eds.), Logic, Language, Information, and Computation: 20th International Workshop, WoLLIC 2013, Darmstadt, Germany, August 20-23, 2013 : proceedings (pp 138-152) (Lecture Notes in Computer Science
FoLLI Publications on Logic, Language and Information, Vol. 8071). Springer.

Engström, F., Kontinen, J., Väänänen, J. (2017) Dependence logic with generalized quantifiers: Axiomatizations.

Journal of Computer and System Sciences, Vol. 88 (pp 90-102)

Article | https://doi.org/10.1016/j.jcss.2017.03.010 | UvA-DARE

Enguehard, E. (2023) Some formal results on the upward-monotonic bias, communicative stability, the strongest answer condition, and exhaustification.

ILLC, University of Amsterdam.

Working paper | https://ling.auf.net/lingbuzz/007288 | UvA-DARE

Enguehard, E. (2023) Fine-grained yet flat: on the usefulness of dynamic representations for questions.

Theoretical Linguistics, Vol. 49 (pp 127-138)

Comment/Letter to the editor | https://doi.org/10.1515/tl-2023-2006 | UvA-DARE

Enguehard, E. (2024) What number marking on indefinites means: conceivability presuppositions and sensitivity to probabilities.

In Baumann, G. Gutzmann, D. Koopman, J. Liefke, K. Renans, A. Scheffler, T. (Eds.), Proceedings of Sinn und Bedeutung 28 (pp 289-302). Ruhr-University Bochum.

Enqvist, S., Hansen, H.H., Kupke, C., Marti, J., Venema, Y. (2019) Completeness for game logic.

In 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2019): Vancouver, British Columbia, Canada, 24-27 June 2019 (pp 307-319). IEEE.

Enqvist, S., Seifan, F., Venema, Y. (2015) Monadic Second-Order Logic and Bisimulation Invariance for Coalgebras.

In Proceedings, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science: LICS 2015: 6-10 July 2015, Kyoto, Japan (pp 353-365). IEEE Computer Society.

Enqvist, S., Seifan, F., Venema, Y. (2016) Completeness for Coalgebraic Fixpoint Logic.

In Regnier, L. Talbot, J.-M. (Eds.), Computer Science Logic: CSL 2016, August 29 to September 1, 2016, Marseille, France (Leibniz International Proceedings in Informatics, Vol. 62). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.

Enqvist, S., Seifan, F., Venema, Y. (2017) An expressive completeness theorem for coalgebraic modal µ-calculi.

Logical Methods in Computer Science, Vol. 13

Article | https://doi.org/10.23638/LMCS-13(2:14)2017 | UvA-DARE

Enqvist, S., Seifan, F., Venema, Y. (2018) Completeness for the modal μ-calculus: Separating the combinatorics from the dynamics.

Theoretical Computer Science, Vol. 727 (pp 37-100)

Article | https://doi.org/10.1016/j.tcs.2018.03.001 | UvA-DARE