共查询到20条相似文献,搜索用时 109 毫秒
1.
本文利用逻辑代数的矢量变换法分析了多值逻辑函数的展开问题,提出了分量递椎式的建立方法,举例说明了用二值元件实现多值逻辑函数的综合过程。本文结果表明,利用矢量变换法,可以用类似于二值逻辑的方法来处理多值逻辑问题。 相似文献
2.
一种逻辑强化学习的tableau推理方法 总被引:1,自引:0,他引:1
tableau方法是一种具有较强的通用性和适用性的推理方法,但由于函数符号、等词等的限制,使得自动推理具有不确定性,针对tableau推理中封闭集合构造过程具有盲目性的问题,提出将强化学习用于tableau自动推理的方法,该方法将tableau推理过程中的逻辑公式与强化学习相结合,产生抽象的状态和活动,这样一方面可以通过学习方法控制自动推理的推理顺序,形成合理的封闭分枝,减少推理的盲目性;另一方面复杂的推理可以利用简单的推理结果,提高推理的效率。 相似文献
3.
提出以二值多输出逻辑优化软件OPLG为基础,对多值逻辑函数进行逻辑优化的方法.通过对多值变量、多值函数的二进制矢量描述,将多值多维体转换为布尔表达式积项形式,从多值多维体的多值最小项出发,给出计算基本无关集的方法。对多值逻辑函数的优化通过调用二值逻辑优化软件OPLG(允许的最大输入、输出变量之和为300)来实现,二值逻辑优化的结果最终再转换为多值多维体的表示形式。 相似文献
4.
5.
一种基于集合符号的自动推理扩展方法 总被引:1,自引:0,他引:1
在多值逻辑Tableau推理的基础上,提出了一种基于集合符号的自动推理扩展方法.将符号集合作为真值,减少了Tableau的推理分枝,并可以将适合经典逻辑的推理方法和策略应用于其中,使得非经典逻辑推理经典化.使用SWI-PROLOG语言设计实现了基于集合符号的自动推理系统,在系统中使用集合符号方法,只需要在规则库中增加推理规则,即可生成规则程序,系统本身不需要任何的修改,因此一些适合于经典逻辑的推理方法和技巧就可以很容易地应用到多值逻辑、模态逻辑、直觉逻辑等非经典逻辑,也可以进一步推广到无穷值逻辑和含模糊量词(如T-算子和S-算子)的逻辑中,对于无穷值逻辑和模糊逻辑的Tableau方法研究具有一定的借鉴作用.对TPTP中的900个逻辑问题进行了证明,实验结果表明,系统在时间和空间上效率都是较高的. 相似文献
6.
多值逻辑函数发生器的优化设计方法 总被引:1,自引:0,他引:1
将二值逻辑系统的设计方法巧妙地溶入了多值逻辑系统的设计当中,找到了实现多值逻辑系统设计的最优方法.并通过典型实例的分析,总结出三点结论,可望促进多值逻辑技术的普及与发展. 相似文献
7.
Ren-RenLiu Song-QiaoChen Jian-ErChen ShuLi 《计算机科学技术学报》2004,19(C00):100-101
多值逻辑是计算机科学与技术的一个重要分支。目前的计算机结构和计算机程序大多基于二值逻辑,但由于多值逻辑有着许多独特的功能和广阔的应用前景,随着计算机科学与技术的不断进步,多值逻辑得到了前所未有的发展。 相似文献
8.
9.
10.
TMLNNs:三值/多值逻辑神经元网络 总被引:5,自引:0,他引:5
本文提出了具有三值/多值逻辑表达能力的神经元模型,即三值/多值“逻辑与”神经元和三值/多值“逻辑或”神经元,由这种逻辑神经元连接而成的多层神经网络能够实现三值/多值逻辑推理系统。本文还给出了TMLNNs的学习算法,从TMLNNs网络中容易抽取到三值/多值逻辑规则知识,可以将TMLNNs用于三值/多值逻辑规则知识的自动获取,TMLNNs模型为神经网络表示逻辑知识提供了理论基础。 相似文献
11.
12.
基于Tableau的定理机器证明系统TableauTAP 总被引:2,自引:0,他引:2
使用SWI-PROLOG语言在微机上设计实现了基于tableau的定理证明系统TabIeauTAP。该系统可以证明不含等词的经典逻辑公式童耋譬逻辑公式,通过预处理自动生成tableau规则,因此容易对其功能进行扩展。应用该系统对TPTP的400个逻辑问题进行证明,实验结果表明,TableauTAP在时间和空间效率上都是比较高的。 相似文献
13.
Karvel K Thornber 《Knowledge》1996,9(8):483-489
Analogic is the unique class of many-valued, non-monotonic logics which preserves the richness of inferences in (Boolean) logic and the manipulability of (Boolean) algebra underlying logic, and, in addition, contains a number of unexpected, emergent properties which extend inferentiability in non-trivial ways beyond the limits of logic. For example, one such inference is rada (reductio ad absurdum, reasoning by contradiction, but now in the absence of excluded middle). This is important to retain since direct proofs of many theorems are not known. Another example is chaining. Transitivity is uncommon in many-valued logics; however, in analogic we can carry out inferences in either direction even through weak links in the chain. The latter, impossible in logic, simulate intuitive leaps in reasoning. Protologic effects inferences using only (n+1) implications which require 2n implications in logic. Indeed protologic has no counterpart in logic, or any other form of reasoning. Analogic is useful in formulating problems which are largely inferential including document and pattern classification and retrieval. These inference properties, long sought after in alternative logics by adding appropriate axioms or other indicative implicit or explicit restrictions, are now available in analogic, in turn the result of removing an axiom and letting inferences become many-valued. 相似文献
14.
15.
R. Hähnle 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》1997,1(3):107-119
In this paper proof theory of many-valued logic is connected with areas outside of logic, namely, linear optimization and
computer aided logic design. By stating these not widely-known connections explicitly, I want to encourage interaction between
the mentioned disciplines. Once familiar with the others’ terminology, I believe that the respective communities can greatly
benefit from each other.
Received: 20 March 1997 / Accepted: 1 April 1997 相似文献
16.
王国俊教授在多值逻辑系统中提出了公式的真度等概念并初步建立了计量逻辑学理论,但其研究的多值命题逻辑是线性赋值格结构。在四值非线性格值逻辑系统上提出推广的真度,得到了一些平行的相关结果,说明计量逻辑学在非线性格值逻辑系统上有一定的可行性。 相似文献
17.
We present a sound, complete and relatively straightforwardtableau method for deciding valid formulas in the propositionalversion of the bundled (or suffix and fusion closed) computationtree logic BCTL*. This proves that BCTL* is decidable. It isalso moderately useful to have a tableau available for a reasonablyexpressive branching-time temporal logic. However, the maininterest in this should be that it leads us closer to beingable to devise a tableau-based technique for theorem-provingin the important full computational tree logic CTL*. 相似文献
18.
L. Di Lascio 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2001,5(6):434-439
In this paper Beth–Smullyan's tableaux method is extended to the fuzzy propositional logic. The fuzzy tableaux method is
based on the concepts of t-truth and extended graded formula. As in classical logic, it is a refutation procedure. A closed
fuzzy tableau beginning with the extended graded formula [r, A] asserting that this is not t-true, is a tableau proof of the
graded formula (A, r). The theorems of soundness, completeness, and decidability are proved. 相似文献
19.
Tableau-based Decision Procedures for Hybrid Logic 总被引:1,自引:0,他引:1
20.
In this paper, we present a new method for computing extensions and for deriving formulae from a default theory. It is based on the semantic tableaux method and works for default theories with a finite set of defaults that are formulated over a decidable subset of first-order logic. We prove that all extensions (if any) of a default theory can be produced by constructing the semantic tableau ofone formula built from the general laws and the default consequences. This result allows us to describe an algorithm that provides extensions if there are any, and to decide if there are none. Moreover, the method gives a necessary and sufficient criterion for the existence of extensions of default theories with finitely many defaults provided they are formulated on a decidable subset of FOL.This work was completed while the author was at CNRS, Marseille. 相似文献