Complexity of the Lambek Calculus and Its Extensions

Logic and Algorithms in Computational Linguistics 2021 (LACompLing2021)Studies in Computational Intelligence（2023）

引用 0|浏览0

暂无评分

摘要

We survey results on algorithmic complexity of extensions of the Lambek calculus. We classify these extensions as “harmless,” which do not increase complexity, and “dangerous,” which make decision problems undecidable. For the latter, we focus on extensions with subexponentials and with Kleene star.

查看译文

关键词

lambek calculus,complexity,extensions

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要