This paper proposes an abductive reasoning system, which can find most preferable solution efficiently, using Binary Decision Diagrams. We propose a specialized BDD and its operation suitable for abductive reasoning: PBDD (Partial BDD) and GPC (Graft & Pruning Construction). We have implemented PBDD and GPC algorithm and built a cost-based abductive reasoning system which can find much more efficiently the most preferable explanation of a given observation. We have also made some experiments on the system with some diagnostic problems. Some good performance results are also shown.
CITATION STYLE
Kato, S., Oono, S., Seki, H., & Itoh, H. (1999). Cost-based abduction using binary decision diagrams. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1611, pp. 215–225). Springer Verlag. https://doi.org/10.1007/978-3-540-48765-4_25
Mendeley helps you to discover research relevant for your work.