Abstract:
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. 1
Citations
|
4388
|
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
– Pearl
- 1988
|
|
314
|
Probabilistic logic
– Nilsson
|
|
159
|
A logic for reasoning about probabilities
– Fagin, Halpern, et al.
- 1990
|
|
145
|
Logical Foundations of Probability
– Carnap
- 1950
|
|
80
|
Computational Problems Related to the Design of Normal Form Relational Schemas
– Beeri, Bernstein
- 1979
|
|
60
|
Anytime deduction for probabilistic logic
– FRISCH, HADDAWY
- 1994
|
|
46
|
Probabilistic description logics
– Heinsohn
- 1994
|
|
40
|
Probabilistic deduction with conditional constraints over basic events
– Lukasiewicz
- 1999
|
|
37
|
Constraint propagation with imprecise conditional probabilities
– Amarger, Dubois, et al.
- 1991
|
|
30
|
Probabilistic satisfiability
– Georgakopoulos, Kavvadias, et al.
- 1988
|
|
28
|
de Finetti Theory of Probability
– unknown authors
- 1974
|
|
28
|
Probabilistic logic programming
– Lukasiewicz
- 1998
|
|
25
|
The Logic of Conditionals, volume 86 of Synthese Library
– Adams
- 1975
|
|
25
|
Correction to ”an equivalence between relational database dependencies and a fragment of propositional logic
– Sagiv, Delobel, et al.
- 1987
|
|
22
|
Inference with imprecise numerical quantifiers
– Dubois, Prade, et al.
- 1990
|
|
21
|
Towards precision of probabilistic bounds propagation
– Thone, Guntzer, et al.
- 1992
|
|
18
|
Bayesian logic. Decision Support Systems
– Andersen, Hooker
- 1994
|
|
18
|
On fuzzy syllogisms
– Dubois, Prade
- 1988
|
|
17
|
A linear programming approach to reasoning about probabilities
– Kavvadias, Papadimitriou
- 1990
|
|
16
|
de Aragao. Column generation methods for probabilistic logic
– Jaumard, Hansen, et al.
- 1991
|
|
12
|
Efficient global probabilistic deduction from taxonomic and probabilistic knowledge-bases over conjunctive events
– Lukasiewicz
- 1997
|
|
6
|
Precision of Probabilistic Deduction under Taxonomic Knowledge
– Lukasiewicz
- 1996
|
|
5
|
de M`antaras. A symbolic approach to reasoning with linguistic quantifiers
– Dubois, Prade, et al.
- 1992
|
|
5
|
Uncertain reasoning in concept lattices
– Lukasiewicz
- 1995
|
|
4
|
Probabilistic logic
– Paa��
- 1988
|
