全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多

 set of clauses 的翻译结果: 查询用时：0.01秒
 在分类学科中查询 所有学科 数学 更多类别查询

 历史查询

 set of clauses 子句集(4)
 子句集
 This paper presents the lock-semantic resolution, namely the LI-resolution, in order to improve the disadvantage of IDI-resolution principle of type 2, for which the set of clauses in first-order logic is completed. This disadvantage is that in IDI-resolution only the literal resolved upon one parent clause is restricted, but the literal resolved upon another parent clause is not. 为了改进对于一阶逻辑中子句集是完备的2型IDI-归结原理的一个缺点,即在IDI归结中,只对其中一个亲本子句的归结文字有所限制,对另一个亲本子句的归结文字没有任何限制,本文提出了锁语义归结,简称LI-归结。 短句来源 In the LI-resolution as well as in lock resolution, the literals resolved upon two parent clauses all have the minimum lock in that clause. This paper also proves that the LI-resolution principle is completed with a set of clauses in first-order logic with the specified lock way. 即在这种语义归结原理中,象锁归结过程一样,每一次归结的两个亲本子句中的归结文字,都是该子句中有最小锁的文字,并证明了以一种固定的配锁方法,LI-归结原理对于一阶逻辑中的子句集是完备的。 短句来源 In addition,the simplification of a set of clauses and the performance of the algorithm are also discussed. 文中还讨论了子句集的化简及算法性能评价等问题。 短句来源 The algorithm decomposing the smallest set of literals from a set of clauses is presented to compute Roos' extensions. 为计算 Roos扩张 ,引入了从子句集分解最小文字集的算法 . 短句来源
 “set of clauses”译为未确定词的双语例句
 The input of this procedure is a set of clauses, and the output is the solution of the problem to be solved, if any solution exists. 该过程的输入为一子句集合,输出是问题的解(若该问题有解的话). 短句来源 The former one makes backtrack within the set of clauses relevent to the failure, while the latter one generates all the possible backtracking points to the best point to start. 逻辑程序求解失败时,这两种方法均可分析引起失败的原因,前者在与失败有关的子句空间内进行回溯,后者找出所有可能的回溯点,以便选择最佳回溯点进行回溯。 短句来源
 相似匹配句对
 (L) and set。 (L),证明了范畴Set_0(L)与(?) 短句来源 The set 集合(英文) 短句来源 ON THE DEFINITION OF THE SET 关于集合的定义 短句来源 The Structure of Measurable Set 可测集合的结构 短句来源 As clauses analysis As从句的辨析 短句来源

我想查看译文中含有：的双语例句

 set of clauses
 CLAUDIEN also employs a novel declarative bias mechanism to define the set of clauses that may appear in a hypothesis. This enables us to apply to ECTL+ a resolution technique defined over the set of clauses. Constructing semantic trees has been used as a theoretical tool for confirming the unsatisfiability of a set of clauses in first-order predicate calculus; this paper shows that this approach has some practicality as well. It is shown that FE‐resolution ATP is complete in the sense that a set of clauses which is unsatisfiable in all models with the given interpretation of the functions will yield the empty clause under resolution, paramodulation and FE‐resolution. In the first part of this article we present a procedure that transforms formulas with restricted quantifiers into a set of clauses with constraints while preserving satisfiability. 更多
 This paper presents the lock-semantic resolution, namely the LI-resolution, in order to improve the disadvantage of IDI-resolution principle of type 2, for which the set of clauses in first-order logic is completed. This disadvantage is that in IDI-resolution only the literal resolved upon one parent clause is restricted, but the literal resolved upon another parent clause is not. In the LI-resolution as well as in lock resolution, the literals resolved upon two parent clauses all have... This paper presents the lock-semantic resolution, namely the LI-resolution, in order to improve the disadvantage of IDI-resolution principle of type 2, for which the set of clauses in first-order logic is completed. This disadvantage is that in IDI-resolution only the literal resolved upon one parent clause is restricted, but the literal resolved upon another parent clause is not. In the LI-resolution as well as in lock resolution, the literals resolved upon two parent clauses all have the minimum lock in that clause. This paper also proves that the LI-resolution principle is completed with a set of clauses in first-order logic with the specified lock way.By using the notion of lemma, the LI-deduction have been linearly sorted. Thus the TLI-deduction is introduced. 为了改进对于一阶逻辑中子句集是完备的2型IDI-归结原理的一个缺点,即在IDI归结中,只对其中一个亲本子句的归结文字有所限制,对另一个亲本子句的归结文字没有任何限制,本文提出了锁语义归结,简称LI-归结。即在这种语义归结原理中,象锁归结过程一样,每一次归结的两个亲本子句中的归结文字,都是该子句中有最小锁的文字,并证明了以一种固定的配锁方法,LI-归结原理对于一阶逻辑中的子句集是完备的。 使用引理的概念,将LI-演绎进行线性整理,从而引进了TLI-演绎的概念。 This paper presents an inference procedure with high parallelism. The proposed approach is an indirect proof method based on Prawitz's Matrix-reduction and Robinson's Unification algorithms. The input of this procedure is a set of clauses, and the output is the solution of the problem to be solved, if any solution exists. 本文介绍一个具有高度并行性的推理过程.它是基于Prawitz的矩阵证明方法和Robinson的合一算法而得到的一种间接推理方法.该过程的输入为一子句集合,输出是问题的解(若该问题有解的话). Two fundamental approaches to intelligent backtrack are described in detail in this paper, that is, the minimum inconsistent deduction tree by Bruynooghe and the maximum unifiable constraint sets by Cox, When the execution of a logic program arrived at a failure, both of the methods analyse the causes of the failure. The former one makes backtrack within the set of clauses relevent to the failure, while the latter one generates all the possible backtracking points to the best point to start. 本文详细介绍了获得智能回溯的两个基本方法:最小不一致演绎树和最大可合一约束集。逻辑程序求解失败时,这两种方法均可分析引起失败的原因,前者在与失败有关的子句空间内进行回溯,后者找出所有可能的回溯点,以便选择最佳回溯点进行回溯。 << 更多相关文摘
 相关查询

 CNKI小工具 在英文学术搜索中查有关set of clauses的内容 在知识搜索中查有关set of clauses的内容 在数字搜索中查有关set of clauses的内容 在概念知识元中查有关set of clauses的内容 在学术趋势中查有关set of clauses的内容

 CNKI主页 |  设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
2008 CNKI－中国知网

2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社