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.
| Original language | American English |
|---|---|
| State | Published - Jul 1 1991 |
| Event | Proceedings of the Ninth National Conference on Artificial Intelligence - Duration: Jul 1 1991 → … |
Conference
| Conference | Proceedings of the Ninth National Conference on Artificial Intelligence |
|---|---|
| Period | 7/1/91 → … |
Disciplines
- Bioinformatics
- Communication
- Communication Technology and New Media
- Computer Sciences
- Databases and Information Systems
- Life Sciences
- OS and Networks
- Physical Sciences and Mathematics
- Science and Technology Studies
- Social and Behavioral Sciences