English
Related papers

Related papers: Lexicographic probability, conditional probability…

200 papers

Composite likelihoods are a class of alternatives to the full likelihood which are widely used in many situations in which the likelihood itself is intractable. A composite likelihood may be computed without the need to specify the full…

Statistics Theory · Mathematics 2014-01-08 Helen Ogden

Quantum mechanics contains some strange unphysical concepts. Among these are complex numbers, Hilbert spaces with their unitary and self-adjoint operators, states represented by complex vectors, superpositions of states, collapse of wave…

Quantum Physics · Physics 2026-03-31 Stan Gudder

We calculate the probability that random polynomial matrices over a finite field with certain structures are right prime or left prime, respectively. In particular, we give an asymptotic formula for the probability that finitely many…

Dynamical Systems · Mathematics 2017-04-07 Julia Lieb

We define a probabilistic programming language for Gaussian random variables with a first-class exact conditioning construct. We give operational, denotational and equational semantics for this language, establishing convenient properties…

Programming Languages · Computer Science 2021-01-28 Dario Stein , Sam Staton

Larsen and Skou characterized probabilistic bisimilarity over reactive probabilistic systems with a logic including true, negation, conjunction, and a diamond modality decorated with a probabilistic lower bound. Later on, Desharnais,…

Logic in Computer Science · Computer Science 2016-10-25 Marco Bernardo , Marino Miculan

We describe a mathematical language for determining all possible patterns of contextuality in the dependence of stochastic outputs of a system on its deterministic inputs. The central notion is that of all possible couplings for…

Mathematical Physics · Physics 2015-01-27 Ehtibar N. Dzhafarov , Janne V. Kujala

Probabilistic context-free grammars have a long-term record of use as generative models in machine learning and symbolic regression. When used for symbolic regression, they generate algebraic expressions. We define the latter as equivalence…

Formal Languages and Automata Theory · Computer Science 2022-12-05 Urh Primožič , Ljupčo Todorovski , Matej Petković

Synchronous languages are now a standard industry tool for critical embedded systems. Designers write high-level specifications by composing streams of values using block diagrams. These languages have been extended with Bayesian reasoning…

Programming Languages · Computer Science 2023-09-11 Guillaume Baudart , Louis Mandel , Christine Tasson

Let $L$ be a convex cone of real random variables on the probability space $(\Omega,\mathcal{A},P_0)$. The existence of a probability $P$ on $\mathcal{A}$ such that $$ P \sim P_0,\quad E_P \abs{X}< \infty\, \text{ and } \, E_P(X) \leq 0\,…

Probability · Mathematics 2014-02-17 Patrizia Berti , Luca Pratelli , Pietro Rigo

Probabilistic programming has become a standard practice to model stochastic events and learn about the behavior of nature in different scientific contexts, ranging from Genetics and Ecology to Linguistics and Psychology. However, domain…

Programming Languages · Computer Science 2025-07-10 Guilherme Espada , Alcides Fonseca

Basic Parallel Processes (BPPs) are a well-known subclass of Petri Nets. They are the simplest common model of concurrent programs that allows unbounded spawning of processes. In the probabilistic version of BPPs, every process generates…

Logic in Computer Science · Computer Science 2014-01-17 Rémi Bonnet , Stefan Kiefer , Anthony W. Lin

By probabilistic means, the concept of contextuality is extended so that it can be used in non-ideal situations. An inequality is presented, which at least in principle enables a test to discard non-contextual hidden-variable models at low…

Quantum Physics · Physics 2022-03-16 Jan-Åke Larsson

The probabilities of causation are commonly used to solve decision-making problems. Tian and Pearl derived sharp bounds for the probability of necessity and sufficiency (PNS), the probability of sufficiency (PS), and the probability of…

Artificial Intelligence · Computer Science 2022-10-12 Ang Li , Ruirui Mao , Judea Pearl

Conditional acceptability refers to how plausible a conditional statement is perceived to be. It plays an important role in communication and reasoning, as it influences how individuals interpret implications, assess arguments, and make…

Computation and Language · Computer Science 2026-03-20 Jasmin Orth , Philipp Mondorf , Barbara Plank

In this paper we introduce RankPL, a modeling language that can be thought of as a qualitative variant of a probabilistic programming language with a semantics based on Spohn's ranking theory. Broadly speaking, RankPL can be used to…

Artificial Intelligence · Computer Science 2017-05-23 Tjitze Rienstra

In Probabilistic Logic Nilsson uses the device of a probability distribution over a set of possible worlds to assign probabilities to the sentences of a logical language. In his paper Nilsson concentrated on inference and associated…

Artificial Intelligence · Computer Science 2013-04-10 Fahiem Bacchus

Topological models of empirical and formal inquiry are increasingly prevalent. They have emerged in such diverse fields as domain theory [1, 16], formal learning theory [18], epistemology and philosophy of science [10, 15, 8, 9, 2],…

Machine Learning · Computer Science 2017-08-01 Konstantin Genin , Kevin T. Kelly

Contextuality and nonlocality are non-classical properties exhibited by quantum statistics whose implications profoundly impact both foundations and applications of quantum theory. In this paper we provide some insights into logical…

Quantum Physics · Physics 2021-08-11 Leonardo Santos , Barbara Amaral

Works, briefly surveyed here, are concerned with two basic methods: Maximum Probability and Bayesian Maximum Probability; as well as with their asymptotic instances: Relative Entropy Maximization and Maximum Non-parametric Likelihood.…

Statistics Theory · Mathematics 2008-04-25 M. Grendar

Linear representations for a subclass of boolean symmetric functions selected by a parity condition are shown to constitute a generalization of the linear constraints on probabilities introduced by Boole. These linear constraints are…

Artificial Intelligence · Computer Science 2013-04-12 Silvio Ursic