PROCESSING METHOD FOR CONJUNCTURE NORMAL FORM

摘要

PURPOSE: To provide an expressing method for a conjuncture normal form which reduces a storage area for storing the output result. ;CONSTITUTION: A certain fixed order is defined concerning all the literals. A set S of product terms is classified into two partial sets S₀ and S₁ corresponding to whether a certain literal (t) is contained or not concerning the set S of product terms. According to the literal order, this processing is recursively repeated to the set of product terms contained in the conjuncture normal form concerning all the literals, a logic value '0' is allocated to the empty class, and a logic value '1' is allocated to the non-empty class. A bisected tree is generated by using intermediate nodes of respective literals, two branches expressing the presence/absence of respective literals and terminal nodes expressing the logic values '0' and '1'. When any equivalent branches are existent in this bisected tree, those branches are shared. When a node, for which two branches instruct the same destination, is existent, that node is eliminated, and branches are directly linked.;COPYRIGHT: (C)1994,JPO&Japio