Implementation of Boolean minimization in an abductive framework
Venu G. Dasigi · 2002
This work represents the final phase in establishing a firm relationship between the Boolean minimization problem (BMP) and the abduction problem (AP). Specifically, it demonstrates how the BMP could be solved using an algorithm based on the parsimonious covering model, which in turn models a class of APs. The implementation of the algorithm that solves the BMP in an abductive framework provides a much needed empirical validation of the theoretical properties of the algorithm, in addition to providing a different method for computing the minimized form for a Boolean function.