| 极小蕴涵和析取范式表示 |
| |
| 引用本文： | 陈新宁,陈振宇.极小蕴涵和析取范式表示[J].南京大学学报(自然科学版),2006,23(2):282-290. |
| |
| 作者姓名： | 陈新宁 陈振宇 |
| |
| 作者单位： | 连云港师范高等专科学校数学系，东南大学计算机科学与工程学院 连云港 225002，南京 210096 |
| |
| 摘 要： | 析取范式的极小表示是命题逻辑和计算机科学理论中的一个重要问题．本文研究了在若干极小标准下的蕴涵和析取范式表示的一些性质,并阐述了极小蕴涵和极小析取范式表示在模型检测中的应用．
|
| 关 键 词： | 蕴涵 析取范式极小化 计算复杂性 |
| 修稿时间： | 2006年4月20日 |
MINIMAL IMPLICANT AND DNF REPRESENTATION |
| |
| Cheng Xinning,Cheng Zhenyu.MINIMAL IMPLICANT AND DNF REPRESENTATION[J].Journal of Nanjing University: Nat Sci Ed,2006,23(2):282-290. |
| |
| Authors: | Cheng Xinning Cheng Zhenyu |
| |
| Abstract: | DNF (two-level logic) minimization is a central practical problem in logic synthesis and other computer science problems. How to minimize DNF formula has posed challenges since the beginning of the filed in the 60's. Indeed some central questions such as the up-bound size of equivalent DNF formula have been resolved only within the last few years, and others remain open. In this paper, we investigate implicant and DNF representations with some minimality criteria. Furthermore, we discuss some applications of these minimizations in model checking. |
| |
| Keywords: | implicant DNF minimization computational complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
