English
Related papers

Related papers: Probabilities with Gaps and Gluts

200 papers

Automated reasoning about uncertain knowledge has many applications. One difficulty when developing such systems is the lack of a completely satisfactory integration of logic and probability. We address this problem directly. Expressive…

Logic in Computer Science · Computer Science 2012-09-13 Marcus Hutter , John W. Lloyd , Kee Siong Ng , William T. B. Uther

Modern applications of conformal inference to multiple testing problems, such as outlier detection and candidate selection, often involve selecting test samples whose conformal p-values fall below a threshold. The quality of such methods is…

Methodology · Statistics 2026-05-21 Ziang Song , Ying Jin , Emmanuel J. Candès

Abstract argumentation offers an appealing way of representing and evaluating arguments and counterarguments. This approach can be enhanced by a probability assignment to each argument. There are various interpretations that can be ascribed…

Artificial Intelligence · Computer Science 2014-05-15 Anthony Hunter , Matthias Thimm

Recently, it has been shown that probabilistic entailment under coherence is weaker than model-theoretic probabilistic entailment. Moreover, probabilistic entailment under coherence is a generalization of default entailment in System P. In…

Artificial Intelligence · Computer Science 2007-05-23 Thomas Lukasiewicz

When multiple hypotheses are tested, interest is often in ensuring that the proportion of false discoveries (FDP) is small with high confidence. In this paper, confidence upper bounds for the FDP are constructed, which are simultaneous over…

Methodology · Statistics 2020-01-07 Jesse Hemerik , Aldo Solari , Jelle J. Goeman

When prior information is lacking, the go-to strategy for probabilistic inference is to combine a "default prior" and the likelihood via Bayes's theorem. Objective Bayes, (generalized) fiducial inference, etc. fall under this umbrella. This…

Methodology · Statistics 2026-01-05 Ryan Martin

In Dempster-Shafer belief theory, general beliefs are expressed as belief mass distribution functions over frames of discernment. In Subjective Logic beliefs are expressed as belief mass distribution functions over binary frames of…

Artificial Intelligence · Computer Science 2007-05-23 Audun Josang

I propose a normative updating rule, extended Bayesianism, for the incorporation of probabilistic information arising from the process of becoming more aware. Extended Bayesianism generalizes standard Bayesian updating to allow the…

Theoretical Economics · Economics 2021-10-06 Evan Piermont

In real-world applications, knowledge bases consisting of all the information at hand for a specific domain, along with the current state of affairs, are bound to contain contradictory data coming from different sources, as well as data…

Logic in Computer Science · Computer Science 2014-01-08 Paulo Shakarian , Gerardo I. Simari , Marcelo A. Falappa

It is argued that 4-valued paraconsistent truth values (called here "p-bits") can serve as a conceptual, mathematical and practical foundation for highly AI-relevant forms of probabilistic logic and probabilistic programming and concept…

Artificial Intelligence · Computer Science 2021-01-15 Ben Goertzel

Possibilistic logic is a well-known graded logic of uncertainty suitable to reason under incomplete information and partially inconsistent knowledge, which is built upon classical first order logic. There exists for Possibilistic logic a…

Artificial Intelligence · Computer Science 2013-01-31 Teresa Alsinet , Lluis Godo , Sandra Sandri

The thesis of this paper is that truth-relevant logic is a better foundation for mathematics than classical logic. It is a system proposed by Richard Diaz in 1981. In a certain sense t-relevant logic is based on Kleene strong tables. These…

Logic · Mathematics 2023-02-14 X. Y. Newberry

The purpose of this article is to formulate a number of probabilistic hidden-variable theorems, to provide proofs in some cases, and counterexamples to some conjectured relationships. The first theorem is the fundamental one. It asserts the…

Quantum Physics · Physics 2008-02-03 Patrick Suppes , J. Acacio de Barros , Gary Oas

In the paper, the question whether truth values can be assigned to the propositions before their verification is discussed. To answer this question, a notion of a propositionally noncontextual theory is introduced that in order to explain…

Quantum Physics · Physics 2017-09-27 Arkady Bolotin

Binary classification is a task that involves the classification of data into one of two distinct classes. It is widely utilized in various fields. However, conventional classifiers tend to make overconfident predictions for data that…

Machine Learning · Computer Science 2025-03-13 Shoma Yokura , Akihisa Ichiki

We consider finite relational signatures $\tau \subseteq \sigma$, a sequence of finite base $\tau$-structures $(\mathcal{B}_n : n \in \mathbb{N})$ the cardinalities of which tend to infinity and such that, for some number $\Delta$, the…

Logic · Mathematics 2025-11-11 Vera Koponen

Analysis of credibility is a reverse-Bayes technique that has been proposed by Matthews (2001) to overcome some of the shortcomings of significance tests. A significant result is deemed credible if current knowledge about the effect size is…

Methodology · Statistics 2017-12-11 Leonhard Held

We analyze boundedly rational updating from aggregate statistics in a model with binary actions and binary states. Agents each take an irreversible action in sequence after observing the unordered set of previous actions. Each agent first…

Machine Learning · Computer Science 2021-01-11 Itai Arieli , Yakov Babichenko , Manuel Mueller-Frank

Expectation is a central notion in probability theory. The notion of expectation also makes sense for other notions of uncertainty. We introduce a propositional logic for reasoning about expectation, where the semantics depends on the…

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

We present a logic for reasoning with if-then formulas which involve constants for rational truth degrees from the unit interval. We introduce graded semantic and syntactic entailment of formulas. We prove the logic is complete in Pavelka…

Logic in Computer Science · Computer Science 2015-02-26 Vilem Vychodil