Citations of work:

Marcin Mostowski & Dominika Wojtyniak (2004). Computational Complexity of the Semantics of Some Natural Language Constructions.

6 found
Are we missing citations?

PhilPapers citations & references are currently in beta testing. We expect to add many more in the future.

Meanwhile, you can use our bibliography tool to import references for this or another work.

Or you can directly add citations for the above work:

Search for work by author name and title
Add directly by record ID

  1.  4
    Interactive Semantic Alignment Model: Social Influence and Local Transmission Bottleneck.Dariusz Kalociński, Marcin Mostowski & Nina Gierasimczuk - 2018 - Journal of Logic, Language and Information 27 (3):225-253.
    We provide a computational model of semantic alignment among communicating agents constrained by social and cognitive pressures. We use our model to analyze the effects of social stratification and a local transmission bottleneck on the coordination of meaning in isolated dyads. The analysis suggests that the traditional approach to learning—understood as inferring prescribed meaning from observations—can be viewed as a special case of semantic alignment, manifesting itself in the behaviour of socially imbalanced dyads put under mild pressure of a local (...)
    Direct download (2 more)  
    Export citation  
    My bibliography  
  2.  30
    Easy Solutions for a Hard Problem? The Computational Complexity of Reciprocals with Quantificational Antecedents.Fabian Schlotterbeck & Oliver Bott - 2013 - Journal of Logic, Language and Information 22 (4):363-390.
    We report two experiments which tested whether cognitive capacities are limited to those functions that are computationally tractable (PTIME-Cognition Hypothesis). In particular, we investigated the semantic processing of reciprocal sentences with generalized quantifiers, i.e., sentences of the form Q dots are directly connected to each other, where Q stands for a generalized quantifier, e.g. all or most. Sentences of this type are notoriously ambiguous and it has been claimed in the semantic literature that the logically strongest reading is preferred (Strongest (...)
    Direct download (2 more)  
    Export citation  
    My bibliography  
  3.  74
    Computational Complexity of Polyadic Lifts of Generalized Quantifiers in Natural Language.Jakub Szymanik - 2010 - Linguistics and Philosophy 33 (3):215-250.
    We study the computational complexity of polyadic quantifiers in natural language. This type of quantification is widely used in formal semantics to model the meaning of multi-quantifier sentences. First, we show that the standard constructions that turn simple determiners into complex quantifiers, namely Boolean operations, iteration, cumulation, and resumption, are tractable. Then, we provide an insight into branching operation yielding intractable natural language multi-quantifier expressions. Next, we focus on a linguistic case study. We use computational complexity results to investigate semantic (...)
    Direct download (8 more)  
    Export citation  
    My bibliography   9 citations  
  4.  70
    Comprehension of Simple Quantifiers. Empirical Evaluation of a Computational Model.Jakub Szymanik & Marcin Zajenkowski - 2010 - Cognitive Science 34 (3):521-532.
    We examine the verification of simple quantifiers in natural language from a computational model perspective. We refer to previous neuropsychological investigations of the same problem and suggest extending their experimental setting. Moreover, we give some direct empirical evidence linking computational complexity predictions with cognitive reality.<br>In the empirical study we compare time needed for understanding different types of quantifiers. We show that the computational distinction between quantifiers recognized by finite-automata and push-down automata is psychologically relevant. Our research improves upon hypothesis and (...)
    Direct download (4 more)  
    Export citation  
    My bibliography   13 citations  
  5.  83
    Branching Quantification V. Two-Way Quantification.Nina Gierasimczuk & Jakub Szymanik - 2009 - Journal of Semantics 26 (4):329-366.
    Next SectionWe discuss the thesis formulated by Hintikka (1973) that certain natural language sentences require non-linear quantification to express their meaning. We investigate sentences with combinations of quantifiers similar to Hintikka's examples and propose a novel alternative reading expressible by linear formulae. This interpretation is based on linguistic and logical observations. We report on our experiments showing that people tend to interpret sentences similar to Hintikka sentence in a way consistent with our interpretation.
    Direct download (8 more)  
    Export citation  
    My bibliography   8 citations  
  6.  44
    A Remark on Collective Quantification.Juha Kontinen & Jakub Szymanik - 2008 - Journal of Logic, Language and Information 17 (2):131-140.
    We consider collective quantification in natural language. For many years the common strategy in formalizing collective quantification has been to define the meanings of collective determiners, quantifying over collections, using certain type-shifting operations. These type-shifting operations, i.e., lifts, define the collective interpretations of determiners systematically from the standard meanings of quantifiers. All the lifts considered in the literature turn out to be definable in second-order logic. We argue that second-order definable quantifiers are probably not expressive enough to formalize all collective (...)
    Direct download (5 more)  
    Export citation  
    My bibliography   4 citations