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

 first order logic 的翻译结果: 查询用时：0.009秒
 历史查询

 first order logic 一阶逻辑(18)一阶逻辑推理(0)一阶逻辑的(9)
 一阶逻辑
 A new algebraic proof of completeness of first order logic 一阶逻辑完备性定理的新代数证明 短句来源 A new algebraic proof of the completeness of first order logic is obtained, of which the use of γ-interpretation based on the representation theorem of Boolean algebra is avoided, but the proof is based on the concept of -interpretation with respect to certain Q-filter  and the axiom of choice is employed. 给出了一阶逻辑完备性定理的一个新的代数证明,这个证明不使用依赖于Boole代数表示定理的γ 解释,但使用关于Q 滤子 的 解释,也需要用到选择公理. 短句来源 (2) In order to validate the efficiency of algorithm, this paper design and implement a testing , platform rule processor based on SQL SERVER. The main function of the processor is to translate the first order logic rule into embedded-SQL programs, which make SQL SERVER DBMS possess the capability in expressing recursive query with logic language. (2)为验证算法的有效性，该文设计实现了一个测试平台——基于SQL SERVER的规则处理器，其主要功能为自动把一阶逻辑规则转换为含有SQL语句的过程代码，这使得SQL SERVER数据库管理系统有了用逻辑数据语言表示递归查询的能力。 短句来源 This result can be used to prove the completeness theorems of first order logic system and the universal refutation method proposed by us. 这一结果可以用于证明一阶逻辑形式系统和我们所提出的广义反驳方法的完备性。 短句来源 Implementation of first order logic model generation 一阶逻辑模型生成器的实现 短句来源 更多
 一阶逻辑的
 Interpolation theorem and preservation theorem in first order logic have determined the existence of first order formula in accordance with certain conditions, their proofs in classical model theory are fairly long and hard to tackle. 一阶逻辑的内插定理和保持定理确定了符合某些条件的公式的存在性 ,经典模型论中对这些的证明较为繁难 . 短句来源 The present paper covers the application of RUE-NRF resolution to a set of generalized clauses by proposing a generalized RUE-NRF resolution method, and a proof of the completeness of this method in first order logic. 本文将RUE-NRF归结使用在广义子句集上,提出了广义RUE-NRF归结方法,并证明了这一方法对于一阶逻辑的完备性; 短句来源 And then, we introduce the XML-Based syntax of KDL, and give the methods of translating KDL into first order logic. 介绍了KDL的语法 ,从一阶逻辑的角度分析KDL的语义特征 ,提供KDL描述到一阶逻辑表达式的映射方法。 短句来源 And then,we introduce the framework and XML Based syntax of KDL,and give the methods of translating KDL into first order logic. 介绍了KDL的语法 ,从一阶逻辑的角度分析KDL的语义特征 ,提供KDL描述到一阶逻辑表达式的映射方法 . 短句来源 The two value weak model for first order logic with generalized quantifier Q is generalized to be valued in complete weak complemented lattices. 将带广义量词Q的一阶逻辑的二值弱模型推广到取值于完备弱可补格上。 短句来源 更多
 “first order logic”译为未确定词的双语例句
 This paper study the syntactic completeness of ML and proved the following results: (1) medium propositional logic MP and its extension MP have syntactic completeness,medium first order logic MF and its extensions MF, ME have no syntactic completeness. 本文研究了ML的语法完全性,证明了如下结果:(1)ML中的中介命题逻辑系统MP及其扩张MP*是语法完全的,中介谓词逻辑系统MF与其扩张MF*,以及含有等词的中介谓词逻辑系统ME不是语法完全的。 短句来源 Based on a kind of multi-sorted first order logic, the language CML is used to specify system models conceptually, and the analyser CMA is followed to check their static consistency and dynamic temporal. 基于多类一阶逻辑设计的概念模型语言CML可用来描述系统模型,并可用CMA对模型描述进行静态一致性和动态时序特性的检查。 短句来源 However, the logic of tasks based on classical first order logic introduced by G. Japaridze is undecidable and the theorems in the logic L* are not given, which makes its application restrited. 然而G．Japaridze在谓词逻辑框架下的任务逻辑(简称为谓词任务逻辑)是不可判定的，且形式系统L~*中的定理也未得到详细的讨论，这使它的应用受到了很大的限制。 短句来源 This article presents a new kind of temporal logic--first order interval temporal logic(FOITL). It is first order logic augmented by interval operator in which there is no explicit reference point about time. 提出一种新的时态逻辑——一阶间隔时态逻辑（FOITL），它是扩充了间隔时间算子的一阶时态逻辑。 短句来源 At the same time, the logic of tasks based on the classical first order logic is introduced and a new logic L', which is between the logic L and L* and is decidable, is established. 与此同时，本文还给出了谓词任务逻辑的语义和语构理论，得到了界于形式系统L和L~*之间的系统L′，并证明了系统L′的可判定性。 短句来源 更多

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

 first order logic
 The introduction of aggregate functions in first order logic, as well as upgrading the forest's uniform feature sampling procedure to the space of first order logic, generates a number of complications. These queries may contain aggregate functions, the argument of which may again be a first order logic query. Essentially, an ensemble of decision trees is constructed in which tests are first order logic queries. Most work on relational learning has been focused on induction in subsets of first order logic like Horn clauses. This paper proposes a method for refining numerical constants occurring in rules of a knowledge base expressed in a first order logic language. 更多
 This paper improves IDI-resolution principle which was proposed by this author to raise the effective. That is, the electrons in the IDI-clash are sequenced and requiring sequence of electronics in every clash is indecrease, so that 3-type IDI-resolution principle has been introduced. This paper also proves that the 3-type IDI-resolution principle is complete for clauses set for first-order logic.By the way, we have indicated an error about property of PI-clash in reference [1]. We have remedied... This paper improves IDI-resolution principle which was proposed by this author to raise the effective. That is, the electrons in the IDI-clash are sequenced and requiring sequence of electronics in every clash is indecrease, so that 3-type IDI-resolution principle has been introduced. This paper also proves that the 3-type IDI-resolution principle is complete for clauses set for first-order logic.By the way, we have indicated an error about property of PI-clash in reference [1]. We have remedied this error, using the method proposed in this paper. 本文改进了作者提出的IDI-归结原理,使之有效性有所提高,亦即,将IDI-互撞中的电子序号化,并要求每一个互撞中电子的序号序列是不减的,从而引进了3型IDI-归结原理,并证明了它对于一阶逻辑中的子句集是完备的。 本文还顺便指出了文献[1]中关于PI-互撞的性质的一个错误,并利用本文提出的序号化方法,对这个错误进行了补救。 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-演绎的概念。 PROLOG, a kind of first-order logic-based language, doesn't permit quantification over predicates in grammer sense , hence the expressive range suitable for this language is decreased. To solve this problem,the paper presents two efficient methods of handling indirectly the higher-order predicates in PROLOG language, i.e., the "Common Predicates" method and the "Adding Auxiliary Subgoals" method. 基于一阶谓词逻辑的PROLOG语言不允许量词作用于谓词,这限制了它的表达和处理范围。本文提出了两种PROLOG(间接)处理高阶谓词的方法,即“公用谓词”方法和“附加子目标”方法。 << 更多相关文摘
 相关查询

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

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

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