Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents

DOI10.1007/s10849-013-9181-9zbMath1305.68094OpenAlexW1986360923MaRDI QIDQ2255227

Oliver Bott, Fabian Schlotterbeck

Publication date: 9 February 2015

Published in: Journal of Logic, Language and Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10849-013-9181-9

zbMATH Keywords

computational complexityexperimental semanticsreciprocal sentences

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Linguistics (91F20)

Related Items (4)

A Dichotomy Result for Ramsey Quantifiers ⋮ Characterizing polynomial Ramsey quantifiers ⋮ A characterization of definability of second-order generalized quantifiers with applications to non-definability ⋮ Logic and Complexity in Cognitive Science

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational complexity of the semantics of some natural language constructions
• More fragments of language.
• A remark on collective quantification
• Essays in logical semantics
• Fragments of language
• The computational complexity of probabilistic inference using Bayesian belief networks
• Reachability is harder for directed than for undirected finite graphs
• Quantifiers vs. Quantification Theory
• Reducibility among Combinatorial Problems
• Logic and Complexity in Cognitive Science
• Computational Complexity
• On the Computational Complexity of the Numerically Definite Syllogistic and Related Logics

This page was built for publication: Easy solutions for a hard problem? The computational complexity of reciprocals with quantificational antecedents