Pages that link to "Item:Q598312"
From MaRDI portal
The following pages link to Computational complexity of the semantics of some natural language constructions (Q598312):
Displaying 17 items.
- A remark on Henkin sentences and their contraries (Q558741) (← links)
- A remark on collective quantification (Q1006495) (← links)
- The computational complexity of ideal semantics (Q1045987) (← links)
- Computational complexity of terminological reasoning in BACK (Q1104128) (← links)
- Interactive semantic alignment model: social influence and local transmission bottleneck (Q1711512) (← links)
- Computational consequences of agreement and ambiguity in natural language (Q1812775) (← links)
- Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents (Q2255227) (← links)
- Natural language semantics and computability (Q2425328) (← links)
- On the complexity of semantic self-minimization (Q2810966) (← links)
- A Dichotomy Result for Ramsey Quantifiers (Q2947460) (← links)
- The Computational Complexity of Quantified Reciprocals (Q3623832) (← links)
- (Q4028788) (← links)
- On Syntactic versus Computational Views of Approximability (Q4210142) (← links)
- (Q4938425) (← links)
- Logic and Complexity in Cognitive Science (Q5249690) (← links)
- Characterizing polynomial Ramsey quantifiers (Q5377702) (← links)
- 2006 Summer Meeting of the Association for Symbolic Logic: Logic Colloquium '06 (Q5421032) (← links)