Abstract
Minimal cost proof for the facts. The costs are computed by summing the costs of the assumptions necessary for the proof plus the cost of the rules. We examine existing methods for constructing explanations(proofs), as a minimization problem on a DAG. We then define a probabilistic semantics for the costs, and prove the equivalence of the cost minimization problem to the Bayesian network MAP solution of the system.
| Original language | English GB |
|---|---|
| Title of host publication | Proceedings: Eighth National Conference on Artificial Intelligence, Vols.1and 2 |
| Pages | 106-111 |
| State | Published - 1990 |