disjunctive normal form

Research on the primary disjunctive normal form of fuzzy logic function

模糊逻辑函数的主析取范式的研究

An analysis on the construction of disjunctive normal form ( dnf ) by means of equal covering and cone form

用均覆盖和锥形式对析取范式的结构分析及其近似快速求解算法

Disjunctive Normal Form Generation Algorithm for Discernibility Function in Rough Set Theory

粗糙集理论中分辨函数的析取范式生成算法

The anthor also gives a general method for the simplification of Fuzzy function from disjunctive normal form to simplest form .

同时给出了Fuzzy函数的析取范式化为最简式的一般方法。

An Investigation on the Algorithm for Decision of Validity of Disjunctive Normal Form ( DNF ) by the Triangle Form

用三角式判定析取范式永真性的算法研究

This paper deals with the simplification of Fuzzy function from disjunctive normal form to simplest form several sufficient and necessary conditions are displayed .

讨论了Fuzzy函数的析取范式化为最简式的问题，得到了几个充分必要条件。

A Surface-based DNA Algorithm for the Conversion of Conjunctive Normal Form into Disjunctive Normal Form The Policy of the Chinese International Bank Buying

合取范式化为析取范式的DNA表面计算中国银行业跨国并购的策略选择&基于OLI框架的分析

In propositional calculus system of medium logic ( MP ~ ), superior disjunctive normal form theorem and two corollary have been proved .

本文证明了MP~中的完全析取范式定理及其两个推论。文中也给出了判别Γ（？）

Aiming at the problem of equivalent conversion from conjunctive normal form to disjunctive normal form , an effective algorithm was proposed to construct reduction tree based on discernibility matrix .

针对差别矩阵求约简过程中合取范式向析取范式等价转换的难题，提出一种基于差别矩阵构造约简树的有效方法。

If you 've studied logic theory , you might recognize the normal-form representation ( with no nested alternatives ) as equivalent to the disjunctive normal form of a logic expression .

如果您学习过逻辑原理，您就会知道标准表示形式（没有嵌套替代项）等同于逻辑表达式的析取范式（disjunctivenormalform）。

Firstly , a classification-tree is constructed based on specification of the test object , and then test cases obtained from the classification-tree are refined by generating a disjunctive normal form .

由软件的形式规格说明构造分类树，再把由分类树方法得到的测试用例转化为析取范式，进一步精炼测试用例。

With respect to the principal disjunctive normal form and the principal conjunctive normal form , we also approach the properties of the subscript sets derived from the minimum term and maximum term .

讨论了命题公式的主析取范式、主合取范式中的极小项与极大项下标集合的性质，利用主范式的下标集合得到了命题公式蕴涵的几个充要条件。

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 .

从双枝模糊命题入手，给出双枝模糊逻辑的性质和双枝模糊逻辑公式，以及双枝模糊逻辑的析取范式与合取范式。

To support the truth table method , the properties of the minimal form are cited . Besides , it proves the theorem of the main disjunctive normal form of seeking G with the definition of formula equality .

用极小项的性质给出了真值表求法的证明，用公式相等的定义证明了求G的主析取范式的定理。

Then it is shown that the disjunctive normal form family { On } is a hard example for the bifurcation method . This shows that algorithms based on the bifurcation method are all characterized by time complexity in the exponential form .

最后通过{On}这个实例证明了基于二分法所构造出的算法均具有指数型时间复杂度。

Based on Hierons ′ s rewrite rules and Z specification , a tree split arithmetic was presented to rewrite the restriction predication in Operation Scheme to ∨ iP_i ∧ Q_i disjunctive normal form .

该方法基于软件的Z语言规约；以Hierons提出的推理规则为基础，提出了分裂树的算法，将操作模式的约束条件转换为形如∨iPi∧Qi的析取范式；