English
Related papers

Related papers: Separation and covering for group based concatenat…

200 papers

Categories provide a coarse grained description of the world. A fundamental question is whether categories simply mirror an underlying structure of nature, or instead come from the complex interactions of human beings among themselves and…

Physics and Society · Physics 2008-06-19 Andrea Puglisi , Andrea Baronchelli , Vittorio Loreto

Why do some languages like Czech permit free word order, while others like English do not? We address this question by pretraining transformer language models on a spectrum of synthetic word-order variants of natural languages. We observe…

Computation and Language · Computer Science 2026-03-23 Jonas Mayer Martins , Jaap Jumelet , Viola Priesemann , Lisa Beinborn

We formalize human language understanding as a structured prediction task where the output is a partially ordered set (poset). Current encoder-decoder architectures do not take the poset structure of semantics into account properly, thus…

Computation and Language · Computer Science 2020-10-16 Yinuo Guo , Zeqi Lin , Jian-Guang Lou , Dongmei Zhang

Difference hierarchies were originally introduced by Hausdorff and they play an important role in descriptive set theory. In this survey paper, we study difference hierarchies of regular languages. The first sections describe standard…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Olivier Carton , Dominique Perrin , Jean-Éric Pin

Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level languages with ML-style general (higher-order) storage, we…

Logic in Computer Science · Computer Science 2015-07-01 Jan Schwinghammer , Lars Birkedal , Bernhard Reus , Hongseok Yang

Hyperproperties, which generalize trace properties by relating multiple traces, are widely studied in information-flow security. Recently, a number of logics for hyperproperties have been proposed, and there is a need to understand their…

Logic in Computer Science · Computer Science 2020-05-13 Norine Coenen , Bernd Finkbeiner , Christopher Hahn , Jana Hofmann

A notion of convolution is presented in the context of formal power series together with lifting constructions characterising algebras of such series, which usually are quantales. A number of examples underpin the universality of these…

Logic in Computer Science · Computer Science 2014-10-17 Brijesh Dongol , Ian J. Hayes , Georg Struth

A longstanding question in cognitive science concerns the learning mechanisms underlying compositionality in human cognition. Humans can infer the structured relationships (e.g., grammatical rules) implicit in their sensory observations…

Machine Learning · Computer Science 2021-05-20 Jacob Russin , Roland Fernandez , Hamid Palangi , Eric Rosen , Nebojsa Jojic , Paul Smolensky , Jianfeng Gao

Combinatory categorial grammar (CCG) is a grammar formalism used for natural language parsing. CCG assigns structured lexical categories to words and uses a small set of combinatory rules to combine these categories to parse a sentence. In…

Artificial Intelligence · Computer Science 2011-08-30 Yuliya Lierler , Peter Schüller

Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on reasoning frameworks for path expressions where node…

Logic in Computer Science · Computer Science 2010-06-02 Everardo Barcenas , Pierre Geneves , Nabil Layaida , Alan Schmitt

Language segmentation consists in finding the boundaries where one language ends and another language begins in a text written in more than one language. This is important for all natural language processing tasks. The problem can be solved…

Computation and Language · Computer Science 2015-10-07 David Alfter

A well-known approach to treating syntactic island constraints in the setting of Lambek grammars consists in adding specific bracket modalities to the logic. We adapt this approach to abstract categorial grammars (ACG). Thus we define…

Logic · Mathematics 2020-05-21 Sergey Slavnov

Text classification is one of the most widely studied tasks in natural language processing. Motivated by the principle of compositionality, large multilayer neural network models have been employed for this task in an attempt to effectively…

Computation and Language · Computer Science 2018-08-07 Devendra Singh Sachan , Manzil Zaheer , Ruslan Salakhutdinov

For a complexity class $C$ and language $L$, a constructive separation of $L \notin C$ gives an efficient algorithm (also called a refuter) to find counterexamples (bad inputs) for every $C$-algorithm attempting to decide $L$. We study the…

Computational Complexity · Computer Science 2024-08-07 Lijie Chen , Ce Jin , Rahul Santhanam , Ryan Williams

For a variety of finite groups $\mathbf H$, let $\overline{\mathbf H}$ denote the variety of finite semigroups all of whose subgroups lie in $\mathbf H$. We give a characterization of the subsets of a finite semigroup that are pointlike…

Group Theory · Mathematics 2018-01-16 Samuel J. v. Gool , B. Steinberg

We study the expressive power of fragments of inclusion logic under the so-called lax team semantics. The fragments are defined either by restricting the number of universal quantifiers or the arity of inclusion atoms in formulae. In case…

Logic · Mathematics 2014-01-15 Miika Hannula

Categorical compositional distributional semantics is a model of natural language; it combines the statistical vector space models of words with the compositional models of grammar. We formalise in this model the generalised quantifier…

Computation and Language · Computer Science 2019-11-12 Jules Hedges , Mehrnoosh Sadrzadeh

In this paper we explore the structure and properties of C-groups. We define a C-group as a group $G$ with $rk(G) < rk(Z(G))$ (where $rk(G)$ is the minimal cardinal of a generating set for a group $G$). Using GAP (a group theory program)…

Group Theory · Mathematics 2007-05-23 Mihai Tohaneanu , Margarethe Flanders , Avi Silterra

CIF is a language designed for two purposes, namely as a specification language for hybrid systems and as an interchange format for allowing model transformations between other languages for hybrid systems. To facilitate the top-down…

Logic in Computer Science · Computer Science 2010-08-13 H. Beohar , D. E. Nadales Agut , D. A. van Beek , P. J. L. Cuijpers

In the course of classifying the homogeneous permutations, Cameron introduced the viewpoint of permutations as structures in a language of two linear orders, and this structural viewpoint is taken up here. The majority of this thesis is…

Logic · Mathematics 2018-05-14 Samuel Braunfeld