uva.nl

Institute for Logic, Language and Computation

Searchable List of Research Output

Filter Publications
  • Alechina, N.A. (1995) Modal quantifiers.
    Institute for Logic, Language and Computation.
    Thesis, fully internal | UvA-DARE
  • Alechina, N.A. (1995) Logic with Probabilistic Operators.
    In Proceedings ACCOLADE'94 (pp 121-138)
    Chapter | UvA-DARE
  • Alechina, N.A. (1995) For All Typical.
    In Symbolic and Quantitative Approach to reasoning and Uncertainty. Proceedings ECSQARU'95 (pp 1-8). Springer.
    Chapter | UvA-DARE
  • Alechina, N.A. (1995) Logic with Probabilistic Operators.
    In Proceedings ACCOLADE'94 (pp 121-138)
    Chapter | UvA-DARE
  • Alechina, N.A. (1995) For All Typical.
    In Symbolic and Quantitative Approach to Reasoning and Uncertainty. Proceedings ECSQARU'95 (pp 1-8). Springer.
    Chapter | UvA-DARE
  • Alexiadou, A. Giannakidou, A. (1999) Specificational pseudoclefts as lists.
    In Shahin, K. Blake, S. Kim, E.-U. (Eds.), Proceedings of the West Coast Conference on Formal Linguistics (WCCFL) XVII (pp 1-16). CSLI Publications.
    Conference contribution | UvA-DARE
  • Alhama, R.G. Scha, R. Zuidema, W. (2014) Rule Learning in Humans and Animals.
    In Cartmill, E.A. Roberts, S. Lyn, H. Cornish, H. (Eds.), The Evolution of Language: proceedings of the 10th International Conference (EVOLANG10), Vienna, Austria, 14-17 April 2014 (pp 371-372). World Scientific.
  • Alhama, R.G. Scha, R. Zuidema, W. (2015) How should we evaluate models of segmentation in artificial language learning?.
    In Taatgen, N.A. van Vugt, M.K. Borst, J.P. Mehlhorn, K. (Eds.), Proceedings of ICCM 2015: 13th International Conference on Cognitive Modeling : April 9-11, Groningen, The Netherlands (pp 172-173). University of Groningen.
  • Alhama, R.G. Zuidema, W. (2016) Pre-Wiring and Pre-Training: What does a neural network need to learn truly general identity rules?.
    In Besold, T.R. Bordes, A. d'Avila Garcez, A. Wayne, G. (Eds.), Proceedings of the Workshop on Cognitive Computation: Integrating neural and symbolic approaches 2016: co-located with the 30th Annual Conference on Neural Information Processing Systems (NIPS 2016) : Barcelona, Spain, December 9, 2016 (CEUR Workshop Proceedings, Vol. 1773). CEUR-WS.
  • Alhama, R.G. Zuidema, W. (2016) Generalization in Artificial Language Learning: Modelling the Propensity to Generalize.
    In Korhonen, A. Lenci, A. Murphy, B. Poibeau, T. Villavicencio, A. (Eds.), The 54th Annual Meeting of the Association for Computational Linguistics: proceedings of the 7th Workshop on Cognitive Aspects of Computational Language Learning: August 11, 2016, Berlin, Germany (pp 64-72). Association for Computational Linguistics.
    Conference contribution | https://doi.org/10.18653/v1/W16-19 | UvA-DARE
  • Alhama, R.G. Zuidema, W. (2017) Segmentation as Retention and Recognition: the R&R model.
    In Gunzelmann, G. Howes, A. Tenbrink, T. Davelaar, E.J. (Eds.), CogSci 2017: proceedings of the 39th Annual Meeting of the Cognitive Science Society : London, UK : 26-29 July 2017 : Computational Foundations of Cognition (pp 1531-1536). Cognitive Science Society.
  • Alhama, R.G. Zuidema, W. (2018) Pre-wiring and pre-training: What does a neural network need to learn truly general identity rules?.
    Journal of Artificial Intelligence Research, Vol. 61 (pp 927-946)
  • Aliseda-Llera, A. (1997) Seeking Explanations: Abduction in Logic, Philosophy of Science and Artificial Intelligence.
    Universiteit van Amsterdam.
    Thesis, fully external | UvA-DARE
  • Aliseda-Llera, A. (1997) Abduction as a model for belief revision.
    In Proceedings of the Taller de Logica y Computacion, Primer Encuentro de Computacion (pp 1-7). Universidad de Queretaro.
    Chapter | UvA-DARE
  • Aljanaki, A. Bountouridis, D. Burgoyne, J.A. Van Balen, J. Wiering, F. Honing, H. Veltkamp, R. (2014) Designing Games with a Purpose for Data Collection in Music Research. Emotify and Hooked: Two Case Studies.
    In De Gloria, A. (Eds.), Games and Learning Alliance: Second International Conference, GALA 2013, Paris, France, October 23-25, 2013 : revised selected papers (pp 29-40) (Lecture Notes in Computer Science, Vol. 8605). Springer.
  • Allcock, J. Buhrman, H. Linden, N. (2009) Arbitrarily little knowledge can give a quantum advantage for nonlocal tasks.
    Physical Review A, Vol. 80 (pp 032105)
  • Allender, E. Buhrman, H. Friedman, L. Loff, B. (2012) Reductions to the set of random strings: The resource-bounded case.
    In Rovan, B. Sassone, V. Widmayer, P. (Eds.), Mathematical Foundations of Computer Science 2012: 37th International Symposium, MFCS 2012, Bratislava, Slovakia, August 27-31, 2012 : proceedings (pp 88-99) (Lecture Notes in Computer Science, Vol. 7464). Springer.
  • Allender, E. Buhrman, H. Friedman, L. Loff, B. (2014) Reductions to the set of random strings: The resource-bounded case.
    Logical Methods in Computer Science, Vol. 10
  • Allender, E. Buhrman, H.M. Kouck, M. van Melkebeek, D. Ronneburger, D. (2002) Power from random strings.
    In Proceedings of the 43d annual IEEE conference on Foundations of Computer Science (pp 669-678). IEEE Computer Society Press.
    Conference contribution | UvA-DARE
  • Allender, E. Buhrman, H.M. Koucky, M. van Melkebeek, D. Ronneburger, D. (2006) Power from random strings.
    SIAM Journal on Computing, Vol. 35 (pp 1467-1493)
1 ... 3 4 5 6 7 8 9 10 11 ... 309

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