English
Related papers

Related papers: Bipolar Possibilistic Representations

200 papers

This paper considers the notion of possible events which are insignificant in probabilistic analysis (i.e. events that have zero probability). The paper discusses the method of modal logic based on "possible worlds" and discusses a…

Other Statistics · Statistics 2022-11-08 Ben O'Neill

Given a universe of discourse X-a domain of possible outcomes-an experiment may consist of selecting one of its elements, subject to the operation of chance, or of observing the elements, subject to imprecision. A priori uncertainty about…

Artificial Intelligence · Computer Science 2013-03-26 Arthur Ramer

Inspired by the theory of desirable gambles that is used to model uncertainty in the field of imprecise probabilities, I present a theory of desirable things. Its aim is to model a subject's beliefs about which things are desirable. What…

Artificial Intelligence · Computer Science 2023-05-12 Jasper De Bock

Attempts to replicate probabilistic reasoning in expert systems have typically overlooked a critical ingredient of that process. Probabilistic analysis typically requires extensive judgments regarding interdependencies among hypotheses and…

Artificial Intelligence · Computer Science 2013-04-15 Marvin S. Cohen

We recently described a formalism for reasoning with if-then rules that re expressed with different levels of firmness [18]. The formalism interprets these rules as extreme conditional probability statements, specifying orders of magnitude…

Artificial Intelligence · Computer Science 2013-03-25 Moises Goldszmidt , Judea Pearl

Confirmation bias is a cognitive bias that adversely affects management decisions, and mathematical modelling is an aid to its detailed understanding. Bias in opinion update about the value of a parameter is modelled here assuming that…

Other Statistics · Statistics 2022-02-08 Rose D Baker

In computer science, various logical languages are defined to analyze properties of systems. One way to pinpoint the essential differences between those logics is to compare their expressivity in terms of distinguishing power and expressive…

Logic in Computer Science · Computer Science 2009-05-28 Yanjing Wang , Francien Dechesne

In the interpretation of experimental data, one is actually looking for plausible explanations. We look for a measure of plausibility, with which we can compare different possible explanations, and which can be combined when there are…

Artificial Intelligence · Computer Science 2010-12-30 Wan Ahmad Tajuddin Wan Abdullah

Accepting a proposition means that our confidence in this proposition is strictly greater than the confidence in its negation. This paper investigates the subclass of uncertainty measures, expressing confidence, that capture the idea of…

Artificial Intelligence · Computer Science 2013-02-21 Didier Dubois , Henri Prade

If uncertainty is modelled by a probability measure, decisions are typically made by choosing the option with the highest expected utility. If an imprecise probability model is used instead, this decision rule can be generalised in several…

Artificial Intelligence · Computer Science 2020-03-27 Jasper De Bock

The reasoning with qualitative uncertainty measures involves comparative statements about events in terms of their likeliness without necessarily assigning an exact numerical value to these events. The paper is divided into two parts. In…

Logic · Mathematics 2024-03-18 Marta Bilkova , Sabine Frittella , Daniil Kozhemiachenko , Ondrej Majer

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

Interestingness is an important criterion by which we judge knowledge discovery. But, interestingness has escaped all attempts to capture its intuitive meaning into a concise and comprehensive form. A unifying paradigm is formulated by…

Information Retrieval · Computer Science 2014-04-03 Iaakov Exman

A general notion of algebraic conditional plausibility measures is defined. Probability measures, ranking functions, possibility measures, and (under the appropriate definitions) sets of probability measures can all be viewed as defining…

Artificial Intelligence · Computer Science 2011-06-16 Joseph Y. Halpern

In this paper, the concept of possibilistic evidence which is a possibility distribution as well as a body of evidence is proposed over an infinite universe of discourse. The inference with possibilistic evidence is investigated based on a…

Artificial Intelligence · Computer Science 2013-03-08 Fengming Song , Ping Liang

Weighted bipolar argumentation frameworks offer a tool for decision support and social media analysis. Arguments are evaluated by an iterative procedure that takes initial weights and attack and support relations into account. Until…

Artificial Intelligence · Computer Science 2019-03-04 Nico Potyka

An important issue in concurrency is interference. This issue manifests itself in both shared-variable and communication-based concurrency --- this paper focusses on the former case where interference is caused by the environment of a…

Logic in Computer Science · Computer Science 2016-01-12 Cliff B. Jones , Ian J. Hayes

Probing (or diagnostic classification) has become a popular strategy for investigating whether a given set of intermediate features is present in the representations of neural models. Probing studies may have misleading results, but various…

Machine Learning · Computer Science 2021-10-01 Deborah Ferreira , Julia Rozanova , Mokanarangan Thayaparan , Marco Valentino , André Freitas

We describe the interface between measure theoretic probability and causal inference by constructing causal models on probability spaces within the potential outcomes framework. We find that measure theory provides a precise and instructive…

Statistics Theory · Mathematics 2019-07-04 Irineo Cabreros , John D. Storey

We study a model of temporal voting where there is a fixed time horizon, and at each round the voters report their preferences over the available candidates and a single candidate is selected. Prior work has adapted popular notions of…

Computer Science and Game Theory · Computer Science 2025-02-11 Edith Elkind , Svetlana Obraztsova , Jannik Peters , Nicholas Teh