English

# Item

ITEM ACTIONSEXPORT

Automatic Derivation of Probabilistic Inference Rules

Jaeger, M. (2001). Automatic Derivation of Probabilistic Inference Rules. International Journal of Approximate Reasoning, 28(1), 1-22.

Item is

### Basic

show hide
Genre: Journal Article

### Files

show Files
hide Files
:
jappreas-final.ps (Any fulltext), 214KB

-
Name:
jappreas-final.ps
Description:
-
Visibility:
Private
MIME-Type / Checksum:
application/postscript
-
-
-

show

### Creators

show
hide
Creators:
Jaeger, Manfred1, Author
Affiliations:
1Programming Logics, MPI for Informatics, Max Planck Society, ou_40045

### Content

show
hide
Free keywords: -
Abstract: A probabilistic inference rule is a general rule that provides bounds on a target probability given constraints on a number of input probabilities. Example: from $P(A | B) \leq r$\ infer $P(\neg A | B) \in [1-r,1]$. Rules of this kind have been studied extensively as a deduction method for propositional probabilistic logics. Many different rules have been proposed, and their validity proved -- often with substantial effort. Building on previous work by T. Hailperin, in this paper we show that probabilistic inference rules can be derived automatically, i.e. given the input constraints and the target probability, one can automatically derive the optimal bounds on the target probability as a functional expression in the parameters of the input constraints.

### Details

show
hide
Language(s): eng - English
Dates: 2010-03-122001
Publication Status: Published in print
Pages: -
Publishing info: -
Rev. Method: Peer
Identifiers: eDoc: 519819
Other: Local-ID: C1256104005ECAFC-84E804A247DFE550C1256AA9004EBC08-JaegerIJAR01
Degree: -

show

show

show

### Source 1

show
hide
Title: International Journal of Approximate Reasoning
Source Genre: Journal
Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 28 (1) Sequence Number: - Start / End Page: 1 - 22 Identifier: ISSN: 0888-613X