English
Related papers

Related papers: Kantorovich Functors and Characteristic Logics for…

200 papers

In this paper we define a class of polynomial functors suited for constructing coalgebras representing processes in which uncertainty plays an important role. In these polynomial functors we include upper and lower probability measures,…

Logic in Computer Science · Computer Science 2024-04-02 Andrés Gallardo , Ignacio Viglizzo

Fuzzy logic extends the classical truth values "true" and "false" with additional truth degrees in between. More specifically, fuzzy modal logics in this sense are given by a choice of fuzzy modalities and a fuzzy propositional base. It has…

Logic in Computer Science · Computer Science 2026-02-13 Stefan Gebhart , Lutz Schröder , Paul Wild

In order to reason about effects, we can define quantitative formulas to describe behavioural aspects of effectful programs. These formulas can for example express probabilities that (or sets of correct starting states for which) a program…

Logic in Computer Science · Computer Science 2019-04-29 Niels Voorneveld

We introduce an adaptive refinement procedure for smart, and scalable abstraction of dynamical systems. Our technique relies on partitioning the state space depending on the observation of future outputs. However, this knowledge is…

Machine Learning · Computer Science 2023-10-31 Adrien Banse , Licio Romao , Alessandro Abate , Raphaël M. Jungers

The longstanding question of how stochastic behaviour arises from deterministic Hamiltonian dynamics is of great importance, and any truly holistic theory must be capable of describing this transition. In this review, we introduce the…

Statistical Mechanics · Physics 2020-12-02 Gerard McCaul , Denys I. Bondar

Coalgebras provide a uniform framework to study dynamical systems, including several types of automata. In this paper, we make use of the coalgebraic view on systems to investigate, in a uniform way, under which conditions calculi that are…

Logic in Computer Science · Computer Science 2017-03-20 Marcello M. Bonsangue , Stefan Milius , Alexandra Silva

Substructural logics naturally support a quantitative interpretation of formulas, as they are seen as consumable resources. Distances are the quantitative counterpart of equivalence relations: they measure how much two objects are similar,…

Logic in Computer Science · Computer Science 2025-02-05 Francesco Dagnino , Fabio Pasquali

We investigate the properties of linear primitive liftings $\rho\colon \mathcal{L}^p(\mu)\to \mathcal{L}^p(\mu)$ for probability spaces $(X,\Sigma,\mu)$, which are linear maps selecting a representative from each class for almost everywhere…

Probability · Mathematics 2025-12-01 Maxim R. Burke , Nikolaos D. Macheras , Werner Strauss

Nudging is an empirical data assimilation technique that incorporates an observation-driven control term into the model dynamics. The trajectory of the nudged system approaches the true system trajectory over time, even when the initial…

Machine Learning · Computer Science 2025-08-11 Jaemin Oh , Jinsil Lee , Youngjoon Hong

We introduce contextual behavioural metrics (CBMs) as a novel way of measuring the discrepancy in behaviour between processes, taking into account both quantitative aspects and contextual information. This way, process distances by…

Formal Languages and Automata Theory · Computer Science 2023-09-06 Ugo Dal Lago , Maurizio Murgia

An upper bound for the Kantorovich transport distance between probability measures on multidimensional Euclidean spaces is given in terms of transport distances between one dimensional projections. This quantifies the Cram\'er-Wold…

Probability · Mathematics 2026-01-14 Sergey G. Bobkov , Friedrich Götze

In Optimal Transport (OT) on a finite metric space, one defines a distance on the probability simplex that extends the distance on the ground space. The distance is the value of a Linear Programming (LP) problem on the set of…

Methodology · Statistics 2021-01-14 Giovanni Pistone , Fabio Rapallo , Maria Piera Rogantin

A quantum ensemble $\{(p_x, \rho_x)\}$ is a set of quantum states each occurring randomly with a given probability. Quantum ensembles are necessary to describe situations with incomplete a priori information, such as the output of a…

Quantum Physics · Physics 2009-03-30 Ognyan Oreshkov , John Calsamiglia

The Kantorovich-Rubinshtein metric is an $L^1$-like metric on spaces of probability distributions that enjoys several serendipitous properties. It is complete separable if the underlying metric space of points is complete separable, and in…

General Topology · Mathematics 2022-12-23 Jean Goubault-Larrecq

We present a finitary version of Moss' coalgebraic logic for $T$-coalgebras, where $T$ is a locally monotone endofunctor of the category of posets and monotone maps. The logic uses a single cover modality whose arity is given by the least…

Logic in Computer Science · Computer Science 2023-06-22 Marta Bílková , Matěj Dostál

We introduce a generic expression language describing behaviours of finite coalgebras over sets; besides relational systems, this covers, e.g., weighted, probabilistic, and neighbourhood-based system types. We prove a generic Kleene-type…

Logic in Computer Science · Computer Science 2018-05-21 Ulrich Dorsch , Stefan Milius , Lutz Schröder , Thorsten Wißmann

The Kantorovich exponential sampling series at jump discontinuities of the bounded measurable signal f has been analysed. A representation lemma for the series is established and using this lemma certain approximation theorems for…

Functional Analysis · Mathematics 2021-02-09 A. Sathish Kumar , Prashant Kumar , P. Devaraj

Experimental results presented in this paper supports the hypothesis on quantum-like statistical behaviour of cognitive systems (at least human beings). Our quantum-like approach gives the possibility to represent mental states by Hilbert…

Deterministic automata have been traditionally studied through the point of view of language equivalence, but another perspective is given by the canonical notion of shortest-distinguishing-word distance quantifying the of states.…

Logic in Computer Science · Computer Science 2024-04-23 Wojciech Różowski

The fundamental lemma by Jan C. Willems and co-workers, which is deeply rooted in behavioral systems theory, has become one of the supporting pillars of the recent progress on data-driven control and system analysis. This tutorial-style…

Optimization and Control · Mathematics 2023-05-01 Timm Faulwasser , Ruchuan Ou , Guanru Pan , Philipp Schmitz , Karl Worthmann