Search Results for author:
Found 19 papers, 5 papers with code
DACCORD : un jeu de données pour la Détection Automatique d'énonCés COntRaDictoires en français
In this article, we present DACCORD, a new dataset dedicated to the task of automatically detecting contradictions between sentences in French.
SPINDLE: Spinning Raw Text into Lambda Terms with Graph Attention
This paper describes SPINDLE - an open source Python module implementing an efficient and accurate parser for written Dutch that transforms raw text input to programs for meaning composition, expressed as {\lambda} terms.
Perspectives on neural proof nets
Vertex labelling is a well-studied task in graph neural networks, and different ways of implementing graph generation using neural networks will be explored.
Proof-theoretic aspects of NL$λ$
We present a proof-theoretic analysis of the logic NL$\lambda$ (Barker \& Shan 2014, Barker 2019).
Neural Proof Nets
Linear logic and the linear {\lambda}-calculus have a long standing tradition in the study of natural language form and meaning.
Logical foundations for hybrid type-logical grammars
This paper explores proof-theoretic aspects of hybrid type-logical grammars , a logic combining Lambek grammars with lambda grammars.
Logical Semantics, Dialogical Argumentation, and Textual Entailment
In this chapter, we introduce a new dialogical system for first order classical logic which is close to natural language argumentation, and we prove its completeness with respect to usual classical validity.
Partial Orders, Residuation, and First-Order Linear Logic
We will investigate proof-theoretic and linguistic aspects of first-order linear logic.
\AETHEL: Automatically Extracted Typelogical Derivations for Dutch
{\AE}THEL{'}s types and derivations are obtained by means of an extraction algorithm applied to the syntactic analyses of LASSY Small, the gold standard corpus of written Dutch.
ÆTHEL: Automatically Extracted Typelogical Derivations for Dutch
{\AE}THEL's types and derivations are obtained by means of an extraction algorithm applied to the syntactic analyses of LASSY Small, the gold standard corpus of written Dutch.
Chart Parsing Multimodal Grammars
The short note describes the chart parser for multimodal type-logical grammars which has been developed in conjunction with the type-logical treebank for French.
Proof nets for the Displacement calculus
We present a proof net calculus for the Displacement calculus and show its correctness.
Natural Language Semantics and Computability
This paper is a reflexion on the computability of natural language semantics.
The Grail theorem prover: Type theory for syntax and semantics
As the name suggests, type-logical grammars are a grammar formalism based on logic and type theory.
Comparing and evaluating extended Lambek calculi
Lambeks Syntactic Calculus, commonly referred to as the Lambek calculus, was innovative in many ways, notably as a precursor of linear logic.
Hybrid Type-Logical Grammars, First-Order Linear Logic and the Descriptive Inadequacy of Lambda Grammars
In this article we show that hybrid type-logical grammars are a fragment of first-order linear logic.
Plurals: individuals and sets in a richly typed semantics
We developed a type-theoretical framework for natural lan- guage semantics that, in addition to the usual Montagovian treatment of compositional semantics, includes a treatment of some phenomena of lex- ical semantic: coercions, meaning, transfers, (in)felicitous co-predication.
Extended Lambek calculi and first-order linear logic
First-order multiplicative intuitionistic linear logic (MILL1) can be seen as an extension of the Lambek calculus.
