中文
相关论文

相关论文: Quantifiers, Anaphora, and Intensionality

200 篇论文

The relational semantics of linear logic is a powerful framework for defining resource-aware models of the $\lambda$-calculus. However, its quantitative aspects are not reflected in the preorders and equational theories induced by these…

计算机科学中的逻辑 · 计算机科学 2026-04-30 Adrienne Lancelot , Giulio Manzonetto , Guy McCusker , Gabriele Vanoni

Pragmatics is core to natural language, enabling speakers to communicate efficiently with structures like ellipsis and anaphora that can shorten utterances without loss of meaning. These structures require a listener to interpret an…

计算与语言 · 计算机科学 2023-08-17 Nicholas Edwards , Hannah Rohde , Henry Conklin

In this paper, we use a categorical and functorial set up to model the syntax and inference of logics with algebraic signature, extending previous works on algebraisation of logics. The main feature of this work is that structurality, or…

范畴论 · 数学 2021-09-22 Lingyuan Ye

In natural language using short sentences is considered efficient for communication. However, a text composed exclusively of such sentences looks technical and reads boring. A text composed of long ones, on the other hand, demands…

The relationship between communicated language and intended meaning is often probabilistic and sensitive to context. Numerous strategies attempt to estimate such a mapping, often leveraging recursive Bayesian models of communication. In…

计算与语言 · 计算机科学 2023-05-03 Benjamin Lipkin , Lionel Wong , Gabriel Grand , Joshua B Tenenbaum

We can measure the complexity of a logical formula by counting the number of alternations between existential and universal quantifiers. Suppose that an elementary first-order formula $\varphi$ (in $\mathcal{L}_{\omega,\omega}$) is…

逻辑 · 数学 2025-02-05 Matthew Harrison-Trainor , Miles Kretschmer

The paper describes a parser for Categorial Grammar which provides fully word by word incremental interpretation. The parser does not require fragments of sentences to form constituents, and thereby avoids problems of spurious ambiguity.…

cmp-lg · 计算机科学 2016-08-31 David Milward

Compositionality is considered central to language abilities. As performant language systems, how do large language models (LLMs) do on compositional tasks? We evaluate adjective-noun compositionality in LLMs using two complementary setups:…

计算与语言 · 计算机科学 2026-03-17 Ruchira Dhar , Qiwei Peng , Anders Søgaard

We extend the {\lambda}-calculus with constructs suitable for relational and functional-logic programming: non-deterministic choice, fresh variable introduction, and unification of expressions. In order to be able to unify…

编程语言 · 计算机科学 2021-03-02 Pablo Barenbaum , Federico Lochbaum , Mariana Milicich

We tackle the problem of weakly-supervised conversational Question Answering over large Knowledge Graphs using a neural semantic parsing approach. We introduce a new Logical Form (LF) grammar that can model a wide range of queries on the…

计算与语言 · 计算机科学 2021-09-02 Pierre Marion , Paweł Krzysztof Nowak , Francesco Piccinno

A prototypical example of categorial grammars are those based on Lambek calculus, i.e. noncommutative intuitionistic linear logic. However, it has been noted that purely noncommutative operations are often not sufficient for modeling even…

逻辑 · 数学 2025-07-16 Sergey Slavnov

A central concept within informatics is in modelling such systems for the purpose of reasoning (perhaps automated) about their behaviour and properties. To this end, one requires an interpretation of logical formulae in terms of the…

计算机科学中的逻辑 · 计算机科学 2024-05-13 Alexander V. Gheorghiu , Tao Gu , David J. Pym

Relational descriptions have been used in formalizing diverse computational notions, including, for example, operational semantics, typing, and acceptance by non-deterministic machines. We therefore propose a (restricted) logical theory…

计算机科学中的逻辑 · 计算机科学 2010-09-02 Andrew Gacek , Dale Miller , Gopalan Nadathur

Constraint logic grammars provide a powerful formalism for expressing complex logical descriptions of natural language phenomena in exact terms. Describing some of these phenomena may, however, require some form of graded distinctions which…

cmp-lg · 计算机科学 2008-02-03 Stefan Riezler

To model behavioral and neural correlates of language comprehension in naturalistic environments researchers have turned to broad-coverage tools from natural-language processing and machine learning. Where syntactic structure is explicitly…

计算与语言 · 计算机科学 2023-04-18 Miloš Stanojević , Jonathan R. Brennan , Donald Dunagan , Mark Steedman , John T. Hale

We explore a kind of first-order predicate logic with intended semantics in the reals. Compared to other approaches in the literature, we work predominantly in the multiplicative reals $[0,\infty]$, showing they support three generations of…

逻辑 · 数学 2025-12-03 Matteo Capucci

This paper defines a language L for specifying LFG grammars. This enables constraints on LFG's composite ontology (c-structures synchronised with f-structures) to be stated directly; no appeal to the LFG construction algorithm is needed. We…

cmp-lg · 计算机科学 2016-08-31 Patrick Blackburn , Claire Gardent

Figurative and metaphorical language are commonplace in discourse, and figurative expressions play an important role in communication and cognition. However, figurative language has been a relatively under-studied area in NLP, and it…

计算与语言 · 计算机科学 2022-05-17 Emmy Liu , Chen Cui , Kenneth Zheng , Graham Neubig

Qualitative causal relationships compactly express the direction, dependency, temporal constraints, and monotonicity constraints of discrete or continuous interactions in the world. In everyday or academic language, we may express…

人工智能 · 计算机科学 2022-02-25 Scott Friedman , Ian Magnusson , Vasanth Sarathy , Sonja Schmer-Galunder

We present three different functional interpretations of intuitionistic linear logic ILL and show how these correspond to well-known functional interpretations of intuitionistic logic IL via embeddings of IL into ILL. The main difference…

计算机科学中的逻辑 · 计算机科学 2015-07-01 Gilda Ferreira , Paulo Oliva