Probabilistic Deduction with Conditional Constraints over Basic Events
<p>We show that probabilistic deduction with conditional constraints over basic events is NP-hard. We then focus on the special case of probabilistic deduction in conditional constraint trees. We elaborate very efficient and globally complete techniques for probabilistic deduction. More precis...
| Main Author: | |
|---|---|
| Format: | Conference item |
| Published: |
Morgan Kaufmann
1998
|