Efficient Global Probabilistic Deduction from Taxonomic and Probabilistic Knowledge−Bases over Conjunctive Events
<p>We present a new, efficient linear programming approach to probabilistic deduction from probabilistic knowledge bases over conjunctive events. We show that this approach enables us to solve the classical problem of probabilistic deduction along a chain of basic events in polynomial time in...
Main Author: | |
---|---|
Format: | Conference item |
Published: |
ACM Press
1997
|