English
Related papers

Related papers: Enriched concepts of regular logic

200 papers

This paper deals with enriched qualitative belief functions for reasoning under uncertainty and for combining information expressed in natural language through linguistic labels. In this work, two possible enrichments (quantitative and/or…

Artificial Intelligence · Computer Science 2007-09-12 Xinde Li , Xinhan Huang , Florentin Smarandache , Jean Dezert

This work originates from the observation that today's state-of-the-art statistical language models are impressive not only for their performance, but also - and quite crucially - because they are built entirely from correlations in…

Computation and Language · Computer Science 2024-08-07 Tai-Danae Bradley , Yiannis Vlassopoulos

Regular and exact categories were first introduced by Michael Barr in 1971; since then, the theory has developed and found many applications in algebra, geometry, and logic. In particular, a small regular category determines a certain…

Category Theory · Mathematics 2020-01-20 Stephen Lack , Giacomo Tendas

Justification theory is a unifying framework for semantics of non-monotonic logics. It is built on the notion of a justification, which intuitively is a graph that explains the truth value of certain facts in a structure. Knowledge…

Logic in Computer Science · Computer Science 2019-05-16 Simon Marynissen

This paper examines the characterization and learning of grammars defined with enriched representational models. Model-theoretic approaches to formal language theory traditionally assume that each position in a string belongs to exactly one…

Formal Languages and Automata Theory · Computer Science 2019-06-25 Jane Chandlee , Remi Eyraud , Jeffrey Heinz , Adam Jardine , Jonathan Rawski

We introduce the theory of enrichment over an internal monoidal category as a common generalization of both the standard theories of enriched and internal categories. The aim of the paper is to justify and contextualize the new notion by…

Category Theory · Mathematics 2020-06-16 Enrico Ghiorzi

In this document, we propose a description, via a Haskell implementation, of a generalization of the notion of regular expression allowing us to group the definitions and the methods of (tree or word) automata constructions over one generic…

Formal Languages and Automata Theory · Computer Science 2020-12-22 Ludovic Mignot

The study of finite automata and regular languages is a privileged meeting point of algebra and logic. Since the work of Buchi, regular languages have been classified according to their descriptive complexity, i.e. the type of logical…

Logic in Computer Science · Computer Science 2017-01-11 Pascal Tesson , Denis Therien

Programs with a continuous state space or that interact with physical processes often require notions of equivalence going beyond the standard binary setting in which equivalence either holds or does not hold. In this paper we explore the…

Logic in Computer Science · Computer Science 2021-10-28 Fredrik Dahlqvist , Renato Neves

We develop an analogue of universal algebra in which generating symbols are interpreted as relations. We prove a variety theorem for these relational algebraic theories, in which we find that their categories of models are precisely the…

Category Theory · Mathematics 2021-11-09 Chad Nester

We introduce a general notion of enrichment for homotopy-coherent algebraic structures described by Segal conditions, using the framework of "algebraic patterns" developed in our previous work. This recovers several known examples of…

Category Theory · Mathematics 2023-11-22 Hongyi Chu , Rune Haugseng

We introduce a new notion of recursively generated enriched term which generalizes the one studied in joint work with Rosick\'y. These new terms come together with a notion of term-interpretability, which recovers the same type of…

Category Theory · Mathematics 2025-07-15 Giacomo Tendas

We investigate the expressive power of regular expressions for languages of countable words and establish their expressive equivalence with logical and algebraic characterizations. Our goal is to extend the classical theory of regular…

Logic in Computer Science · Computer Science 2025-05-05 Thomas Colcombet , A V Sreejith

The familiar adjunction between ordered sets and completely distributive lattices can be extended to generalised metric spaces, that is, categories enriched over a quantale (a lattice of "truth values"), via an appropriate distributive law…

Category Theory · Mathematics 2021-12-28 Adriana Balan , Alexander Kurz

Restriction categories were introduced to provide an axiomatic setting for the study of partially defined mappings; they are categories equipped with an operation called restriction which assigns to every morphism an endomorphism of its…

Category Theory · Mathematics 2012-11-28 Robin Cockett , Richard Garner

We generalize Barr's embedding theorem for regular categories to the context of enriched categories.

Category Theory · Mathematics 2009-08-31 Dimitri Chikhladze

This article presents a general description of dynamical systems using the language of enriched functors and enriched natural transformations. This framework is essential to establish the equivalence of three descriptions of dynamics -- a…

Category Theory · Mathematics 2025-09-09 Suddhasattwa Das , Tomoharu Suda

In a paper of 1974, Brian Day employed a notion of factorization system in the context of enriched category theory, replacing the usual diagonal lifting property with a corresponding criterion phrased in terms of hom-objects. We set forth…

Category Theory · Mathematics 2016-04-28 Rory B. B. Lucyshyn-Wright

Eilenberg correspondence, based on the concept of syntactic monoids, relates varieties of regular languages with pseudovarieties of finite monoids. Various modifications of this correspondence related more general classes of regular…

Formal Languages and Automata Theory · Computer Science 2014-05-23 Ondřej Klíma

The integration of lexical semantics and pragmatics in the analysis of the meaning of natural lan- guage has prompted changes to the global framework derived from Montague. In those works, the original lexicon, in which words were assigned…

Computation and Language · Computer Science 2013-09-05 Bruno Mery , Christian Retoré