Search results

  • Full text

  • Document type

    • Publication year

  • Organisation

Results: 81
Number of items: 81
  • Open Access
    Dégremont, C., Kurzen, L., & Szymanik, J. (2011). On the tractability of comparing informational structures. In J. van Eijk, & R. Verbrugge (Eds.), Proceedings of the Workshop on Reasoning About Other Minds: Logical and Cognitive Perspectives: Groningen, The Netherlands, July 11th, 2011 (pp. 50-64). (CEUR Workshop Proceedings; Vol. 751). CEUR-WS. http://ceur-ws.org/Vol-751/reasoningminds2011_submission_11.pdf
  • Open Access
    van Rooij, I., Kwisthout, J., Blokpoel, M., Szymanik, J., Wareham, T., & Toni, I. (2011). Intentional communication: computationally easy or difficult? Frontiers in Human Neuroscience, 5, Article 52. https://doi.org/10.3389/fnhum.2011.00052
  • Open Access
    Bott, O., Schlotterbeck, F., & Szymanik, J. (2011). Interpreting tractable versus intractable reciprocal sentences. In J. Bos, & S. Pulman (Eds.), Proceedings of the Ninth International Conference on Computational Semantics: IWCS 2011 : January 12-14, 2011, Oxford, UK (pp. 75-84). Association for Computational Linguistics. https://aclanthology.org/W11-0109
  • Szymanik, J., & Zajenkowski, M. (2010). Quantifiers and working memory. In M. Aloni, H. Bastiaanse, T. de Jager, & K. Schulz (Eds.), Logic, Language and Meaning: 17th Amsterdam Colloquium : Amsterdam, The Netherlands, December 16-18, 2009 : revised selected papers (pp. 456-464). (Lecture Notes in Computer Science; Vol. 6042), (Lecture Notes in Artificial Intelligence), (FoLLI Publications on Logic, Language and Information). Springer. https://doi.org/10.1007/978-3-642-14287-1_46
  • Szymanik, J. (2010). Almost all complex quantifiers are simple. In C. Ebert, G. Jäger, & J. Michaelis (Eds.), The Mathematics of Language: 10th and 11th Biennial Conference MOL 10, Los Angeles, CA, USA, July 28-30, 2007 and MOL 11, Bielefeld, Germany, August 20-21, 2009 : revised selected papers (pp. 272-280). (Lecture Notes in Computer Science; Vol. 6149), (Lecture Notes in Artificial Intelligence), (FoLLI Publications on Logic, Language and Information). Springer. https://doi.org/10.1007/978-3-642-14322-9_21
  • Isaac, A., & Szymanik, J. (2010). Logic and cognitive science: bridging the gap between symbolic and connectionist paradigms. Journal of Indian Council of Philosophical Research, 27(2), 279-309. http://staff.science.uva.nl/~ssimon/indjournal/contents.html
  • Szymanik, J., & Zajenkowski, M. (2010). Comprehension of simple quantifiers: empirical evaluation of a computational model. Cognitive Science, 34(3), 521-532. https://doi.org/10.1111/j.1551-6709.2009.01078.x
  • Szymanik, J. (2010). Computational complexity of polyadic lifts of generalized quantifiers in natural language. Linguistics and Philosophy, 33(3), 215-250. https://doi.org/10.1007/s10988-010-9076-z
  • Gierasimczuk, N., & Szymanik, J. (2009). Branching quantification v. two-way quantification. Journal of Semantics, 26(4), 367-392. https://doi.org/10.1093/jos/ffp008
  • Szymanik, J. (2009). The computational complexity of quantified reciprocals. In P. Bosch, D. Gabelaia, & J. Lang (Eds.), Logic, Language, and Computation: 7th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2007, Tbilisi, Georgia, October 1-5, 2007 : revised selected papers (pp. 139-152). (Lecture Notes in Computer Science; Vol. 5422), (Lecture Notes in Artificial Intelligence), (FoLLI Publications on Logic, Language and Information). Springer. https://doi.org/10.1007/978-3-642-00665-4_12
Page 7 of 9