By Topic

Computing prime implicants/implicates for regular logics

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
$33 $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

2 Author(s)
Ramesh, A. ; Inst. for Programming & Logics, State Univ. of New York, Albany, NY, USA ; Murray, N.V.

Prime implicant/implicate generating algorithms for multiple-valued logics are introduced. Techniques from classical logic not requiring large normal forms or truth tables are adapted to certain “regular” multiple-valued logics. This is accomplished by means of signed formulas, a meta-logic for multiple valued logics; the formulas are normalized in a way analogous to negation normal form. The logic of signed formulas is classical in nature. The presented method is based on path dissolution, a strongly complete inference rule. The generalization of dissolution that accommodates signed formulas is described

Published in:

Multiple-Valued Logic, 1994. Proceedings., Twenty-Fourth International Symposium on

Date of Conference:

25-27 May 1994