查询词典 propositional inference

Via the inference course of the inference machine , do key factor proper assessment and revision, inference progressively produce arranging planning good, is it use limited resource to in the hope of, efficiency of the hoist.

经由推论机的推论过程，将关键因素作适当的评估与修正，逐步推论出较佳的排程规划，以期运用有限资源，提升设备效能。

This model is used to analyze narrative texts according to the following steps:(1) surface structural operation: abstract, stage analysis, plot inference, subject evaluation, resolution revealment and coda check;(2) deep semantic inference: textual context, purpose of organizing a text and implication inference.

为了验证该模式的可操作性，本研究选取了四个叙事语篇进行分析，结果发现：这一模式不仅可用以对故事语篇进行表层结构和深层语义分析，还可用以生成或创构故事。

The properties and expression of knowledge are discussed in brief and binary and multiple truth expression and inference of knowledge are studied focally. The neural networks which can realized the three valued logic are overviewed. The new idea of uncertain inference based on three valued logic is proposed for the first time The models of neural logic, which can realize three valued logic and uncertain three valued logic inference are proposed, too. The learning algorithm of coefficient of MVL's function based on the canonical realization of MVL network is investigated for the first time and the appropriate algorithm is proposed.

4简要地论述了知识的特征及其表现形式，重点研究了知识的真值二值和多值表示法以及基于知识真值表示法的逻辑推理；通过对目前可实现三值逻辑推理的逻辑神经元及其网络的简要回顾，指出了各自的局限性，首次提出了基于三值逻辑的不定性推理的新概念以及可实现三值逻辑和三值逻辑不定性推理的逻辑神经元模型，同时对基于这种逻辑神经元模型的推理系统的应用领域进行了探索性尝试；另外，首次对基于多值逻辑网络正规实现的多值逻辑函数的系数参数的学习算法进行了研究，并提出了相应的学习算法。

At present, the research of function of inference is mainly consisted of connective inference and elaborative inference.

目前对文本阅读的推理研究，从功能上讲，主要是研究连结推理和精加工推理。

At present, the research of function of inference is mainly consisted of connective inference and elaborative inference.

但是，研究者都忽视了日常生活中常见的另外一种推理类型，即信息精确化推理。

The study of lattice-valued propositional logic system based on lattice implication algebra.On the bases of previous study, by using the concepts and methods of T algebras we established the lattice-valued propositional logic system LP , whose truth values domain is a lattice implication algebra, and discussed systematically the semantical and syntactical properties of LP , proved the soundness theorem 、consistency theorem、deduction theorem and the decidability of validity of the system when the truth values lattice is finite. We also discussed the relationship between the α-theorem of some premise, say A, and the closed sets that contain A.

本文在前人研究工作的基础上，利用T代数的概念与方法，建立了真值取于格蕴涵代数的格值命题逻辑系统LP，对它的语义及语法性质进行了较系统的研究，得到了它的可靠性定理、协调性定理及演绎定理等，证明了值格有限时系统"有效性"的可判定性并讨论了某一前提A下的α定理与包含A的闭集之间的关系。

But the content of a situated thought cannot be fully captured as propositional content: the content as delivered by the situatedness of the thinker essentially extends beyond anything that the mere propositional construal of the content can deliver.27 Because of this, although the over-all form of a transcendental argument might seem to be of a deductively valid argument e.g.

但是a situated thought的内容不能被完全把握为命题内容：内容作为被思者的situatedness给出，本质上超出了对纯粹的命题解释所能给出的内容。

Using the infinite product of unevenly distributed probability space with potential of 3, the concept of formula truth degree was introduced into the Gdel 3-valued propositional logic system. Moreover, it was proved that in the 3-value (1/4, 1/2, 1/4), measure the set of truth of degree of propositions was dense in [0, 1], and a general expression of truth degree was obtained, providing a basis for further developing approximate reasoning of 3-valued propositional logic system.

利用势为3的非均匀概率空间的无穷乘积，在Gdel三值命题逻辑系统中引入公式的真度概念，在三值逻辑(四分之一，二分之一，四分之一)测度下证明G3中全体公式的真度值之集在[0， 1]上是稠密的，并给出公式真度的表达通式，为进一步在三值命题逻辑系统中展开近似推理奠定基础。

In chapter 2, to meet the application requirements of incomplete information system, based on propositional connectives ∧、∨、→、ヲ、～ and ～, we construct medium logic propositional calculus system MP〓 and medium logic predicate calculus system MF〓.

第一章：简要说明不完全信息数据库和模糊数据库研究的目的和意义，介绍中介逻辑和模糊数据库的发展、模糊数据库系统的特性以及本文的主要研究工作。

Prenex normal form of the first order logic propositional is the key to propositional logic. Generally, there are three steps to change get a prenex normal form: first of all get rid of the connection word; Secondly, make the negative word to the front of every atomic.

对于一阶谓词化为其前束范式问题，一般可以通过三个步骤完成，首先去掉逻辑式中的连接词；其次将否定词深入到各原子公式中；最后利用永真等价式将量词逐个移到式子的前部。

"Yes, now you can give yourself airs," she said, you have got what you wanted.

"对了，您现在高兴了，"她说道，这是您所期待的。

Then the LORD said to me: Rebel Israel is inwardly more just than traitorous Judah.

上主于是对我说：＂失节的以色列比失信的犹大，更显得正义。