Jakub Szymanik

Orcid: 0000-0002-6145-6322

According to our database1, Jakub Szymanik authored at least 49 papers between 2007 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Recursive Numeral Systems Optimize the Trade-off Between Lexicon Size and Average Morphosyntactic Complexity.
Cogn. Sci., March, 2024

2023
Questions About Quantifiers: Symbolic and Nonsymbolic Quantity Processing by the Brain.
Cogn. Sci., October, 2023

Uncovering the Structure of Semantic Representations Using a Computational Model of Decision-Making.
Cogn. Sci., January, 2023

Time-pressure Does Not Alter the Bias Towards Canonical Interpretation of Quantifiers.
Proceedings of the 45th Annual Meeting of the Cognitive Science Society, 2023

2022
The semantically annotated corpus of Polish quantificational expressions.
Lang. Resour. Evaluation, 2022

Are <i>Most</i> and <i>More Than Half</i> Truth-Conditionally Equivalent?
J. Semant., 2022

Indefinite Pronouns Optimize the Simplicity/Informativeness Trade-Off.
Cogn. Sci., 2022

Heavy Tails and the Shape of Modified Numerals.
Cogn. Sci., 2022

HerBERT Based Language Model Detects Quantifiers and Their Semantic Properties in Polish.
Proceedings of the Thirteenth Language Resources and Evaluation Conference, 2022

Reverse-engineering the language of thought: a new approach.
Proceedings of the 44th Annual Meeting of the Cognitive Science Society, 2022

2021
Monotone Quantifiers Emerge via Iterated Learning.
Cogn. Sci., 2021

Quantifiers satisfying semantic universals are simpler.
Proceedings of the 43rd Annual Meeting of the Cognitive Science Society, 2021

The Shape of Modified Numerals.
Proceedings of the 43rd Annual Meeting of the Cognitive Science Society, 2021

Language Models Use Monotonicity to Assess NPI Licensing.
Proceedings of the Findings of the Association for Computational Linguistics: ACL/IJCNLP 2021, 2021

2020
Representational complexity and pragmatics cause the monotonicity effect.
Proceedings of the 42th Annual Meeting of the Cognitive Science Society, 2020

Complexity/informativeness trade-off in the domain of indefinite pronouns.
Proceedings of the 42th Annual Meeting of the Cognitive Science Society, 2020

2019
Characterizing polynomial Ramsey quantifiers.
Math. Struct. Comput. Sci., 2019

Introduction.
Fundam. Informaticae, 2019

Complexity and learnability in the explanation of semantic universals of quantifiers.
Proceedings of the 41th Annual Meeting of the Cognitive Science Society, 2019

The emergence of monotone quantifiers via iterated learning.
Proceedings of the 41th Annual Meeting of the Cognitive Science Society, 2019

2018
Parameterized Complexity of Theory of Mind Reasoning in Dynamic Epistemic Logic.
J. Log. Lang. Inf., 2018

Predicting Cognitive Difficulty of the Deductive Mastermind Game with Dynamic Epistemic Logic Models.
Proceedings of the 40th Annual Meeting of the Cognitive Science Society, 2018

Monotonicity and the Complexity of Reasoning with Quantifiers.
Proceedings of the 40th Annual Meeting of the Cognitive Science Society, 2018

Some of Them Can be Guessed! Exploring the Effect of Linguistic Context in Predicting Quantifiers.
Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics, 2018

2016
Quantifiers and Cognition - Logical and Computational Perspectives.
Studies in linguistics and philosophy 96, Springer, ISBN: 978-3-319-28747-8, 2016

2015
Parameterized Complexity Results for a Model of Theory of Mind Based on Dynamic Epistemic Logic.
Proceedings of the Proceedings Fifteenth Conference on Theoretical Aspects of Rationality and Knowledge, 2015

A Dichotomy Result for Ramsey Quantifiers.
Proceedings of the Logic, Language, Information, and Computation, 2015

Semantic Complexity of Quantifiers and Their Distribution in Corpora.
Proceedings of the 11th International Conference on Computational Semantics, 2015

A non-monotonic extension of universal moral grammar theory.
Proceedings of the 37th Annual Meeting of the Cognitive Science Society, 2015

2014
Exploring the tractability border in epistemic tasks.
Synth., 2014

On the Identification of Quantifiers' Witness Sets: A Study of Multi-quantifier Sentences.
J. Log. Lang. Inf., 2014

A characterization of definability of second-order generalized quantifiers with applications to non-definability.
J. Comput. Syst. Sci., 2014

Probabilistic semantic automata in the verification of quantified statements.
Proceedings of the 36th Annual Meeting of the Cognitive Science Society, 2014

Computational and algorithmic models of strategies in turn-based games.
Proceedings of the 36th Annual Meeting of the Cognitive Science Society, 2014

Logic and Complexity in Cognitive Science.
Proceedings of the Johan van Benthem on Logic and Information Dynamics, 2014

2013
Logic and Cognition: Special Issue of Best Papers of the ESSLLI 2012 Workshop.
J. Log. Lang. Inf., 2013

Backward Induction Is PTIME-complete.
Proceedings of the Logic, Rationality, and Interaction - 4th International Workshop, 2013

Using intrinsic complexity of turn-taking games to predict participants' reaction times.
Proceedings of the 35th Annual Meeting of the Cognitive Science Society, 2013

2012
Pragmatic identification of the witness sets.
Proceedings of the Eighth International Conference on Language Resources and Evaluation, 2012

2011
Characterizing Definability of Second-Order Generalized Quantifiers.
Proceedings of the Logic, Language, Information and Computation, 2011

A note on a generalization of the Muddy Children puzzle.
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge (TARK-2011), 2011

Invariance Properties of Quantifiers and Multiagent Information Exchange.
Proceedings of the Mathematics of Language - 12th Biennial Conference, 2011

Interpreting tractable versus intractable reciprocal sentences.
Proceedings of the Ninth International Conference on Computational Semantics, 2011

2010
Comprehension of Simple Quantifiers: Empirical Evaluation of a Computational Model.
Cogn. Sci., 2010

2009
Branching Quantification v. Two-way Quantification.
J. Semant., 2009

Almost All Complex Quantifiers Are Simple.
Proceedings of the Mathematics of Language, 10th and 11th Biennial Conference, 2009

Quantifiers and Working Memory.
Proceedings of the Logic, Language and Meaning - 17th Amsterdam Colloquium, 2009

2008
A Remark on Collective Quantification.
J. Log. Lang. Inf., 2008

2007
The Computational Complexity of Quantified Reciprocals.
Proceedings of the Logic, 2007


  Loading...