-
Kuijper, W., Viana, J.P. (2003) An application of sahlqvist theory to bisorted modal logic.In ten Cate, B.D. (Eds.), Proceedings of the 8th ESSLLI Student Section (pp 149-158). ESSLLI.Conference contribution | UvA-DAREKuiper, Leanne, Orken, Ada, Burgoyne, J.A. (2021) It's Beginning to Sound a Lot Like Christmas: Exploring Short- and Long-Term Memory of Christmas Music through an Online Game.Paper | UvA-DAREKumpulainen, S., Huurdeman, H. (2015) Shaken, Not Steered: The Value of Shaking Up the Search Process.In Gäde, M. Hall, M.M. Huurdeman, H. Kamps, J. Koolen, M. Skov, M. Toms, E. Walsh, D. (Eds.), Proceedings of the First International Workshop on Supporting Complex Search Tasks: co-located with the 37th European Conference on Information Retrieval (ECIR 2015) : Vienna, Austria, March 29, 2015 (CEUR Workshop Proceedings, Vol. 1338). CEUR-WS.Conference contribution | http://ceur-ws.org/Vol-1338/paper_7.pdf | UvA-DAREKunert, R., Fernández, R., Zuidema, W. (2011) Adaptation in Child Directed Speech: Evidence from Corpora.In Artstein, R. Core, M. DeVault, D. Georgila, K. Kaiser, E. Stent, A. (Eds.), SemDial 2011 (Los Angelogue): Proceedings of the 15th Workshop on the Semantics and Pragmatics of Dialogue : September 21-23, 2011, Los Angeles, California (pp 112-119) (Proceedings SemDial, Vol. 2011). Institute for Creative Technologies, University of Southern California.Conference contribution | UvA-DAREKupke, C., Kurz, A., Pattinson, D. (2004) Algebraic Semantics for Coalgebraic Logics.Electronic Notes in Theoretical Computer Science, Vol. 106 (pp 219-241)Article | https://doi.org/10.1016/j.entcs.2004.02.037 | UvA-DAREKupke, C., Kurz, A., Pattinson, D. (2005) Ultrafilter extensions for coalgebras.In Fiadeiro, J.L. Harman, N. Roggenbach, M. Rutten, J. (Eds.), Algebra and Coalgebra in Computer Science: First International Conference, CALCO 2005, Swansea, UK, September 3-6, 2005. Proceedings (pp 263-277) (Lecture Notes in Computer Science, Vol. 3629). Springer.Conference contribution | https://doi.org/10.1007/11548133_17 | UvA-DAREKupke, C., Kurz, A., Venema, Y. (2008) Completeness of the finitary Moss logic.In Areces, C. Goldblatt, R. (Eds.), Advances in Modal Logic 7 (pp 193-217). College Publications.Conference contribution | http://www.aiml.net/volumes/volume7/Kupke-Kurz-Venema.pdf | UvA-DAREKupke, C., Kurz, A., Venema, Y. (2012) Completeness for the coalgebraic cover modality.Logical Methods in Computer Science, Vol. 8Article | https://doi.org/10.2168/LMCS-8(3:2)2012 | UvA-DAREKupke, C., Marti, J., Venema, Y. (2021) On the size of disjunctive formulas in the µ-calculus.Electronic Proceedings in Theoretical Computer Science, Vol. 346 (pp 291-307)Article | https://doi.org/10.4204/EPTCS.346.19 | UvA-DAREKupke, C., Marti, J., Venema, Y. (2022) Succinct Graph Representations of µ-Calculus Formulas.In Manea, F. Simpson, A. (Eds.), 30th EACSL Annual Conference on Computer Science Logic: CSL 2022, February 14–19, 2022, Göttingen, Germany (Virtual Conference) (Leibniz International Proceedings in Informatics, Vol. 216). Schloss Dagstuhl - Leibniz-Zentrum für Informatik.Conference contribution | https://doi.org/10.4230/LIPIcs.CSL.2022.29 | UvA-DAREKupke, C., Marti, J., Venema, Y. (2022) Size measures and alphabetic equivalence in the µ-calculus.In Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science. The Association for Computing Machinery.Conference contribution | https://doi.org/10.1145/3531130.3533339 | UvA-DAREKupke, C., Venema, Y. (2008) Coalgebraic automata theory: Basic results.Logical Methods in Computer Science, Vol. 4Article | https://doi.org/10.2168/LMCS-4(4:10)2008 | UvA-DAREKupke, C.A., Kurz, A., Venema, Y. (2003) Stone coalgebras.Technical Reports. Institute for Logic, Language and Computation.Working paper | UvA-DAREKupke, C.A., Kurz, A., Venema, Y. (2004) Stone Coalgebras.Theoretical Computer Science, Vol. 327 (pp 109-134)Article | https://doi.org/10.1016/j.tcs.2004.07.023 | UvA-DAREKupke, C.A., Venema, Y. (2005) Closure properties of coalgebra automata.In Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05) (pp 199-208). IEEE Press.Conference contribution | UvA-DAREKupke, C.A. (2006) Finitary coalgebraic logics.Institute for Logic, Language and Computation.Thesis, fully internal | UvA-DAREKurtonina, N., de Rijke, M. (1997) Classifying description logics.In Rousset, M.-C. (Eds.), Proc. International Workshop on Description Logics (DL'97) (pp 49-53)Chapter | UvA-DAREKurtonina, N., de Rijke, M. (1997) Simulating without negation.Journal of Logic and Computation, Vol. 7 (pp 503-524)Article | UvA-DAREKurtonina, N., de Rijke, M. (1997) Expressiveness of first-order description logics.Research Report. University of Warwick.Report | UvA-DAREKurtonina, N., de Rijke, M. (1997) Bisimulations for temporal logic.Journal of Logic, Language and Information, Vol. 6 (pp 403-425)Article | UvA-DARE
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 illc at uva.nl