Cart (Loading....) | Create Account
Close category search window

Implementation of Boolean minimization in an abductive framework

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Dasigi, V. ; Sacred Heart Univ., Fairfield, CT, USA

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

Published in:

Aerospace and Electronics Conference, 1995. NAECON 1995., Proceedings of the IEEE 1995 National  (Volume:2 )

Date of Conference:

22-26 May 1995

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.