uva.nl

Institute for Logic, Language and Computation

Searchable List of Research Output

Filter Publications
  • 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)
  • Enguehard, E. (2023) Some formal results on the upward-monotonic bias, communicative stability, the strongest answer condition, and exhaustification.
    ILLC, University of Amsterdam.
  • 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
  • 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.
    Conference contribution | https://doi.org/10.1109/LICS.2015.41 | UvA-DARE
  • 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
  • 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)
  • Enqvist, S., Seifan, F., Venema, Y. (2019) Completeness for μ-calculi: A coalgebraic approach.
    Annals of Pure and Applied Logic, Vol. 170 (pp 578-641)
  • Enqvist, 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.
  • Enqvist, S., Venema, Y. (2019) Disjunctive bases: normal forms and model theory for modal logics.
    Logical Methods in Computer Science, Vol. 15
  • Ermakova, 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.
  • Ermakova, L., Bellot, P., Braslavski, P., Kamps, J., Mothe, J., Nurbakova, D., Ovchinnikova, I., SanJuan, E. (2021) Overview of SimpleText 2021 - CLEF Workshop on Text Simplification for Scientific Information Access.
    In Candan, K.S. Ionescu, B. Goeuriot, L. Larsen, B. Müller, H. Joly, A. Maistro, M. Piroi, F. Faggioli, G. Ferro, N. (Eds.), Experimental IR Meets Multilinguality, Multimodality, and Interaction: 12th International Conference of the CLEF Association, CLEF 2021, virtual event, September 21–24, 2021 : proceedings (pp 432-449) (Lecture Notes in Computer Science, Vol. 12880). Springer.
  • Ermakova, L., Bellot, P., Braslavski, P., Kamps, J., Mothe, J., Nurbakova, D., Ovchinnikova, I., SanJuan, E. (2021) Text Simplification for Scientific Information Access: CLEF 2021 SimpleText Workshop.
    In Hiemstra, D. Moens, M.-F. Mothe, J. Perego, R. Potthast, M. Sebastiani, F. (Eds.), Advances in Information Retrieval: 43rd European Conference on IR Research, ECIR 2021, Virtual Event, March 28–April 1, 2021 : proceedings (pp 583-592) (Lecture Notes in Computer Science, Vol. 12657). Springer.
  • Ermakova, L., Bellot, P., Kamps, J., Nurbakova, D., Ovchinnikova, I., SanJuan, E., Mathurin, E., Araújo, S., Hannachi, R., Huet, S., Poinsu, N. (2022) Automatic Simplification of Scientific Texts: SimpleText Lab at CLEF-2022.
    In Hagen, M. Verberne, S. Macdonald, C. Seifert, C. Balog, K. Nørvåg, K. Setty, V. (Eds.), Advances in Information Retrieval: 44th European Conference on IR Research, ECIR 2022, Stavanger, Norway, April 10–14, 2022 : proceedings (pp 364-373) (Lecture Notes in Computer Science, Vol. 13186). Springer.
  • Ermakova, L., Bertin, S., McCombie, H., Kamps, J. (2023) Overview of the CLEF 2023 SimpleText Task 3: Simplification of Scientific Texts.
    In Aliannejadi, M. Faggioli, G. Ferro, N. Vlachos, M. (Eds.), Working Notes of the Conference and Labs of the Evaluation Forum (CLEF 2023): Thessaloniki, Greece, September 18th to 21st, 2023 (pp 2855-2875) (CEUR Workshop Proceedings, Vol. 3497). CEUR-WS.
1 ... 103 104 105 106 107 108 109 110 111 ... 311

The 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