1. BDD is a diagrammatic representation of Boolean function.

2. Boolean function reduction complete source code can be used directly.

3. A boolean function minimization system based on learning from examples called SWT is introduced in this paper.

4. The XMLEXISTS is a Boolean function that takes an XPath expression as input and returns FALSE if the XPath expression returns an empty sequence and TRUE otherwise.

5. In minimizing a boolean function using the extraction method, the traditional steps are: getting the prime cover Z first; and then extracting the essential prime implicant from Z.

6. Realization of Boolean function base on threshold logic gate is always studied by researchers because its strong function and special advantage.

7. Based on the concept of correlation of annihilator, a new algorithm is proposed that allows to deciding whether a Boolean function has low degree annihilators successfully.

8. In some applications, we need to obtain the set of all satisfiable assignments of a Boolean function, in which assignments can not imply each other.

8. try its best to gather and create good sentences.

9. And more, the improved algorithm can be applied to constructing the low - degree Annihilators of Boolean function.

10. The algebraic immunity is a criteria on evaluating the property of the Boolean function recently.

11. Algebraic Decision Diagram ( ADD ) is a symbolic method utilized to represent Boolean function.

12. In this paper, a connection model of CMAC network is proposed, which is composed of A/Dconverters, decoders , OR-AND Boolean function network, memory, and a Adaline(Adaptive Linear Element) .