EFVM Solving Algorithm of Function Trees

There often exist enormous possible solutions in solving of and/or/not function trees.A solving algorithm based on the four-valued matrix(FVM) is proposed.The FVM,extended four-valued matrix(EFVM) and FVM system are constructed from the characteristics of and/or/not function trees.Then,the ISOmorph between the FVM system and classical propositional logic's disjunctive normal form system is analyzed,the extensions of the FVM are achieved,and the EFVM direct solving algorithm is given.At last,the EFVM solving algorithm considering simplification is proposed by taking logic simplification into account.The experimental results show that the EFVM solving algorithm reduces the quantity of solutions under the condition of lots of redundancies,and then effectively supports conceptual design.