-
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.Conference contribution | http://aclweb.org/anthology/D/D13/D13-1134.pdf | UvA-DAREEngströ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.Conference contribution | https://doi.org/10.1007/978-3-642-39992-3_14 | UvA-DAREEngströ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-DAREEnguehard, 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-DAREEnguehard, 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-DAREEnguehard, 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.Conference contribution | https://doi.org/10.18148/SUB/2024.V28.1123 | UvA-DAREEnqvist, 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.Conference contribution | https://doi.org/10.1109/LICS.2019.8785676 | UvA-DAREEnqvist, 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.Conference contribution | https://doi.org/10.1109/LICS.2015.41 | UvA-DAREEnqvist, 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.Conference contribution | https://doi.org/10.4230/LIPIcs.CSL.2016.7 | UvA-DAREEnqvist, S., Seifan, F., Venema, Y. (2017) An expressive completeness theorem for coalgebraic modal µ-calculi.Logical Methods in Computer Science, Vol. 13Article | https://doi.org/10.23638/LMCS-13(2:14)2017 | UvA-DAREEnqvist, 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-DAREEnqvist, S., Seifan, F., Venema, Y. (2019) Completeness for μ-calculi: A coalgebraic approach.Annals of Pure and Applied Logic, Vol. 170 (pp 578-641)Article | https://doi.org/10.1016/j.apal.2018.12.004 | UvA-DAREEnqvist, S., Venema, Y. (2017) Disjunctive Bases: Normal Forms for Modal Logics.In Bonchi, F. König, B. (Eds.), 7th Conference on Algebra and Coalgebra in Computer Science: CALCO 2017, June 14-16, 2017, Ljubljana, Slovenia (Leibniz International Proceedings in Informatics, Vol. 72). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.Conference contribution | https://doi.org/10.4230/LIPIcs.CALCO.2017.11 | UvA-DAREEnqvist, S., Venema, Y. (2019) Disjunctive bases: normal forms and model theory for modal logics.Logical Methods in Computer Science, Vol. 15Article | https://doi.org/10.23638/LMCS-15(1:30)2019 | UvA-DAREErmakova, L., Azarbonyad, H., Bakker, J., Vendeville, B., Kamps, J. (2025) CLEF 2025 SimpleText Track: Simplify Scientific Text (and Nothing More).In Hauff, C. Macdonald, C. Jannach, D. Kazai, G. Nardini, F.M. Pinelli, F. Silvestri, F. Tonellotto, N. (Eds.), Advances in Information Retrieval: 47th European Conference on Information Retrieval, ECIR 2025, Lucca, Italy, April 6–10, 202 : proceedings (pp 425-433) (Lecture Notes in Computer Science, Vol. 15576). Springer.Conference contribution | https://doi.org/10.1007/978-3-031-88720-8_63 | UvA-DAREErmakova, L., Azarbonyad, Hosein, Bakker, J., Kishore Shahi, Gautam, Vendeville, B., Kamps, J. (2026) SimpleText CLEF 2026 : Simplifier les textes scientifiques (et rien de plus).In Actes de CORIA-TALN 2026. Actes de la 21e Conférence en Recherche d'Information et Applications. Volume 2 : articles déjà publiés (pp 19-20). Association pour le traitement automatique des langues.Conference contribution | https://talnarchives.atala.org/ateliers/2026/CORIA/40023.pdf | UvA-DAREErmakova, L., Azarbonyad, Hosein, Bakker, J., Shahi, Gautam Kishore, Vendeville, B., Kamps, J. (2026) CLEF 2026 SimpleText Track: Simplify Scientific Text (and Nothing More).In Campos, Ricardo Jatowt, Adam Lan, Yanyan Aliannejadi, Mohammad Bauer, Christine MacAvaney, Sean Anand, Avishek Ren, Zhaochun Verberne, Suzan Bai, Nan Mansoury, Masoud (Eds.), Advances in Information Retrieval: 48th European Conference on Information Retrieval, ECIR 2026, Delft, The Netherlands, March 29–April 2, 2026 : proceedings (pp 215-224) (Lecture Notes in Computer Science, Vol. 16486). Springer.Conference contribution | https://doi.org/10.1007/978-3-032-21321-1_31 | UvA-DAREErmakova, L., Azarbonyad, Hosein, Bakker, J., Vendeville, B., Kamps, J. (2025) Simplification de Textes Scientifiques (et Rien de Plus). Rapport sur l'Action CLEF 2025 SimpleText.In Bechet, Frédéric Chifu, Adrian-Gabriel Pinel-sauvagnat, Karen Favre, Benoit Maes, Eliot Nurbakova, Diana (Eds.), Actes de la 20e Conférence en Recherche d'Information et Applications (CORIA) (pp 230-232). ATALA & ARIA.Conference contribution | https://aclanthology.org/2025.jeptalnrecital-coria.20/ | UvA-DAREErmakova, L., Azarbonyad, Hosein, Bakker, J., Vendeville, B., Kamps, J. (2026) Overview of the CLEF 2025 SimpleText Track: Simplify Scientific Text (and Nothing More).In Carrillo-de-Albornoz, Jorge García Seco de Herrera, Alba Gonzalo, Julio Plaza, Laura Mothe, Josiane Piroi, Florina Rosso, Paolo Spina, Damiano Faggioli, Guglielmo Ferro, Nicola (Eds.), Experimental IR Meets Multilinguality, Multimodality, and Interaction: 16th International Conference of the CLEF Association, CLEF 2025, Madrid, Spain, September 9–12, 2025 : proceedings (pp 436-463) (Lecture Notes in Computer Science, Vol. 16089). Springer.Conference contribution | https://doi.org/10.1007/978-3-032-04354-2_23 | UvA-DAREErmakova, L., Bellot, P., Braslavski, P., Kamps, J., Mothe, J., Nurbakova, D., Ovchinnikova, I., San-Juan, E. (2021) Overview of SimpleText CLEF 2021 workshop and pilot tasks.In Faggioli, G. Ferro, N. Joly, A. Maistro, M. Piroi, F. (Eds.), Proceedings of the Working Notes of CLEF 2021 - Conference and Labs of the Evaluation Forum: Bucharest, Romania, September 21st to 24th, 2021 (pp 2212-2227) (CEUR Workshop Proceedings, Vol. 2936). CEUR-WS.Conference contribution | http://ceur-ws.org/Vol-2936/paper-199.pdf | UvA-DAREThe data of this list is taken from the Pure database. If you find output is missing from the list, please follow the previous link to find out how to submit to Pure. In case there are mistakes in PURE, please contact illc at uva.nl