English
Related papers

Related papers: Probability Logic: A Model Theoretic Perspective

200 papers

Metrics of model goodness-of-fit, model comparison, and model parameter estimation are the main categories of statistical problems in science. Bayesian and frequentist methods that address these questions often rely on a likelihood…

Data Analysis, Statistics and Probability · Physics 2019-06-26 Carlos A. Argüelles , Austin Schneider , Tianlu Yuan

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 introduce a new semantics for justification logic based on subset relations. Instead of using the established and more symbolic interpretation of justifications, we model justifications as sets of possible worlds. We introduce a new…

Logic · Mathematics 2020-08-19 Eveline Lehmann , Thomas Studer

Probability-like parameters appearing in some statistical models, and their prior distributions, are reinterpreted through the notion of `circumstance', a term which stands for any piece of knowledge that is useful in assigning a…

Quantum Physics · Physics 2007-05-23 P. G. L. Porta Mana , A. Månsson , G. Björk

While probability theory is normally applied to external environments, there has been some recent interest in probabilistic modeling of the outputs of computations that are too expensive to run. Since mathematical logic is a powerful tool…

Artificial Intelligence · Computer Science 2016-10-10 Scott Garrabrant , Benya Fallenstein , Abram Demski , Nate Soares

In this paper we formulate a probabilistic model for class-specific discriminant subspace learning. The proposed model can naturally incorporate the multi-modal structure of the negative class, which is neglected by existing class-specific…

Machine Learning · Computer Science 2020-10-06 Alexandros Iosifidis

We introduce two extensions of the $\lambda$-calculus with a probabilistic choice operator, $\Lambda_\oplus^{cbv}$ and $\Lambda_\oplus^{cbn}$, modeling respectively call-by-value and call-by-name probabilistic computation. We prove that…

Logic in Computer Science · Computer Science 2019-05-13 Claudia Faggian , Simona Ronchi della Rocca

Many real world domains require the representation of a measure of uncertainty. The most common such representation is probability, and the combination of probability with logic programs has given rise to the field of Probabilistic Logic…

Artificial Intelligence · Computer Science 2011-07-26 Fabrizio Riguzzi , Terrance Swift

Probabilistic independence is a useful concept for describing the result of random sampling---a basic operation in all probabilistic languages---and for reasoning about groups of random variables. Nevertheless, existing verification methods…

Programming Languages · Computer Science 2020-07-21 Gilles Barthe , Justin Hsu , Kevin Liao

We extend the theoretical framework of proof mining by establishing general logical metatheorems that allow for the extraction of the computational content of theorems with prima facie "non-computational" proofs from probability theory,…

Logic · Mathematics 2026-01-14 Morenikeji Neri , Nicholas Pischke

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 Logic Programming (PLP) under the Distribution Semantics is a leading approach to practical reasoning under uncertainty. An advantage of the Distribution Semantics is its suitability for implementation as a Prolog or Python…

Logic in Computer Science · Computer Science 2026-01-14 Damiano Azzolini , Fabrizio Riguzzi , Theresa Swift

Markov logic uses weighted formulas to compactly encode a probability distribution over possible worlds. Despite the use of logical formulas, Markov logic networks (MLNs) can be difficult to interpret, due to the often counter-intuitive…

Artificial Intelligence · Computer Science 2015-06-09 Ondrej Kuzelka , Jesse Davis , Steven Schockaert

In this article we demonstrate how algorithmic probability theory is applied to situations that involve uncertainty. When people are unsure of their model of reality, then the outcome they observe will cause them to update their beliefs. We…

Artificial Intelligence · Computer Science 2014-05-26 Phil Maguire , Philippe Moser , Rebecca Maguire , Mark Keane

A co-valuation is, essentially, a minimal finite cover. We introduce a logic based on co-valuations, which play the role of valuations of free variables in classical first-order logic, and show that the fundamental tools of model theory --…

Logic · Mathematics 2026-01-06 Maciej Malicki

We present a propositional logic %which can be used to reason about the uncertainty of events, where the uncertainty is modeled by a set of probability measures assigning an interval of probability to each event. We give a sound and…

Artificial Intelligence · Computer Science 2007-05-23 Joseph Y. Halpern , Riccardo Pucella

In this paper, we propose a new logic for expressing and reasoning about probabilistic hyperproperties. Hyperproperties characterize the relation between different independent executions of a system. Probabilistic hyperproperties express…

Logic in Computer Science · Computer Science 2018-04-06 Erika Abraham , Borzoo Bonakdarpour

There are different approaches to qualitative probability, which includes subjective probability. We developed a representation of qualitative probability based on relational systems, which allows modeling uncertainty by probability…

Probability · Mathematics 2017-03-01 Mark Burgin

Potentialism is the view that objects are successively generated in an incompletable process. A strict version of the view adds that truths are successively determined. Strict potentialism can be analyzed using two modalities: one for the…

Logic · Mathematics 2026-04-21 Øystein Linnebo

We introduce the $\Sigma_1$-definable universal finite sequence and prove that it exhibits the universal extension property amongst the countable models of set theory under end-extension. That is, (i) the sequence is $\Sigma_1$-definable…

Logic · Mathematics 2020-11-11 Joel David Hamkins , Kameryn J. Williams
‹ Prev 1 4 5 6 7 8 10 Next ›