English
Related papers

Related papers: Partial Probability and Kleene Logic

200 papers

A structural theorem for Kleene algebras is proved, showing that an element of a Kleene algebra can be looked upon as an ordered pair of sets. Further, we show that negation with the Kleene property (called the `Kleene negation') always…

Logic · Mathematics 2020-07-24 Arun Kumar , Mohua Banerjee

We introduce an expressive probabilistic temporal epistemic logic PTEL suitable to reason about uncertain knowledge of a non-rigid set of agents that can be changed during time. We define semantics for PTEL as Kripke models with epistemic…

Logic · Mathematics 2021-05-27 Zoran Ognjanović , Angelina Ilić Stepić , Aleksandar Perović

Large language models (LLMs) exhibit probabilistic output characteristics, yet conventional evaluation frameworks rely on deterministic scalar metrics. This study introduces a Bayesian approach for LLM capability assessment that integrates…

Computation and Language · Computer Science 2025-05-01 Xiao Xiao , Yu Su , Sijing Zhang , Zhang Chen , Yadong Chen , Tian Liu

We develop a systematic approach to quantum probability as a theory of rational betting in quantum gambles. In these games of chance the agent is betting in advance on the outcomes of several (finitely many) incompatible measurements. One…

Quantum Physics · Physics 2007-05-23 I. Pitowsky

In this paper (propositional) probability logic ($PL$) is investigated from model theoretic point of view. First of all, the ultraproduct construction is adapted for $\sigma$-additive probability models, and subsequently when this class of…

Logic · Mathematics 2018-10-18 Massoud Pourmahdian , Reihane Zoghifard

Previous derivations of the sum and product rules of probability theory relied on the algebraic properties of Boolean logic. Here they are derived within a more general framework based on lattice theory. The result is a new foundation of…

General Mathematics · Mathematics 2015-05-14 Kevin H. Knuth

The propositional logic is generalized on the real numbers field. the logical function with all properties of the classical probability function is obtained. The logical analog of the Bernoulli independent tests scheme is constructed. The…

General Mathematics · Mathematics 2007-05-23 G. A. Quznetsov

This work proposes a view of probability as a relative measure rather than an absolute one. To demonstrate this concept, we focus on finite outcome spaces and develop three fundamental axioms that establish requirements for relative…

Machine Learning · Statistics 2023-05-30 Max Sklar

A distinction is sometimes made between "statistical" and "subjective" probabilities. This is based on a distinction between "unique" events and "repeatable" events. We argue that this distinction is untenable, since all events are "unique"…

Artificial Intelligence · Computer Science 2013-04-11 Henry E. Kyburg

Classical statistics and Bayesian statistics refer to the frequentist and subjective theories of probability respectively. Von Mises and De Finetti, who authored those conceptualizations, provide interpretations of the probability that…

Probability · Mathematics 2013-01-24 Paolo Rocchi , Leonida Gianfagna

We provide an extension of concurrent Kleene algebras to account for probabilistic properties. The algebra yields a unified framework containing nondeterminism, concurrency and probability and is sound with respect to the set of…

Logic in Computer Science · Computer Science 2013-06-13 Annabelle McIver , Tahiry Rabehaja , Georg Struth

In this talk - based on the results of a forthcoming paper (Coletti, Scozzafava and Vantaggi 2002), presented also by one of us at the Conference on "Non Classical Logic, Approximate Reasoning and Soft-Computing" (Anacapri, Italy, 2001) -…

Probability · Mathematics 2007-05-23 Giulianella Coletti , Romano Scozzafava , Barbara Vantaggi

Probabilities may be subjective or objective; we are concerned with both kinds of probability, and the relationship between them. The fundamental theory of objective probability is quantum mechanics: it is argued that neither Bohr's…

Quantum Physics · Physics 2015-06-26 Simon Saunders

We propose a novel Bayesian nonparametric classification model that combines a Gaussian process prior for the latent function with a Dirichlet process prior for the link function, extending the interpretative framework of de Finetti…

Methodology · Statistics 2025-08-26 Marcio Alves Diniz

This paper investigates the possibility of performing automated reasoning in probabilistic logic when probabilities are expressed by means of linguistic quantifiers. Each linguistic term is expressed as a prescribed interval of proportions.…

Artificial Intelligence · Computer Science 2013-03-25 Didier Dubois , Henri Prade , Lluis Godo , Ramon Lopez de Mantaras

We present a domain-theoretic framework for probabilistic programming that provides a constructive definition of conditional probability and addresses computability challenges previously identified in the literature. We introduce a novel…

Logic in Computer Science · Computer Science 2025-02-04 Pietro Di Gianantonio , Abbas Edalat

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

The standard approach to logic in the literature in philosophy and mathematics, which has also been adopted in computer science, is to define a language (the syntax), an appropriate class of models together with an interpretation of…

Artificial Intelligence · Computer Science 2009-09-25 Joseph Y. Halpern

We consider the problem of rational uncertainty about unproven mathematical statements, remarked on by G\"odel and others. Using Bayesian-inspired arguments we build a normative model of fair bets under deductive uncertainty which draws…

Artificial Intelligence · Computer Science 2019-12-17 Andrew MacFie

We present new results on the relation between purely symbolic context-free parsing strategies and their probabilistic counter-parts. Such parsing strategies are seen as constructions of push-down devices from grammars. We show that…

Computation and Language · Computer Science 2007-05-23 Mark-Jan Nederhof , Giorgio Satta
‹ Prev 1 3 4 5 6 7 10 Next ›