On the Relationship between Abductive Reasoning and Boolean Minimization

Authors

Venu Dasigi
Krishnaprasad Thirunarayan, Wright State University - Main CampusFollow

Document Type

Conference Proceeding

Publication Date

7-1991

Find in a Library

Catalog Record

Abstract

Abductive reasoning involves determining a parsimonious set of explanations that can account for a set of observations. In the Boolean minimization problem, the designer attempts to express a Boolean formula as a sum of products or product of sums expression of the smallest size that satisfies the desired function. In this paper, we show that independent abduction problem can be encoded as an instance of Boolean minimization problem, and conversely, a Boolean minimization problem as an abduction problem. We then consider the application of the transitivity results from the parsimonious covering theory to the Boolean minimization. We conclude with a brief comparison to the related work.

Comments

Presented at the Ninth National Conference on Artificial Intelligence, Anaheim, CA, July 14-19, 1991.

Repository Citation

Dasigi, V., & Thirunarayan, K. (1991). On the Relationship between Abductive Reasoning and Boolean Minimization. Proceedings of the Ninth National Conference on Artificial Intelligence, 84-88.
https://corescholar.libraries.wright.edu/knoesis/869