Implementation of Boolean minimization in an abductive framework

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...

Full description

Saved in:
Bibliographic Details
Main Author: Dasigi, V.
Format: Conference Proceeding
Language:English
Subjects:
Boolean functions
Computer science
Encyclopedias
Heart
Information technology
Minimization methods
Natural language processing
Problem-solving
Redundancy
Venus
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0547-3578
2379-2027
DOI:10.1109/NAECON.1995.521995