English
Related papers

Related papers: Resource convertibility and ordered commutative mo…

200 papers

We use an algebraic viewpoint, namely a matrix framework to deal with the problem of resource allocation under uncertainty in the context of a qualitative approach. Our basic qualitative data are a plausibility relation over the resources,…

Artificial Intelligence · Computer Science 2018-05-18 Franklin Camacho , Gerardo Chacón , Ramón Pino Peréz

All natural things process and transform information. They receive environmental information as input, and transform it into appropriate output responses. Much of science is dedicated to building models of such systems -- algorithmic…

Quantum Physics · Physics 2017-02-14 Jayne Thompson , Andrew J. P. Garner , Vlatko Vedral , Mile Gu

Quantum coherence is a critical resource for many operational tasks. Understanding how to quantify and manipulate it also promises to have applications for a diverse set of problems in theoretical physics. For certain applications, however,…

Quantum Physics · Physics 2016-11-22 Iman Marvian , Robert W. Spekkens

This paper proposes a definition of recognizable transducers over monads and comonads, which bridges two important ongoing efforts in the current research on regularity. The first effort is the study of regular transductions, which extends…

Formal Languages and Automata Theory · Computer Science 2024-07-04 Rafał Stefański

We provide the set of filters (saturated submonoids) in a commutative monoid with a topology (like the spectrum of a ring) and study the resulting spaces.

General Topology · Mathematics 2007-05-23 Holger Brenner

Among the most fundamental questions in the manipulation of quantum resources such as entanglement is the possibility of reversibly transforming all resource states. The key consequence of this would be the identification of a unique…

Quantum Physics · Physics 2024-04-18 Bartosz Regula , Ludovico Lami

Consider a commutative monoid $(M,+,0)$ and a biadditive binary operation $\mu \colon M \times M \to M$. We will show that under some additional general assumptions, the operation $\mu$ is automatically both associative and commutative. The…

Rings and Algebras · Mathematics 2024-06-18 Matthias Schötz

Possibilistic logic offers a qualitative framework for representing pieces of information associated with levels of uncertainty of priority. The fusion of multiple sources information is discussed in this setting. Different classes of…

Artificial Intelligence · Computer Science 2013-01-18 Salem Benferhat , Didier Dubois , Souhila Kaci , Henri Prade

We introduce a monotone modal analogue of the intuitionistic (normal) modal logic IK using a translation into a suitable (intuitionistic) first-order logic. We axiomatise the logic and give a semantics by means of intuitionistic…

Logic · Mathematics 2025-07-21 Jim de Groot

The Resource $\lambda$-calculus is a variation of the $\lambda$-calculus where arguments can be superposed and must be linearly used. Hence it is a model for linear and non-deterministic programming languages, and the target language of…

Logic in Computer Science · Computer Science 2015-02-18 Marco Solieri

A numerical monoid is an additive submonoid of the non-negative integers. Given a numerical monoid $S$, consider the family of "shifted" monoids $M_n$ obtained by adding $n$ to each generator of $S$. In this paper, we examine minimal…

Commutative Algebra · Mathematics 2018-08-15 Rebecca Conaway , Felix Gotti , Jesse Horton , Christopher O'Neill , Roberto Pelayo , Mesa Williams , Brian Wissman

Regular languages -- the languages accepted by deterministic finite automata -- are known to be precisely the languages recognized by finite monoids. This characterization is the origin of algebraic language theory. In this paper, we…

Formal Languages and Automata Theory · Computer Science 2025-05-06 Fabian Lenke , Stefan Milius , Henning Urbat , Thorsten Wißmann

Materialisation facilitates Datalog reasoning by precomputing all consequences of the facts and the rules so that queries can be directly answered over the materialised facts. However, storing all materialised facts may be infeasible in…

Databases · Computer Science 2023-12-20 Xinyue Zhang , Pan Hu , Yavor Nenov , Ian Horrocks

In this paper we develope a categorical theory of relations and use this formulation to define the notion of quantization for relations. Categories of relations are defined in the context of symmetric monoidal categories. They are shown to…

Quantum Algebra · Mathematics 2007-05-23 Per K. Jakobsen , Valentin Lychagin

The ability to reason beyond established knowledge allows Organic Chemists to solve synthetic problems and to invent novel transformations. Here, we propose a model which mimics chemical reasoning and formalises reaction prediction as…

Artificial Intelligence · Computer Science 2017-12-27 Marwin H. S. Segler , Mark P. Waller

Information theory establishes the fundamental limits on data transmission, storage, and processing. Quantum information theory unites information theoretic ideas with an accurate quantum-mechanical description of reality to give a more…

Quantum Physics · Physics 2017-02-01 Andrew W. Cross , Ke Li , Graeme Smith

The "thermal operations" framework developed in past works is used to model the evolution of microscopic quantum systems in contact with thermal baths. Here we extend this model to bipartite devices with one part acting as a control…

Quantum Physics · Physics 2017-02-13 Varun Narasimhachar , Gilad Gour

Moir\'e materials, typically confined to stacking atomically thin, two - dimensional (2D) layers such as graphene or transition metal dichalcogenides, have transformed our understanding of strongly correlated and topological quantum…

Materials Science · Physics 2026-01-09 Ilya Popov , Elena Besley

Since the invention of space-time coding numerous algebraic methods have been applied in code design. In particular algebraic number theory and central simple algebras have been on the forefront of the research. In this paper we are turning…

Information Theory · Computer Science 2011-05-19 Roope Vehkalahti , Hsiao-feng Lu

A binary relation on graphs is recursively enumerable if and only if it can be computed by a formula in monadic second-order logic. The latter means that the formula defines a set of graphs, in the usual way, such that each "computation…

Formal Languages and Automata Theory · Computer Science 2020-11-25 Joost Engelfriet