English
Related papers

Related papers: Nominal Class Assignment in Swahili: A Computation…

200 papers

In a recent paper, a realizability technique has been used to give a semantics of a quantum lambda calculus. Such a technique gives rise to an infinite number of valid typing rules, without giving preference to any subset of those. In this…

Logic in Computer Science · Computer Science 2023-06-22 Alejandro Díaz-Caro , Octavio Malherbe

We present a compositional semantics for various types of polar questions and wh-questions within the framework of Combinatory Categorial Grammar (CCG). To assess the explanatory power of our proposed analysis, we introduce a…

Computation and Language · Computer Science 2023-12-25 Hayate Funakura , Koji Mineshima

We study the role of the second language in bilingual word embeddings in monolingual semantic evaluation tasks. We find strongly and weakly positive correlations between down-stream task performance and second language similarity to the…

Computation and Language · Computer Science 2016-10-12 Steffen Eger , Armin Hoenen , Alexander Mehler

Sets and relations are very useful concepts for defining denotational semantics. In the Coq proof assistant, curried functions to Prop are used to represent sets and relations, e.g. A -> Prop, A -> B -> Prop, A -> B -> C -> Prop, etc.…

Programming Languages · Computer Science 2024-04-09 Qinxiang Cao , Xiwei Wu , Yalun Liang

This paper revisits the well-established relationship between the modal mu calculus and parity games to show that it is even more robust than previously known. It addresses the question of whether the descriptive complexity of modal mu…

Logic in Computer Science · Computer Science 2017-09-08 Karoliina Lehtinen

We introduce operational semantics into games. And based on the operational semantics, we establish a full algebra of games, including basic algebra of games, algebra of concurrent games, recursion and abstraction. The algebra can be used…

Logic in Computer Science · Computer Science 2019-09-04 Yong Wang

We develop a system that formally represents spatial semantics concepts within natural language descriptions of spatial arrangements. The system builds on a model of spatial semantics representation according to which words in a sentence…

Computation and Language · Computer Science 2021-11-30 Alexandros Haridis , Stella Rossikopoulou Pappa

This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…

Computational Complexity · Computer Science 2016-02-02 Jaroslav Horáček , Milan Hladík , Michal Černý

The development of compositional distributional models of semantics reconciling the empirical aspects of distributional semantics with the compositional aspects of formal semantics is a popular topic in the contemporary literature. This…

Logic · Mathematics 2013-04-30 Edward Grefenstette

Distributional semantics offers new ways to study the semantics of morphology. This study focuses on the semantics of noun singulars and their plural inflectional variants in English. Our goal is to compare two models for the…

Computation and Language · Computer Science 2023-01-31 Elnaz Shafaei-Bajestan , Peter Uhrig , R. Harald Baayen

We investigate a class of nominal algebraic Henkin-style models for the simply typed lambda-calculus in which variables map to names in the denotation and lambda-abstraction maps to a (non-functional) name-abstraction operation. The…

Logic in Computer Science · Computer Science 2011-11-02 Murdoch J. Gabbay , Dominic P. Mulligan

We survey facts mostly emerging from the seminal results of Alan Cobham obtained in the late sixties and early seventies. We do not attempt to be exhaustive but try instead to give some personal interpretations and some research directions.…

Formal Languages and Automata Theory · Computer Science 2012-04-27 Michel Rigo

In this paper, I argue, contrary to the prevailing opinion in the linguistics and philosophy literature, that a sortal approach to aspectual composition can indeed be explanatory. In support of this view, I develop a synthesis of competing…

cmp-lg · Computer Science 2008-02-03 Michael White

We define a notion of an arithmetic set in an arbitrary countable group and study properties of these sets in the cases of Abelian groups and non-abelian free groups.

Group Theory · Mathematics 2014-12-02 Azer Akhmedov , Damiano Fulghesu

We describe an inventory of semantic relations that are expressed by prepositions. We define these relations by building on the word sense disambiguation task for prepositions and propose a mapping from preposition senses to the relation…

Computation and Language · Computer Science 2013-05-27 Vivek Srikumar , Dan Roth

We introduce the class of synchronous subsequential relations, a subclass of the synchronous relations which embodies some properties of subsequential relations. If we take relations of this class as forming the possible transitions of an…

Formal Languages and Automata Theory · Computer Science 2015-09-25 Christian Wurm

Semantic subtyping is an approach to define subtyping relations for type systems featuring union and intersection type connectives. It has been studied only for strict languages, and it is unsound for non-strict semantics. In this work, we…

Programming Languages · Computer Science 2021-11-15 Tommaso Petrucciani , Giuseppe Castagna , Davide Ancona , Elena Zucca

Fractional scoring has been proposed to avoid inconsistencies in the attribution of publications to percentile rank classes. Uncertainties and ambiguities in the evaluation of percentile ranks can be demonstrated most easily with small…

Digital Libraries · Computer Science 2013-03-25 Michael Schreiber

Qualitative spatial and temporal reasoning is based on so-called qualitative calculi. Algebraic properties of these calculi have several implications on reasoning algorithms. But what exactly is a qualitative calculus? And to which extent…

Artificial Intelligence · Computer Science 2013-09-16 Frank Dylla , Till Mossakowski , Thomas Schneider , Diedrich Wolter

This thesis embarks on a comprehensive exploration of formal computational models that underlie typed programming languages. We focus on programming calculi, both functional (sequential) and concurrent, as they provide a compelling rigorous…

Logic in Computer Science · Computer Science 2024-08-16 Joseph William Neal Paulus