一种基于非单调逻辑的模型管理方法

本文讨论了模型管理中不确定性的表达、传递、证据合成以及问题求解过程,提出了一种基于非单调逻辑的模型管理方法:将模型结构形式的不确定性表示为由建模者或领域专家对问题结构中未知或随机情形所作假设集支持的可能性命题;模型之间不确定性关系的管理通过对假设环境的真值(一致性)保持和信度调整过程来实现,其依据是在问题求解过程中出现的冲突情形或者是由决策人提供的有关命题或次判断.     

超协调逻辑（Ⅳ）—非单调超协调逻辑研究

这是关于超协调逻辑研究的末篇,文中分析了超协调逻辑与非单调逻辑的关系,并提出非单调超协调逻辑作为一种新的逻辑研究及其在形式化常识推理中的重要意义,最后,讨论了超协调逻辑的应用,特别是非单调超协调逻辑在计算机科学与人工智能中的应用问题。     

基于非单调逻辑的自适应BDI模型

由于Agent直接与现实世界发生交互作用,设计者难以事先预料所有可能出现的环境状况并一一规定恰当的处理方法,Agent往往不能产生恰当的行为,从而可能导致问题求解失败。本文结合BDI模型和非单调逻辑的优点,引入了可能信念概念和信念维护算子,表达了Agent和动态环境之阃的互动关系;引入Agent价值概念和行为规划算子,表达了期 期望和意图之间的动态约束关系,很好地解决了Agent在非预期环境中的适应性问题。     

知识的非单调处理

演绎逻辑对人类认识世界的处理是单调的,但是在这种基础上建立起来的推理系统与人类对客观世界的认识过程往往是不一致的。非单调逻辑及其推理系统为我们有效地处理人类认识的不完全性提供了一个颇有前途的理论工具。本文简要介绍非单调逻辑的基本问题,并着重讨论三种基本的也是重要的非单调推理形式,即缺省逻辑、模态逻辑和约束推理。     

f-SHOIQN:一种模糊非单调描述逻辑

针对描述逻辑无法表示语义网中模糊和非单调知识的问题,在模糊描述逻辑f-SHOIQ基础上增加弱否定构造算子,提出模糊非单调的描述逻辑f-SHOIQ_N。使用弱否定标记模糊非单调原子概念,进而表示模糊非单调规则。将模糊非单调规则引入模糊描述逻辑f-SHOIQ,用来表示模糊和非单调知识。构建f-SHOIQ_N的知识库,给出该知识库中模糊非单调知识和模糊单调知识处理方式。为处理模糊非单调知识库中规则的竞争并满足描述逻辑中概念包含、相等的问题,提出f-SHOIQ_N中竞争规则的优先级判定算法。分析f-SHOIQ_N具有的性质,并给出相关证明。     

一种基于非单调逻辑理论的入侵检测系统

提出了用模糊默认理论改造传统的单调推理机制和响应引擎的方法,从而建立了基于人工智能的入侵检测系统。实验结果表明,改进后的系统不仅能适应高速主干网络的实时入侵检测需要,而且灵敏性有很大的提高;由于采用了响应回卷技术和面向代价的动态响应政策,从而大幅度降低了入侵检测和响应的代价。     

一个面向安全协议分析的非单调逻辑

本文提出一种对安全协议进行分析的非单调逻辑。使用知识集描述已知的断言,使用信念描述安全协议系统的默认判断,通过推理和非单调的信念维护,可以验证安全协议的安全性。     

非单调性和不一致性的处理——一个基于线性逻辑的方法

本文提出一种基于线性逻辑的理论L1,它除了能较好地反映常识推理的非单调性外,还可以在矛盾存在的情况下继续组织有效的推理。     

逻辑程序中的否定问题与非单调逻辑

1引言 常识推理的一个共同特性是在不完全知识下的推理,非单调推理提供了不完全知下的推理方法,它能在有限如识的基础上得出一些结论,而当知识进一步丰富时这些结论是可销的。最著名的非单     

DEFAULT LOGICS: A UNIFIED VIEW

Default logic has been introduced for handling reasoning with incomplete knowledge. It has been widely studied, and various definitions have been proposed for it. Most of the variants have been defined by means of fixed points of some operator. We propose here another approach, which is based on a study of the way in which general rules with exceptions, used in a default reasoning process, can contradict one another. We then isolate sets of noncontradicting rules, as large as possible in order to exploit as much information as possible, and construct, for each of these sets of rules, the set of conclusions that can be deduced from it. We show that our framework encompasses most of the existing variants of default logic, allowing those variants to be compared from a knowledge representation point of view. Our approach also enables us to provide an operational definition of extensions in some interesting cases. Proof-theoretical and semantical aspects are investigated.     

NONMONOTONIC LOGIC AND STATISTICAL INFERENCE*

Classical statistical inference is nonmonotonic: obtaining more evidence or obtaining more knowledge about the evidence one has can lead to the replacement of one statistical conclusion by another, or the complete withdrawal of the original conclusion. While it has long been argued that not all nonmonotonic inference can be accounted for in terms of relative frequencies or objective probabilities, there is no doubt that much nonmonotonic inference can be accounted for in this way. Here we seek to explore the close connection between classical statistical inference and default logic, treating statistical inference within the framework of default logic, and showing that nonmonotonic logic in general, and default logic in particular, needs to take account of certain features of statistical inference. Default logic must take account of statistics, but at the same time statistics can throw light on problematic cases of default inference.     

基于信度语义的算子模糊逻辑

本文在算子集与值域不同的算子格上，基于信度语义定义了一种归结推理更自然、具有结合性的算子模糊逻辑ＢＡＯＦＬ及一种语义有层次性的，非单调的算子模糊逻辑ＮＭＯＦＬ。     

A FRAMEWORK FOR LOGICS OF EXPLICIT BELIEF

The epistemic notions of knowledge and belief have most commonly been modeled by means of possible worlds semantics. In such approaches an agent knows (or believes) all logical consequences of its beliefs. Consequently, several approaches have been proposed to model systems of explicit belief, more suited to modeling finite agents or computers. In this paper a general framework is developed for the specification of logics of explicit belief. A generalization of possible worlds, called situations, is adopted. However the notion of an accessibility relation is not employed; instead a sentence is believed if the explicit proposition expressed by the sentence appears among a set of propositions associated with an agent at a situation. Since explicit propositions may be taken as corresponding to "belief contexts" or "frames of mind," the framework also provides a setting for investigating such approaches to belief. The approach provides a uniform and flexible basis from which various issues of explicit belief may be addressed and from which systems may be contrasted and compared. A family of logics is developed using this framework, which extends previous approaches and addresses issues raised by these earlier approaches. The more interesting of these logics are tractable, in that determining if a belief follows from a set of beliefs, given certain assumptions, can be accomplished in polynomial time.     

基于泛逻辑学的模糊逻辑关系柔性的研究

模糊逻辑是许多实际应用的逻辑基础,但是其理论基础还不太成熟,不能够实现真正的柔性,这也就影响了它的应用范围.逻辑学正处于第二次革命中,也就是由刚性逻辑到柔性逻辑的转变,泛逻辑学正是由何华灿教授建立的一种新的柔性逻辑体系.只有在泛逻辑学的框架内才能真正实现模糊逻辑关系的柔性化.     

超协调限制逻辑

本文给出了一阶超协调限制逻辑ＬＰｓ的定义，并证明了它与悖论逻辑（ＬＰ与ＬＰｍ）和限制逻辑（ＣＩＲＣ）的关系，ＬＰ作为一种非单调超协调逻辑具有非单逻辑和超协调逻辑的优点，而用能解决非单调逻辑和超协调逻辑存在的问题，它可作为在不完全与不协调知识下常识推理的形式化，因此它的知识表示中具有广泛的应用。     

TEMPORAL REASONING WITH THE MODAL LOGIC Z

This article presents a formal theory of concurrent actions that handles the qualification, ramification, and frame problems. The theory is capable of temporal explanation, i.e., reasoning forward and backward. The approach uses the modal logic Z to extend the work of Lifschitz and Rabinov on miracle-based temporal reasoning. The advantages of miracles for describing unknown actions are augmented with the ability to handle concurrent actions that can provide for the most economical explanation of state changes. For temporal explanation problems restricted to finite domains, it has a worst-case exponential decision procedure. The theory is as general as first-order logic in what it can express as preconditions and consequences of actions.     

一个MC逻辑及其逻辑程序的语义

本文定义了一个多ｃｏｎｔｅｘｔ逻辑结构。ＭＣＯ在几个方面推广了传统的一阶逻辑：每个ｃｏｎｔｅｘｔ相关一个理论；Ｃｏｎｔｅｘｔ间存在ｏｕｔｅｒ关系；     

THE LOGIC OF AUTOMATA

Automata are the prime example of general systems over discrete spaces, and yet the theory of automata is fragmentary and it is not clear what makes a general structure an automaton. This paper investigates the logical foundations of automata relating it to the semantics of our notions of uncertainty, state and state-determined. A single framework is established for the conventional spectrum of automata: deterministic, probabilistic, fuzzy, and non-deterministic, which shows this set to be, in some sense, complete. Counter-examples are then developed to show that this spectrum alone is inadequate to describe the behaviour of certain forms of uncertain system. Finally a general formulation is developed based on the fundamental semantics of our notion of a state that shows that the logical Structure of an automaton must be at least a positive ordered semiring. The role of probability logic, its relationship to fuzzy logic, the rotes of topological models of automata, and the symmetry between inputs and outputs in hyperstate/hyperinput-determinedsystems are also discussed.     

一个在弗协调逻辑中的限制

本文通过应用限制到一个弗协调逻辑给出一种弗协调限制,弗协调限制是一种弗协调非单调逻辑,它能被极小化语义所刻划,并具有两方面优点：非单调逻辑在包含矛盾时是不平凡的;弗协调逻辑在矛盾没有影响时等价于经典逻辑．