线性多步法模糊逻辑系统(英文)

根据求解常微分方程的线性多步逼近方法构造了线性多步法模糊逻辑系统以辨识由常微分方程所描述的未知动态系统,这种新的模糊逻辑系统在预测状态的同时也能够逼近系统微分方程中的未知函数,文中从理论上对精度作了分析,并用仿真验证了所得的结果。     

一类模糊逻辑系统的收敛性研究

以在理论和实际中应用广泛的Mamdani纯模糊逻辑系统为研究对象,提出了模糊格距离和格收敛性的定义并研究了它们的性质．在特征合成算法的基础上,证明了该系统的格收敛性,提出了输入状态空间和输出状态空间的划分方法,给出了控制中心和半径．     

一个基于分布推理的知识库

随着知识处理量的增大，分布式知识库成了一个很重要的发展方向。本文提出了一个基于分布推理的知识库模型，这个模型允许用户充分利用分布在各处的知识求解问题作查询，并提出了一个优化的问题求解的推理机制。     

基于遗传算法的自学习模糊逻辑系统

利用遗传算法实现模糊逻辑系统的自学习,提出了遗传算法和模糊逻辑系统的结合方式,并针对模糊逻辑系统的特点,提出了初始种群的生成方法,较大地提高了遗传模糊逻辑系统的自学习性能。仿真结果表明,该系统对复杂的非线性系统具有较好的学习效果。     

逻辑系统RDP中子代数的广义重言式理论

将RDP逻辑系统中的广义重言式理论进行推广,给出RDP逻辑系统中子代数的广义重言式概念,并讨论其序稠密子代数的广义重言式理论     

论面向对象与逻辑系统的结合

本文着重讨论了面向对象的基本思想和逻辑程序设计思想的关系,比较了各自的优缺点和相互补充的可能,从新的角度论述了将面向对象程序设计与逻辑程序设计相结合的一种可行途径,最后,提出了一系列具体的实现方法。     

基于Rete算法的多Agent的实时协同推理

1 引言多Agent系统是由若干具有一个或多个目标的Agent按照一定的信息关系和控制关系以及问题求解能力的分布模式组成的系统,它主要研究一组在逻辑上或物理上分离的Agent之间行为的协调。目前,多Agent系统已应用于诸如空中交通控制、电子商务、通讯网络管理和作业调度等生产实际领域。Agent技术应用到实际领域时映射的对象一般有     

逻辑AI中的容变能力的研究

In this paper a survey of elaboration tolerance in logical AI is provided. John McCarthy views elaboration tolerance as the key property of any formalism that can represent information in the common sense informatic situa-tion. The goal of studying elaboration tolerance is finding a formalism for describing problems logically that is as elab-oration tolerant as natural language and the associated background knowledge. In the beginning, we introduce the missionaries and cannibals problem and its elaboration problems provided by John McCarthy as the test examples of studying elaboration tolerance. Then we introduce the study of elaboration tolerance from three aspects. First of all,the study of elaboration tolerance of the existing systems is introduced such as Causal Calculator and ABSFOL. Sec-ond the study of special elaboration is presented such as elaboration of actions. Last but not least a formal definition of elaboration toleration and evaluation tools is nrmvided.     

基于FANNC的模糊逻辑系统

1 引言为了用数学方法描述和处理自然界出现的不精确、不完整的信息,如人类语言描述信息,L.A.Zadeh于1965年发表了“Fuzzy Set”的论文,提出了模糊理论。模糊理论建立在模糊集合和模糊逻辑的基础上,引入隶属函数(membershipfunction)的概念来描述那些介于“属于”和“不属于”的中间过渡过程。模糊理论已经广泛地应用于控制领域,同时结合其他技术,如神经网络、遗传算法等,形成交叉学科,用于解决单一技术不能解决的问题。     

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

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

逻辑程序模块化的研究与实现

模块化结构是当今智能语言或工具系统商品化和标准化的一个重要部分。我们在ＧＫＤ－Ｐｒｏｌｏｇ的基础上，设计并实现了一个模块化Ｐｒｏｌｏｇ系统。它同时引入了模块和执行环境的概念，并提供了对这些概念的直接支持，使Ｐｒｏｌｏｇ更适于知识的表示和操作。本文主要研究了Ｐｒｏｌｏｇ模块系统的概念和理论，描述了系统的组织结构，并结合两种实现模块机制的方法介绍了本文的主要实现技术，最后给出了我们引入的模块操作原语。     

A Calculus of Lambda Calculus Contexts

The calculus c serves as a general framework for representing contexts. Essential features are control over variable capturing and the freedom to manipulate contexts before or after hole filling, by a mechanism of delayed substitution. The context calculus c is given in the form of an extension of the lambda calculus. Many notions of context can be represented within the framework; a particular variation can be obtained by the choice of a pretyping, which we illustrate by three examples.     

利用重写系统研究缺省逻辑

本文在布尔环重量写系统中研究了缺省逻辑。一个缺省理论等价于一个布尔环方程组。本文还分析了命题缺省理论外延的结构，证明了一个缺省理论的外延的模型集合就是对应的布尔环方程组的极大缺省解，从而为确定缺省理论的外延提供了一种简便实用的方法。     

面向对象逻辑语言LKO的类型系统

文中主要介绍面向对象逻辑语言ＬＫＯ中基于声明和推理的有序类型系统，在谓词声明中，类型由有序的构子构造而成，子句中变量类型由类型推理决定，对象类型由方法声明决定，独立于便于代码复用，它可作为基类型参与项类型构造。     

A proof procedure for normal default theories

Recent research by Delgrande [6] and Geffner and Pearl [10] suggests two different semantic interpretations for normal defaults with one single representation as conditional sentences. However, they both need additional formal mechanisms for handling irrelevant information when their approaches are applied to formalising default reasoning. Delgrande in [5, 6] suggests two meta-strategies which he considers to be adequately strong to handle the orderings of defaults, and he claims they are equivalent. Furthermore, each of Delgrande's strategies is defined in terms of all sentences of the object language. In this paper, we shall prove that Delgrande's claim that his meta-strategies are equivalent is incorrect and that one of his meta-strategies can be reformulated within the framework of First Order Predicate Calculus (FOPC) and without having to consider every sentence of the object language. One advantage of such a reformalisation is its computational simplicity: to give an extension of a default theory there is only a need to consider those sentences which occur in the default theory under consideration rather than every sentence in the object language; furthermore, to provide a proof procedure for Delgrande's system as based on the meta-strategy we have formalised, one need only employ a FOPC proof procedure, rather than a conditional one.     

模型驱动的实时嵌入式系统结构设计与属性分析

实时嵌入式系统的实时性约束主要来自系统的安全性需求。传统开发方法不仅需要较长的开发周期和较高的开发费用,而且缺少对安全性的支持。本文基于模型驱动开发方法,使用结构分析和设计语言设计铁路平交道口控制系统,并使用谓词演算对系统的安全性进行分析,提高了系统的开发效率。     

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.     

Formalization of correctness of recursive definitions

We use the fixpoint approach to formalize the correctness of recursive definitions within the framework of first-order predicate calculus. Although the least fixpoint semantics is used, our results suggest some general methods of proving the correctness of recursive definitions without knowing their least fixpoints explicitly.