UNCW MS Computer Science Information Systems Proceedings
Finding Minimal Cost Proofs for Cost-Based Abduction
Shawn Chivers
Gene Tagliarini (Chair)
Bryan Reinicke
Curry Guinn
Abstract
Abduction is the process of proceeding from data describing a set of observations or events, to a set of hypotheses which best explains or accounts for the data. Cost-based abduction (CBA), also called cost-based hypothetically reasoning, is a formalism in which evidence to be explained is treated as a goal to be proven, proofs have costs based on how much needs to be assumed to complete the proof, and the set of assumptions needed to complete a least-cost proof is taken as the best explanation for the given evidence. This project explores a new heuristic approach to finding least-cost proofs for CBA systems and compares the performance against previous published results.
Download Full PDF
Recommended Citation: Chivers S., Tagliarini G., Reinicke B., Guinn C., (2010). Finding Minimal Cost Proofs for Cost-Based Abduction.
UNCW MS CSIS Proceedings.
V. 4
, N. 4
.