逻辑函数的双逻辑综合与优化

针对传统布尔逻辑在电路面积优化中存在的不足,提出了一种用传统布尔逻辑和Reed-Muller(RM)逻辑相结合的双逻辑优化算法.通过将原逻辑函数的乘积项转化为不相交乘积项,并利用不相交乘积项的位操作,将逻辑函数的覆盖分成2个部分,使之分别适合布尔逻辑综合和RM逻辑综合;同时提出了适合双逻辑函数的逻辑功能验证方法.双逻辑优化算法用C语言编程实现并用MCNC标准电路进行测试.实验结果表明,与单一的布尔逻辑综合结果相比,在绝大多数情况下文中算法可使电路面积获得进一步优化.     

A Correct Logic Programming Computation of Default Logic Extensions

We present a method of representing some classes of default theories as normal logic programs. The main point is that the standart semantics (i.e., SLDNF-resolution) computes answer substitutions that correspond exactly to the extensions of the represented default theory. This means that we give a correct implementation of default logic. We explain the steps of constructing a logic program LogProg(P, D) from a given default theory (P, D), give some examples, and derive soundness and completeness results.     

次协调的模态逻辑

将次协调模糊推理方法推广到模态逻辑,提出次协调的模态逻辑,其逻辑推理关系是次协调模糊蕴含的模态推广,既可处理不一致信息,又可表示多世界模型.给出了次协调模态逻辑的正确而且完备的Gentzen型推理系统.     

基于泛逻辑学的柔性命题逻辑研究

现有的数理逻辑是刚性逻辑，不能满足研究不确定性问题的需要．概率测度是研究不确定性问题的重要数学工具．但作为概率推理理论基础的概率逻辑发展不够成熟，影响了它在不确定性推理中的广泛应用．本文第二作者在探索包含确定性和各种不确定性的现实世界逻辑规律的基础上．建立一个包容刚性逻辑和柔性逻辑的命题泛逻辑学体系．本文利用这一研究成果，对命题概率逻辑进行了探讨．     

An Interpretation of Default Logic in Minimal Temporal Epistemic Logic

When reasoning about complex domains, where information available is usually only partial, nonmonotonic reasoning can be an important tool. One of the formalisms introduced in this area is Reiter's Default Logic (1980). A characteristic of this formalism is that the applicability of default (inference) rules can only be verified in the future of the reasoning process. We describe an interpretation of default logic in temporal epistemic logic which makes this characteristic explicit. It is shown that this interpretation yields a semantics for default logic based on temporal epistemic models. A comparison between the various semantics for default logic will show the differences and similarities of these approaches and ours.     

单一逻辑约定造成的逻辑混乱及其解决办法

本文通过目前高校《微机原理及应用》教材中普遍存在着的逻辑混乱现象的具体分析,指出了产生这种现象的主要原因,并提出了解决这种混乱现象的切实可行的办法。     

A Critical Reexamination of Default Logic, Autoepistemic Logic, and Only Knowing

Fifteen years of work on nonmonotonic logic has certainly increased our understanding of the area. However, given a problem in which nonmonotonic reasoning is called for, it is far from clear how one should go about modeling the problem using the various approaches. We explore this issue in the context on two of the best–known approaches, Reiter's default logic and Moore's autoepistemic logic, as well as two related notions of "only knowing," due to Halpern and Moses and to Levesque. In particular, we return to the original technical definitions given in these papers and examine the extent to which they capture the intuitions they were designed to capture.     

经典逻辑门与量子逻辑门之比较

本文通过经典逻辑门与量子逻辑门之比较,论述了量子计算的特点、量子算法的巨大威力及量子逻辑门的实现问题。     

Logic programming with infinite sets

Using the ideas from current investigations in Knowledge Representation we study the use of a class of logic programs for reasoning about infinite sets. Our programs reason about the codes for various infinite sets. Depending on the form of atoms allowed in the bodies of clauses we obtain a variety of completeness results for various classes of arithmetic sets of integers.AMS subject classification 68T27, 03B70     

基于四值语义的缺省逻辑

基于公式变换,给出一组缺省理论的变换方法,将命题语言L中的缺省理论变换到对应的命题语言L^-＋中,保证了所得到的缺省理论的所有扩张均不平凡,并通过一种弱变换可同时保证缺省扩张的存在性．为缺省理论定义了各种四值模型,使得缺省逻辑具有非单调超协调推理能力,并证明了L^-＋中的缺省扩张与L中缺省理论的四值模型之间具有一一对应关系．四值模型描述了公式变换的语义,基于四值语义的缺省推理通过缺省理论的变换技术能在标准的缺省逻辑中实现．     

Naming Worlds in Modal and Temporal Logic

In this paper we suggest adding to predicate modal and temporal logic a locality predicate W which gives names to worlds (or time points). We also study an equal time predicate D(x, y)which states that two time points are at the same distance from the root. We provide the systems studied with complete axiomatizations and illustrate the expressive power gained for modal logic by simulating other logics. The completeness proofs rely on the fairly intuitive notion of a configuration in order to use a proof technique similar to a Henkin completion mixed with a tableau construction. The main elements of the completeness proofs are given for each case, while purely technical results are grouped in the appendix. This revised version was published online in August 2006 with corrections to the Cover Date.     

逻辑函数适于双逻辑实现的探测算法

提出一种判定逻辑函数是否适于双逻辑实现的探测算法,直接从XOR逻辑的特点出发,即2个汉明距离为2 的最小项可以由 XOR 逻辑表示.通过计算函数最小项之间的汉明距离分析其所具有的逻辑模式,给出探测适用于双逻辑实现的判断条件.该算法已用 C 语言实现,并应用于 MCNC benchmark 电路的判定测试,实验结果验证了其有效性.     

一种分布式动态描述逻辑

分析了目前描述逻辑（DL）的研究现状和存在的问题，特别是动态描述逻辑（DDL）作为语义Web逻辑基础所存在的问题．针对语义Web的特点和需求，对DDL进行了扩充，提出了一种新的描述逻辑，即分布式动态描述逻辑（D3L），给出了D3L的语法和语义，并研究了D3L的推理机制，提出了两种推理方法：直接推理和转化推理．与动态描述逻辑DDL相比，该D3L可以为语义Web提供更为合理的逻辑基础，弥补了DDL作为语义Web逻辑基础的不足．     

概率逻辑的研究

在人工智能科学中,不确定推理扮演着一个非常重要的角色,而其表示方法也很多,文中要讨论的概率逻辑便是其中之一,它是以逻辑表示为基础进行概率推理。首先,从知识表示和概率定义两个不同的角度系统地介绍了概率逻辑的产生及其发展,然后总结了它的一些基本概念,在此基础上给出了求得一致可能世界的一种逻辑系统,为概率逻辑的发展起到推动作用。最后将概率逻辑同与之容易混淆的模糊逻辑加以区分,且提出了概率逻辑的价值及其展望。     

基于多值方法的模糊逻辑函数最小化

首先提出了模糊逻辑和多值逻辑的相似性，并从开关信号理论出发建立了三值逻辑函数阈运算和模糊逻辑函数文字运算的对应关系，进而提出了基于差动电流开关理论的三值逻辑函数化简法求模糊逻辑函数最小化表达式的算法，并用该算法对几个模糊逻辑函数实例进行了化简，实例操作表明，该算法具有操作简单快捷的特点，是获得模糊逻辑函数最小化表达式的一种有效的方法。     

逻辑神经元研究综述

逻辑神经元作为神经网络重要的组成部分,一直以来备受关注.从模型设计到算法研究,成果颇多.文中针对当前逻辑神经元的研究现状作了综述,分析了模型的典型结构及特点,并明确了未来的发展方向.     

On Definability in Dependence Logic

We study the expressive power of open formulas of dependence logic introduced in Väänänen [Dependence logic (Vol. 70 of London Mathematical Society Student Texts), 2007]. In particular, we answer a question raised by Wilfrid Hodges: how to characterize the sets of teams definable by means of identity only in dependence logic, or equivalently in independence friendly logic.