English
Related papers

Related papers: Bilingual analogical proportions via hedges

200 papers

An alternative proof of the completeness of relational algebra with respect to allowed formulas of first-order logic is presented. The proof relies on the well-known embedding of relational algebra into cylindric algebra, which makes it…

Logic in Computer Science · Computer Science 2026-03-17 Jan Laštovička

In this paper, we introduce a novel generalization of the classical property of algebras known as "being alternative," which we term "partially alternative." This new concept broadens the scope of alternative algebras, offering a fresh…

Rings and Algebras · Mathematics 2025-05-14 Tianran Hua , Ekaterina Napedenina , Marina Tvalavadze

In this paper, first we show that $(\g,[\cdot,\cdot],\alpha)$ is a hom-Lie algebra if and only if $(\Lambda \g^*,\alpha^*,d)$ is an $(\alpha^*,\alpha^*)$-differential graded commutative algebra. Then, we revisit representations of hom-Lie…

Mathematical Physics · Physics 2016-02-04 Yunhe Sheng , Zhen Xiong

Order-sorted algebras and many sorted algebras exist in a long history with many different implementations and applications. A lot of language specifications have been defined in order-sorted algebra frameworks such as the language…

Programming Languages · Computer Science 2018-02-20 Liyi Li , Elsa Gunter

These are lecture notes on the algebraic approach to regular languages. The classical algebraic approach is for finite words; it uses semigroups instead of automata. However, the algebraic approach can be extended to structures beyond…

Formal Languages and Automata Theory · Computer Science 2020-08-27 Mikołaj Bojańczyk

The field of AI alignment aims to steer AI systems toward human goals, preferences, and ethical principles. Its contributions have been instrumental for improving the output quality, safety, and trustworthiness of today's AI models. This…

Artificial Intelligence · Computer Science 2024-11-26 Robert West , Roland Aydin

Recent work on vector-based compositional natural language semantics has proposed the use of density matrices to model lexical ambiguity and (graded) entailment (e.g. Piedeleu et al 2015, Bankova et al 2019, Sadrzadeh et al 2018). Ambiguous…

Computation and Language · Computer Science 2020-11-06 Adriana D. Correia , Michael Moortgat , Henk T. C. Stoof

This research started with an algebra for reasoning about rely/guarantee concurrency for a shared memory model. The approach taken led to a more abstract algebra of atomic steps, in which atomic steps synchronise (rather than interleave)…

Logic in Computer Science · Computer Science 2022-01-19 Ian J. Hayes , Robert Colvin , Larissa Meinicke , Kirsten Winter , Andrius Velykis

Analogical reasoning has been a principal focus of various waves of AI research. Analogy is particularly challenging for machines because it requires relational structures to be represented such that they can be flexibly applied across…

Artificial Intelligence · Computer Science 2019-02-04 Felix Hill , Adam Santoro , David G. T. Barrett , Ari S. Morcos , Timothy Lillicrap

Hom-algebras are generalizations of algebras obtained using a twisting by a linear map. But there is a priori a freedom on where to twist. We enumerate here all the possible choices in the Lie and associative categories and study the…

Rings and Algebras · Mathematics 2009-08-11 Y. Frégier , A. Gohr

We propose a new formalism for specifying and reasoning about problems that involve heterogeneous "pieces of information" -- large collections of data, decision procedures of any kind and complexity and connections between them. The essence…

Logic in Computer Science · Computer Science 2016-12-30 Eugenia Ternovska

Rhetoric, both spoken and written, involves not only content but also style. One common stylistic tool is $\textit{parallelism}$: the juxtaposition of phrases which have the same sequence of linguistic ($\textit{e.g.}$, phonological,…

Computation and Language · Computer Science 2023-12-04 Stephen Bothwell , Justin DeBenedetto , Theresa Crnkovich , Hildegund Müller , David Chiang

In the category of Hom-Leibniz algebras we introduce the notion of representation as adequate coefficients to construct the chain complex to compute the Leibniz homology of Hom-Leibniz algebras. We study universal central extensions of…

Rings and Algebras · Mathematics 2012-09-28 J. M. Casas , M. A. Insua , N. Pacheco Rego

Math is constructed by people for people: just as natural language corpora reflect not just propositions but the communicative goals of language users, the math data that models are trained on reflects not just idealized mathematical…

Artificial Intelligence · Computer Science 2024-11-01 Sasha Boguraev , Ben Lipkin , Leonie Weissweiler , Kyle Mahowald

In the rapidly evolving field of Large Language Models (LLMs), there is a critical need to thoroughly analyze their capabilities and risks. Central to our investigation are two novel elements. Firstly, it is the innovative parallels between…

Artificial Intelligence · Computer Science 2024-03-07 Jianqiiu Zhang

Similarity is a core notion that is used in psychology and two branches of linguistics: theoretical and computational. The similarity datasets that come from the two fields differ in design: psychological datasets are focused around a…

Computation and Language · Computer Science 2016-06-20 Dmitrijs Milajevs , Sascha Griffiths

Word embeddings generated by neural network methods such as word2vec (W2V) are well known to exhibit seemingly linear behaviour, e.g. the embeddings of analogy "woman is to queen as man is to king" approximately describe a parallelogram.…

Computation and Language · Computer Science 2019-05-14 Carl Allen , Timothy Hospedales

Capturing the similarities between human language units is crucial for explaining how humans associate different objects, and therefore its computation has received extensive attention, research, and applications. With the ever-increasing…

Computation and Language · Computer Science 2025-09-04 Wenchuan Mu

We introduce the notion of pre-weight structure on a triangulated category and study the corresponding pseudo-identities. We propose the notion of canonical derived equivalence between algebras that are not necessarily flat, which is…

Representation Theory · Mathematics 2025-11-20 Xiao-Wu Chen

One of the major open problems in automata and logic is the following: is there an algorithm which inputs a regular tree language and decides if the language can be defined in first-order logic? The goal of this paper is to present this…

Formal Languages and Automata Theory · Computer Science 2017-03-16 Mikołaj Bojańczyk , Henryk Michalewski