Magic Inference Rules for Probabilistic Deduction under Taxonomic Knowledge

01/30/2013
by   Thomas Lukasiewicz, et al.
0

We present locally complete inference rules for probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events. Crucially, in contrast to similar inference rules in the literature, our inference rules are locally complete for conjunctive events and under additional taxonomic knowledge. We discover that our inference rules are extremely complex and that it is at first glance not clear at all where the deduced tightest bounds come from. Moreover, analyzing the global completeness of our inference rules, we find examples of globally very incomplete probabilistic deductions. More generally, we even show that all systems of inference rules for taxonomic and probabilistic knowledge-bases over conjunctive events are globally incomplete. We conclude that probabilistic deduction by the iterative application of inference rules on interval restrictions for conditional probabilities, even though considered very promising in the literature so far, seems very limited in its field of application.

READ FULL TEXT

page 1

page 2

page 3

page 4

page 5

page 7

page 8

research
05/27/2011

Probabilistic Deduction with Conditional Constraints over Basic Events

We study the problem of probabilistic deduction with conditional constra...
research
02/17/2020

Convergent non complete interpolatory quadrature rules

We find a family of convergent schemes of nodes for non-complete interpo...
research
04/27/2018

Generalized Logical Operations among Conditional Events

We generalize, by a progressive procedure, the notions of conjunction an...
research
03/20/2013

Constraint Propagation with Imprecise Conditional Probabilities

An approach to reasoning with default rules where the proportion of exce...
research
03/13/2015

Transitive reasoning with imprecise probabilities

We study probabilistically informative (weak) versions of transitivity, ...
research
03/13/2013

Towards Precision of Probabilistic Bounds Propagation

The DUCK-calculus presented here is a recent approach to cope with proba...
research
12/03/2010

Closed-set-based Discovery of Bases of Association Rules

The output of an association rule miner is often huge in practice. This ...

Please sign up or login with your details

Forgot password? Click here to reset