@conference {1716,
title = {On the Relationship between Abductive Reasoning and Boolean Minimization},
year = {1991},
publisher = {AAAI 91},
organization = {AAAI 91},
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 appli- cation of the transitivity results from the parsimo- nious covering theory to the Boolean minimization. We conclude with a brief comparison to the related work.},
author = {V. Dasigi and Krishnaprasad Thirunarayan}
}
@conference {1671,
title = {On the Relationship between Parsimonious Covering and Boolean Minimization},
booktitle = { National Aerospace and Electronics Conference (NAECON)},
year = {1991},
address = {Dayton Convention Center},
abstract = {The authors explain some of the relationships of the Boolean minimization problem (BMP) to a formalization of abductive inference called parsimonious covering (PC). Abductive inference often occurs in diagnostic problems such as finding the causes of circuit faults or determining the disease causing the symptoms reported by a patient. Parsimonious covering involves covering all observed facts by means of a parsimonious set of explanations that can account for the observation. It is shown that only the prime implicants of a given Boolean function in a BMP, rather than any general product terms, are considered analogous to disorders in a PC problem},
author = {V. Dasigi and Krishnaprasad Thirunarayan}
}