1) disjunctive normal form
析取范式
1.
Proceeding with both-branch proposition,the paper provides the characteristics of both-branch fuzzy logic and both-branch fuzzy logic expressions,Disjunctive Normal Form and Conjunctive Normal Form of both-branch fuzzy logic expressions.
从双枝模糊命题入手,给出双枝模糊逻辑的性质和双枝模糊逻辑公式,以及双枝模糊逻辑的析取范式与合取范式。
2.
In this paper, through the use of the disjunctive normal form and the principal disjunctive normal form, we propose some general algorithms concerning the grand minimal dominant set, the minimum dominant set, the minimal edge dominant set, and the minimum edge dominant set of graphs.
给出了利用命题逻辑公式的析取范式和主析取范式求图的全部极小支配集和最小支配集以及全部极小边支配集和最小边支配集的一般算
3.
In this paper, we make use of disjunctive normal form and prinpical disjunctive normal form to give some methods of independent set and maximal independent set,as well as a general algorithm.
给出了利用命题逻辑公式的析取范式和主析取范式求图的独立集和极大独立集的方法 ,并给出了一般算法 。
2) DNF
析取范式
1.
The automatic generation algorithm of discernibility function ’s disjunctive normal form(DNF) is studied based on rough set theory.
基于粗糙集理论,研究分辨函数(DF)的析取范式的自动生成算法,提出由分辨矩阵到合取项矩阵(CM)的计算方法。
2.
When the constraint expression of a query is not a CNF (Conjunctive Normal Form),it is generally transformed into an equivalent DNF (disjunctive normal form)an union of CNFs .
当数据立方查询条件不是合取范式时，一般是将它转化成为若干合取范式的并的形式(析取范式)。
3) main disjunctive normal form
主析取范式
1.
Seeking the main disjunctive normal form mainly includes the following four methods,the truth table method,the deductive method,the main disjunctive normal form using the truth table method to seek the G,and the main conjunctive normal form using the deductive method to seek the G.
求主析取范式包括真值表法、推演法以及用真值表法求G的主析取范式、用推演法求G的主合取范式等四种方法。
2.
Taking into cousideration that traditional main disjunctive normal form is complicated,through a discussion on the suffix features of miniterm,by using the binary,the author offers a binary calculating approach to main disjunctive normal form determined by disjunctive normal form.
针对解决求主析取范式的传统方法比较繁琐的情况,通过对极小项下标特征的讨论,利用二进制给出了由命题公式的析取范式确定主析范式中的二进制求法,从而简化了由繁杂的命题公式推演或真值表计算求主析取范式的计算过程,给出了求命题公式主析取范式的简便求法——表格法。
4) principal disjunctive normal form
主析取范式
1.
In this paper, through the use of the disjunctive normal form and the principal disjunctive normal form, we propose some general algorithms concerning the grand minimal dominant set, the minimum dominant set, the minimal edge dominant set, and the minimum edge dominant set of graphs.
给出了利用命题逻辑公式的析取范式和主析取范式求图的全部极小支配集和最小支配集以及全部极小边支配集和最小边支配集的一般算
6) disjunctive expression
析取范式表达式
1.
Pan-Boolean algebra is used to prove that two logical expressions of one decision list with the complete conditional attribute(the disjunctive expression and the implicative expression) are logically equivalent.
继而证明了不完全决策表在1型解释下,其析取范式表达式仍与完全决策表的析取范式表达式形式相同,但与其等价的蕴涵式表达式却比完全决策表的蕴涵式表达式多了一串乘积;而不完全决策表在2型解释下,其蕴涵式表达式仍与完全决策表的蕴涵式表达式形式相同,但与其等价的析取范式表达式却比完全决策表的析取范式表达式多了一串和式。
补充资料：合取范式
| 合取范式 conjunction normal form 命题公式的一种标准形，设A是一个命题公式，A中出现的命题变元为p1，p2，…，pn，以Qi表示pi或7pi，i＝1，…，n。称Q1∧…∧Qn是p1，…，pn的一个合取项，若干个互不相同的合取项的析取称为一个合取范式，与命题公式A逻辑等价的合取范式称为A的合取范式。例如命题公式p→（q→r）的合取范式是 p∧q∧r∨［p∧q∧r∨p∧［q∧r∨［p∧［q∧r∨［p∧q∧［r∨p∧［q∧［r∨［p∧［q∧［r。一个命题公式的合取范式可以通过真值表得到，也可以通过等价变换得到。命题公式还有另一种范式，析取范式。析取范式的定义与合取范式对偶，只要把合取与析取对换就可以由合取项得到析取项，由合取范式得到析取范式。 |
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条