English
Related papers

Related papers: Deriving the Predicate-Argument Structure for a Fr…

200 papers

Initial semantics aims to model inductive structures and their properties, and to provide them with recursion principles respecting these properties. An ubiquitous example is the fold operator for lists. We are concerned with initial…

Programming Languages · Computer Science 2026-03-31 Benedikt Ahrens , Ambroise Lafont , Thomas Lamiaux

Most categorical models of meaning use a functor from the syntactic category to the semantic category. When semantic information is available, the problem of grammar induction can therefore be defined as finding preimages of the semantic…

Computation and Language · Computer Science 2014-12-31 Antonin Delpeuch

Similarity in formal argumentation has recently gained attention due to its significance in problems such as argument aggregation in semantics and enthymeme decoding. While existing approaches focus on propositional logic, we address the…

Artificial Intelligence · Computer Science 2026-04-15 Victor David , Jérôme Delobelle , Jean-Guy Mailly

In this paper, I discuss machine translation of English text into Turkish, a relatively ``free'' word order language. I present algorithms that determine the topic and the focus of each target sentence (using salience (Centering Theory),…

cmp-lg · Computer Science 2008-02-03 Beryl Hoffman

A sound and complete embedding of conditional logics into classical higher-order logic is presented. This embedding enables the application of off-the-shelf higher-order automated theorem provers and model finders for reasoning within and…

Artificial Intelligence · Computer Science 2011-08-18 Christoph Benzmueller , Dov Gabbay , Valerio Genovese , Daniele Rispoli

Tableaux originate as a decision method for a logical language. They can also be extended to obtain a structure that spells out all the information in a set of sentences in terms of truth value assignments to atomic formulas that appear in…

cmp-lg · Computer Science 2008-02-03 Pablo Gervas

This paper builds on previous work using Combinatory Categorial Grammar (CCG) to derive a transparent syntax-semantics interface for Abstract Meaning Representation (AMR) parsing. We define new semantics for the CCG combinators that is…

Computation and Language · Computer Science 2019-04-12 Austin Blodgett , Nathan Schneider

We introduce the first order logic of proofs $FOLP^\Box$ in the joint language combining justification terms and binding modalities. The main issue is Kripke--style semantics for this logic. We describe models for $FOLP^\Box$ in terms of…

Logic in Computer Science · Computer Science 2025-12-10 Tatiana Yavorskaya , Elena Popova

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 · Computer Science 2016-08-31 Patrick Blackburn , Claire Gardent

This paper presents a corpus-based analysis of argument structure errors in learner Chinese. The data for analysis includes sentences produced by language learners as well as their corrections by native speakers. We couple the data with…

Computation and Language · Computer Science 2023-08-21 Yuguang Duan , Zi Lin , Weiwei Sun

Most natural languages have a predominant or fixed word order. For example in English the word order is usually Subject-Verb-Object. This work attempts to explain this phenomenon as well as other typological findings regarding word order…

Computation and Language · Computer Science 2021-09-02 Idan Rejwan , Avi Caciularu

Metatheorems about type theories are often proven by interpreting the syntax into models constructed using categorical gluing. We propose to use only sconing (gluing along a global section functor) instead of general gluing. The sconing is…

Logic in Computer Science · Computer Science 2023-05-10 Rafaël Bocquet , Ambrus Kaposi , Christian Sattler

A new categorical framework is provided for dealing with multiple arguments in a programming language with effects, for example in a language with imperative features. Like related frameworks (Monads, Arrows, Freyd categories), we…

Category Theory · Mathematics 2007-07-11 Jean-Guillaume Dumas , Dominique Duval , Jean-Claude Reynaud

The categorical compositional distributional model of natural language provides a conceptually motivated procedure to compute the meaning of sentences, given grammatical structure and the meanings of its words. This approach has…

Computation and Language · Computer Science 2016-01-26 Desislava Bankova , Bob Coecke , Martha Lewis , Daniel Marsden

This paper proposes decoupling the dependency tree from word order, such that surface ordering is not determined by traversing the dependency tree. We develop the notion of a \emph{word order domain structure}, which is linked but…

cmp-lg · Computer Science 2007-05-23 Norbert Broeker

Various structured argumentation frameworks utilize preferences as part of their standard inference procedure to enable reasoning with preferences. In this paper, we consider an inverse of the standard reasoning problem, seeking to identify…

Artificial Intelligence · Computer Science 2020-05-13 Quratul-ain Mahesar , Nir Oren , Wamberto W. Vasconcelos

The notion of a real-valued function is central to mathematics, computer science, and many other scientific fields. Despite this importance, there are hardly any positive results on decision procedures for predicate logical theories that…

Logic in Computer Science · Computer Science 2025-04-30 Stefan Ratschan

Semantic theories of natural language associate meanings with utterances by providing meanings for lexical items and rules for determining the meaning of larger units given the meanings of their parts. Meanings are often assumed to combine…

cmp-lg · Computer Science 2008-02-03 Mary Dalrymple , John Lamping , Fernando Pereira , Vijay Saraswat

We propose a new approach for extracting argument structure from natural language texts that contain an underlying argument. Our approach comprises of two phases: Score Assignment and Structure Prediction. The Score Assignment phase trains…

Computation and Language · Computer Science 2016-12-19 Arkanath Pathak , Pawan Goyal , Plaban Bhowmick

We present a categorical framework for formal systems in which inference rules with $m$ metavariables over a category of syntax $\mathscr{S}$, taken to be a cartesian PROP, are represented by operations of arity $k \to n$ equipped with…

Category Theory · Mathematics 2026-04-10 Paul Wilson
‹ Prev 1 4 5 6 7 8 10 Next ›