基于素数性质的布尔函数约简算法

A reduction algorithm for Boolean functions based on primes

提出了基于素数性质的布尔函数约简算法,其主要思想是用素数表示布尔变量,以素数乘积有序对表示合取式,用算术运算取代原有的逻辑运算。将基于素数性质的布尔函数约简算法运用于粗糙集中,结果表明,该算法能够节省存储空间,提高运算效率,约简算法行之有效。

A reduction algorithm for Boolean functions based on primes is introduced here, where the Boolean variables are represented by primes, and a basic conjunction is denoted with an ordered pair of integers, and the original logic calculation is replaced with arithmetic manipulation. The algorithm is applied to rough set and the results show that the memory space is saved and the efficiency is improved, so it is effective.