English
Related papers

Related papers: The probability of non-confluent systems

200 papers

Coalgebras in a Kleisli category yield a generic definition of trace semantics for various types of labelled transition systems. In this paper we apply this generic theory to generative probabilistic transition systems, short PTS, with…

Logic in Computer Science · Computer Science 2015-07-01 Henning Kerstan , Barbara König

We study functional and concurrent calculi with non-determinism, along with type systems to control resources based on linearity. The interplay between non-determinism and linearity is delicate: careless handling of branches can discard…

Logic in Computer Science · Computer Science 2023-10-02 Bas van den Heuvel , Joseph W. N. Paulus , Daniele Nantes-Sobrinho , Jorge A. Pérez

This report outlines an approach to learning generative models from data. We express models as probabilistic programs, which allows us to capture abstract patterns within the examples. By choosing our language for programs to be an…

Artificial Intelligence · Computer Science 2011-10-27 Irvin Hwang , Andreas Stuhlmüller , Noah D. Goodman

This paper shows how to compute, for probabilistic hybrid systems, the clock approximation and linear phase-portrait approximation that have been proposed for non probabilistic processes by Henzinger et al. The techniques permit to define a…

Logic in Computer Science · Computer Science 2011-07-07 Joseph Assouramou , Josée Desharnais

The combination of argumentation and probability paves the way to new accounts of qualitative and quantitative uncertainty, thereby offering new theoretical and applicative opportunities. Due to a variety of interests, probabilistic…

Artificial Intelligence · Computer Science 2018-03-12 Regis Riveret , Pietro Baroni , Yang Gao , Guido Governatori , Antonino Rotolo , Giovanni Sartor

A central feature of quantum mechanics is the non-commutativity of operators used to describe physical observables. In this article, we present a critical analysis on the role of non-commutativity in quantum theory, focusing on its…

Quantum Physics · Physics 2018-03-20 Luca Curcuraci

Non-parametric methods avoid the problem of having to specify a particular data generating mechanism, but can be computationally intensive, reducing their accessibility for large data problems. Empirical likelihood, a non-parametric…

Computation · Statistics 2017-12-15 Adam Jaeger , Nicole Lazar

The likelihood function plays a pivotal role in statistical inference; it is adaptable to a wide range of models and the resultant estimators are known to have good properties. However, these results hinge on correct specification of the…

Statistics Theory · Mathematics 2017-12-15 Adam Jaeger , Nicole Lazar

We introduce a contextual quantum system comprising mutually complementary observables organized into two or more collections of pseudocontexts with the same probability sums of outcomes. These pseudocontexts constitute non-orthogonal bases…

Quantum Physics · Physics 2024-04-05 Mirko Navara , Karl Svozil

In this paper a new general approach is developed to construct and study Lebesgue type decompositions of linear operators $T$ in the Hilbert space setting. The new approach allows to introduce an essentially wider class of Lebesgue type…

Functional Analysis · Mathematics 2023-09-20 Seppo Hassi , Henk de Snoo

We consider a piecewise smooth expanding map of the interval possessing two invariant subsets of positive Lebesgue measure and exactly two ergodic absolutely continuous invariant probability measures (ACIMs). When this system is perturbed…

Dynamical Systems · Mathematics 2013-02-05 Cecilia González Tokman , Brian R. Hunt , Paul Wright

Probabilistic operational semantics for a nondeterministic extension of pure lambda calculus is studied. In this semantics, a term evaluates to a (finite or infinite) distribution of values. Small-step and big-step semantics are both…

Logic in Computer Science · Computer Science 2011-06-28 Ugo Dal Lago , Margherita Zorzi

Labeled transition systems are typically used to represent the behavior of nondeterministic processes, with labeled transitions defining a one-step state to-state reachability relation. This model has been recently made more general by…

Distributed, Parallel, and Cluster Computing · Computer Science 2011-08-10 Marco Bernardo , Rocco De Nicola , Michele Loreti

Any symmetric affinity function $w: V\times V \to \mathbb{R}_+$ defined on a discrete set $V$ induces Euclidean space structure on $V$. In particular, an undirected graph specified by an affinity (or adjacency) matrix can be considered as a…

Mathematical Physics · Physics 2008-04-29 Ph. Blanchard , D. Volchenkov

Computing the probability of a formula given the probabilities or weights associated with other formulas is a natural extension of logical inference to the probabilistic setting. Surprisingly, this problem has received little attention in…

Artificial Intelligence · Computer Science 2012-03-19 Vibhav Gogate , Pedro Domingos

We present abstraction techniques that transform a given non-linear dynamical system into a linear system or an algebraic system described by polynomials of bounded degree, such that, invariant properties of the resulting abstraction can be…

Symbolic Computation · Computer Science 2012-04-20 Sriram Sankaranarayanan

We show from a categorical point of view that probability measures on certain measurable or topological spaces arise canonically as the extension of probability distributions on countable sets. We do this by constructing probability monads…

Category Theory · Mathematics 2022-06-23 Ruben Van Belle

As physics searches for invariants in observations, this paper looks for invariants of probabilistic observation without assuming physical structure. Structure emerges from the basic assumption of science that new information shall lead to…

Quantum Physics · Physics 2007-05-23 Johann Summhammer

The relationship between Popper spaces (conditional probability spaces that satisfy some regularity conditions), lexicographic probability systems (LPS's), and nonstandard probability spaces (NPS's) is considered. If countable additivity is…

Computer Science and Game Theory · Computer Science 2009-04-22 Joseph Y. Halpern

Probabilistic embeddings have several advantages over deterministic embeddings as they map each data point to a distribution, which better describes the uncertainty and complexity of data. Many works focus on adjusting the distribution…

Artificial Intelligence · Computer Science 2024-12-16 Xiang Huang , Hao Peng , Li Sun , Hui Lin , Chunyang Liu , Jiang Cao , Philip S. Yu
‹ Prev 1 3 4 5 6 7 10 Next ›