摘要
本文以一阶谓词演算为工具,构造了一个公理系统,解决布尔函数最小化这一逻辑设计理论中的经典问题.本文给出的公理系统很容易用PROLOG语言实现.
We constructed a axiom system using fi-rstorder predicate calculus for the shortestdisjunctive normal forms of boolean functi-ons,a classical problem in the theory oflogical design.The system is presented inthis paper can be implemented in PROLOGeasily.
出处
《微电子学与计算机》
CSCD
北大核心
1991年第3期5-7,共3页
Microelectronics & Computer
