- 更多网络例句与基本合取相关的网络例句 [注：此内容来源于网络，仅供参考]
-
The research progress on SFCE of lanthanides and actinides and applications in the process study of spent fuel reproc.
文章主要介绍超临界流体的特点、超临界流体络合萃取的基本原理及其影响因素，并对超临界流体络合萃取镧系和锕系元素的研究进展及其在乏燃料后处理工艺研究中的应用进行综述。
-
The soundness and completeness theorem of this method were proved at last. This part consists of the following points: 1. The properties of the indecomposable extremely simple form of LP were discussed, the theorem shown that every logical formula of LP was equals of a generalized conjunction normal form. 2. The method for judging a logical formula is a indecomposable extremely simple form or not was discussed, the necessary and sufficient conditions of a logical formula with not more than three implicative connective being a indecomposable extremely simple form was given. 3. The α-resolution fields of the indecomposable extremely simple form of LP were discussed, some elementary results were obtained. 4. The automated reasoning method based on the resolution principle of classical logic was discussed, the author given a method to describe the set of clauses by using a matrix, and translated the resolution of two clauses to column operations of this matrix.
二、关于格值命题逻辑系统LP中α-自动推理方法的研究 1、对LP中不可分极简式的性质进行了研究，证明了LP中任何一个格值逻辑公式等值于一个广义合取范式； 2、对LP中不可分极简式的判定方法进行了研究，讨论了含有不超过3个蕴涵运算的格值逻辑式为不可分极简式的充分必要条件； 3、对LP中不可分极简式的α-归结域进行了研究，得到了一些基本结果； 4、对经典逻辑中基于归结原理的自动推理方法进行了研究，给出了用符号矩阵表示子句集合的一种方法，把不同的归结过程转换成矩阵的列变换。
-
First design a reasonable XML Schema structure and under the restriction of XML Schema use XML to describe the UML class diagram and the related specification, and then extract the test specification of method from XML test script. Test specification refers to predicate sequences in the form of conjunctive normal form, extracted from basic constraint conditions of variables included in test scripts and expected outputs. Each conjunctive normal form can be transformed to an inequation set, and adopt 1×1 domain test strategy to every inequation set to produce the domain test matrix, which in turn produce the test case.
首先设计合理的XML Schema结构，并在该XML Schema的有效性约束下，用XML对UML类图及相关性约束进行脚本描述；其次对XML测试脚本进行分析，提取方法的测试规约说明，所谓测试规约说明就是从测试脚本中包含的变量的基本约束条件以及期望输出中抽取得到的以合取范式形式存在的谓词序列；每一合取范式对应一个不等式组，对每一个不等式组采用1×1域测试策略，生成域测试矩阵，最终得到测试用例。
-
Disjunction normal form theorem in the modal logic system S5 is inductively proved, which can be used for representing complex modal formulas by means of conjunction and disjunction of simplest modal formulas with depth at most 1 in the system S5. As application, it is proved that a knowledge base could answer KB-queries if and only if it could answer queries of non-modal propositions and their negations, which is a basic problem on knowledge base.
研究了模态逻辑系统S5中的析取范式定理的归纳证明，给出了在S5中用深度至多等于1的最简模态公式通过析取与合取运算表示含有多重模态词的公式的方法，作为范式定理的应用，讨论了知识库中的一个基本问题，证明了知识库能够回答KB命题式问题的充要条件是该知识库能够回答相关的非模态命题及其否定命题的问题。
- 更多网络解释与基本合取相关的网络解释 [注：此内容来源于网络，仅供参考]
-
fundamental cocycle：基本上循环
fundamental class 基本类 | fundamental cocycle 基本上循环 | fundamental conjunction 基本合取
-
elementary circuit：基本回路
elementary chain 初等链 | elementary circuit 基本回路 | elementary conjunction 基本合取式
-
elementary conjunction：基本合取式
elementary circuit 基本回路 | elementary conjunction 基本合取式 | elementary divisor 初等因子
-
fundamental conjunction：基本合取
fundamental cocycle 基本上循环 | fundamental conjunction 基本合取 | fundamental constants 基本常数
-
fundamental constants：基本常数
fundamental conjunction 基本合取 | fundamental constants 基本常数 | fundamental curve 基本曲线