|
V4 N2 Paper 4
|
Annals of the MS in Computer Science and Information Systems at
UNC Wilmington
|
Fall 2010
|
Finding Minimal Cost Proofs for Cost-Based Abduction
Shawn Chivers
Committee
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
(pdf)
Recommended Citation:
Chivers, S., Tagliarini, G, Reinicke, B., Guinn, C. (2010) Finding Minimal Cost Proofs for Cost-Based Abduction. Annals of the Master of Science in Computer Science and Information Systems at UNC Wilmington, 4(2) paper 4. http://csbapp.uncw.edu/data/mscsis/full.aspx.
|
V4 N2 Paper 4
|
Annals of the MS in Computer Science and Information Systems at
UNC Wilmington
|
Fall 2010
|
