Abstract: For large-scale and/or/not function trees in product conceptual design, it is usual to
use logic simplifying to cut down redundancy; however logic simplifying may result in the loss of
innovative ability. Aiming at this problem, the lossless simplifying strategies are proposed for
and/or/not function trees. First of all, the strict definition of lossless simplifying of and/or/not
function tree is given, and then the converting method from the and/or/not function tree to
AND/OR tree is established. Moreover, some lossless simplifying theorems for the AND/OR tree
are proved, and based on them the lossless simplifying algorithm of and/or/not function tree is
obtained. Lastly, experimental results show that such strategies can effectively reduce
computational cost under the condition to ensure logic equivalence and also lossless innovative
ability, thus improve the efficiency of innovative reasoning.

Key words: computer application, innovative reasoning, lossless simplifying, and/or/not
function tree