English
Related papers

Related papers: Mixed powerdomains for probability and nondetermin…

200 papers

We define antidomain operations for algebras of multiplace partial functions. For all signatures containing composition, the antidomain operations and any subset of intersection, preferential union and fixset, we give finite equational or…

Rings and Algebras · Mathematics 2017-09-19 Brett McLean

We investigate the power of non-determinism in purely functional programming languages with higher-order types. Specifically, we set out to characterise the hierarchy NP $\subseteq$ NEXP $\subseteq$ NEXP$^{(2)}$ $\subseteq \cdots \subseteq$…

Logic in Computer Science · Computer Science 2017-11-16 Cynthia Kop

The purpose of this paper is to give a characterization for polynomials and rational functions which admit only non-negative values on definable sets in real closed valued fields. That is, generalizing the relative positivstellens\"atze for…

Algebraic Geometry · Mathematics 2014-07-29 Noa Lavi

Consider a tensor product of free algebras over a field $k$, the so-called multipartite free algebra $A=k \langle X^{(1)}\rangle\otimes\cdots\otimes k\langle X^{(G)}\rangle$. It is well-known that $A$ is a domain, but not a fir nor even a…

Rings and Algebras · Mathematics 2020-12-07 Igor Klep , Victor Vinnikov , Jurij Volčič

We study a class of preference domains that satisfies the familiar properties of minimal richness, diversity and no-restoration. We show that a specific preference restriction, hybridness, has been embedded in these domains so that the…

Theoretical Economics · Economics 2022-01-05 Shurojit Chatterji , Souvik Roy , Soumyarup Sadhukhan , Arunava Sen , Huaxia Zeng

In this paper, we shall prove that the integral subalgebra generated by the divided powers of the Drinfeld generators of an affine Kac-Moody algebra is an integral form. We compare this integral form with the analogous one derived from the…

Representation Theory · Mathematics 2024-09-23 Margherita Paolini

Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal term-generated model for the…

Artificial Intelligence · Computer Science 2009-11-30 Matthias Horbach , Christoph Weidenbach

We give an analytical approach to the definition of additive and multiplicative free convolutions which is based on the theory of Nevanlinna and of Schur functions. We consider the set of probability distributions as a semigroup $\bold M$…

Operator Algebras · Mathematics 2010-10-12 G. Chistyakov , F. Götze

The theory of noninterference supports the analysis of secure computations in multi-level security systems. Classical equivalence-based approaches to noninterference mainly rely on bisimilarity. In a nondeterministic setting, assessing…

Cryptography and Security · Computer Science 2026-05-05 Andrea Esposito , Alessandro Aldini , Marco Bernardo

We propose a reformulation of some results known on the free dendriform dialgebra on one generator from a parenthesis point of view. This turns out to be more tractable and point out a connection to free probability by identifying…

Combinatorics · Mathematics 2007-05-23 Leroux Philippe

A classical approach to formal policy synthesis in stochastic dynamical systems is to construct a finite-state abstraction, often represented as a Markov decision process (MDP). The correctness of these approaches hinges on a behavioural…

Systems and Control · Electrical Eng. & Systems 2025-08-08 Thom Badings , Alessandro Abate

Decomposable models and Bayesian networks can be defined as sequences of oligo-dimensional probability measures connected with operators of composition. The preliminary results suggest that the probabilistic models allowing for effective…

Artificial Intelligence · Computer Science 2013-02-08 Radim Jirousek

We show how to provide a structure of probability space to the set of execution traces on a non-confluent abstract rewrite system, by defining a variant of a Lebesgue measure on the space of traces. Then, we show how to use this probability…

Logic in Computer Science · Computer Science 2014-04-02 Alejandro Díaz-Caro , Gilles Dowek

In probabilistic reasoning, the traditionally discrete domain has been elevated to the hybrid domain encompassing additionally continuous random variables. Inference in the hybrid domain, however, usually necessitates to condone trade-offs…

Artificial Intelligence · Computer Science 2018-07-13 Pedro Zuidberg Dos Martires , Anton Dries , Luc De Raedt

The purpose of this article is to provide an exposition of domains of convergence of power series of several complex variables without recourse to relatively advanced notions of convexity.

Complex Variables · Mathematics 2016-04-01 G. P. Balakumar

Two groups of naturally arising questions in the mathematical theory of domains for denotational semantics are addressed. Domains are equipped with Scott topology and represent data types. Scott continuous functions represent computable…

Logic in Computer Science · Computer Science 2015-12-15 Michael A. Bukatin

One of the main applications of free probability is to show that for appropriately chosen independent copies of $d$ random matrix models, any noncommutative polynomial in these $d$ variables has a spectral distribution that converges…

Operator Algebras · Mathematics 2023-10-25 Benoît Collins , Tobias Mai , Akihiro Miyagawa , Félix Parraud , Sheng Yin

This work is divided between two main areas: in the theory of multialgebras, we focus mostly on a new definition of what a freely generated object should be in their category, and on how this category is equivalent to another with partially…

Logic · Mathematics 2022-06-23 Guilherme Vicentin de Toledo

In this work we undertake an extension of various aspects of the potential theory of Dirichlet forms from locally compact spaces to noncommutative C*-algebras with trace. In particular we introduce finite-energy states, potentials and…

Operator Algebras · Mathematics 2021-06-01 Fabio Cipriani , Jean-Luc Sauvageot

A basic experiment in probability theory is drawing without replacement from an urn filled with multiple balls of different colours. Clearly, it is physically impossible to overdraw, that is, to draw more balls from the urn than it…

Probability · Mathematics 2023-12-21 Bart Jacobs , Dario Stein
‹ Prev 1 3 4 5 6 7 10 Next ›