基于模糊逻辑的不确定知识处理（Ⅱ）：模糊逻辑的TABLEAU推理

本文基于ＴＡＢＬＥＡＵ方法，给出了模糊逻辑中一些至今缺少有效证明论的推理关系的证明论，也给出了作者提出的模糊择优蕴 的判定过程，据此说明了Ｙａｇｅｒ所给出的推理规则对其所讨论的模糊推理关系是不完备的。     

基于算子模糊的不确定程度计算

本文提出并比较了在信度语义下，计算算子模糊逻辑中公式（集）模糊程度的３种方法－－归结法、广义归结法和ＴＡＢＬＥＡＵ方法。     

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

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

基于直觉模糊逻辑的近似推理方法

针对直觉模糊逻辑及命题演算，提出了利用隶属度和犹豫度计算直觉模糊逻辑命题真值的合成方法．给出了直觉模糊逻辑命题的运算规则，重点研究了基于直觉模糊逻辑的近似推理方法．该方法包括直觉模糊取式推理，直觉模糊拒武推理及直觉模糊假官推理．井推导了相关的推理合成运算公式．以具体算例验证和表明了所提出的推导方法的正确性和有效性，以及对方法进行验证的详细步骤．     

知识概念的模糊模型及模糊目标的识别

作为ＥＢＬ（Ｅｘｐｌａｎａｔｉｏｎ－ＢａｅｓｅｄＬｅａｒｎｉｎｇ）的发展,从概念的自然形成过程出发,提出了一种新的概念模型ＦＥＢＭ（ＦｕｚｚｙＥｘｐｌａｎａｔｉｏｎ－ＢａｓｅｄＭｏｄｅｌ）当概念的解释谓词集中模糊集以及解释谓词取模糊逻辑值时,给出了求概念真值的表达式;为了解决模糊概念的识别问题,引入了概念的模糊解释树ＦＥＴ,接着给出了对象的模糊识别算法ＦＥＢＬ,最后讨论了ＦＥＢＭ与ＦＥＢＬ的可操作     

FMS故障诊断的模糊行为Petri网研究

根据ＦＭＳ故障诊断推理中知识的模糊性，提出模糊行为Ｐｅｔｒｉ网（ＦＢＰＮ）的定义，研究用模糊行为Ｐｅｔｒｉ网表示模糊产生式规则的方法，提出一种模糊反向推理机制，给出算法的实现。最后以ＢＦＥＣ—ＦＭＳ的刀库换刀故障为例，证明该方法的可行性和有效性     

基于MATLAB模糊逻辑工具箱的模糊控制系统仿真

介绍了用 ＭＡＴＬＡＢ ５．１ 模糊逻辑工具箱设计模糊控制器,并用 ＳＩＭＵＬＩＮＫ进行仿真的一般方法。该方法具有简便、直观、高效的特点。最后给出仿真结果。     

矩形板动力响应计算的迁移子结构法

矩形板动力响应计算的迁移子结构法杜国君，陈继荣（东北重型机械学院，齐齐哈尔）ＴＨＥＴＲＡＮＳＦＥＲＳＵＢＳＴＲＵＣＴＵＲＥＭＥＴＨＯＤＡＢＯＵＴＤＹＮＡＭＩＣＲＥＳＰＯＮＳＥＣＡＬＣＵＬＡＴＩＯＮＯＦＲＥＣＴＡＮＧＵＬＡＲＰＬＡＴＥＳ￥ＤｕＧｕｏ－ｊ...     

任意形状容器装液不定常晃动的边界元模型

任意形状容器装液不定常晃动的边界元模型冯振兴，李正秀（武汉大学）ＬＡＧＲＡＮＧＩＡＮＢＥＭＦＯＲＡＮＵＮＳＴＥＡＤＹＳＬＯＳＨＩＮＧＭＯＤＥＬＳＵＩＴＡＢＬＥＴＯＡＲＢＩＴＲＡＲＹＴＡＮＫＳ￥ＦｅｎｇＺｈｅｎ－ｘｉｎｇ；ＬｉＺｈｅｎ－ｘｉｕ（Ｗｕｈａ...     

模糊Petri网在FMS故障诊断中的应用研究

针对柔性制造系统（ＦＭＳ）故障诊断的特点，将模糊Ｐｅｔｒｉ网扩展为模糊行为Ｐｅｔｒｉ网（ＦＢＰＮ）．并应用于知识的表示中，讨论了ＦＭＳ系统、ＦＢＰＮ及产生式规则之间的对应关系，提出一种模糊反向推理机制，给出了利用ＦＢＰＮ进行知识表示和推理的实例．     

A connectionist production system which can perform both modus ponens and modus tollens simultaneously

Modus ponens is used in forward inference and backward inference, where the truth of the conclusion is inferred from the truth of the premise. In modus tollens, the falseness of the premise is inferred from the falseness of the conclusion. Although modus ponens is used in general connectionist production systems, modus tollens is rarely used, except in Quinlan's proposed INFERNO system and in the system proposed by Thornber. A connectionist production system called ConnPS that can perform both modus ponens and modus tollens simultaneously is described. Compared to the INFERNO system, one of the advantages of ConnPS is its supervised learning ability. The rules and examples given as external knowledge are often erroneous and incomplete. In ConnPS, these rules can be refined by using the supervised learning. Both positive and negative examples are presented to ConnPS, onto which the external rules and observations are mapped. Moreover, ConnPS's implementations of implications, conjunctions, disjunctions and negation are intuitively consistent with Boolean logic.     

基于布尔剪枝的多值广义量词Tableau推理规则简化方法

Tableau作为自动推理的有效方法之一在许多领域中有重要的应用．该文作者在已提出的布尔剪枝方法基础上,对含广义量词（交和并）规则的简化方法进行研究,建立了一套含广义量词的一阶多值逻辑公式的简化Tableau推理方法．通过实例分析,对简化前后结果对比表明,改进后的Tableau方法,在推理效率上有很大的提高．     

基于模糊聚类和矩阵分解的模糊辨识方法

通过改进模糊聚类方法确定模糊模型的前件结构,然后对模糊推理关系矩阵进行QR分解,通过分析秩的亏损来确定聚类规则的有效性,然后采用基于矩阵UD分解最小二乘确定模糊模型的后件参数,实现模糊模型的结构和参数的优化.该方法成功地应用于Box-Jenkins煤气炉数据系统建模.     

Ontology推理系统的设计与实现

SHOQ(D)描述逻辑可以对概念、角色.个体、数据类型进行推理,能够克服OIL语言不能处理命名的个体和具体数据类型的缺点.该文设计并实现了SHOQ(D)描述逻辑的ontology推理系统,在SHIQ表算法的基础上,通过修改和添加数据类型和个体的相关规则,得到SHOQ(D)表算法.该系统的实现基于FACT系统,提供了对术语知识库TKB进行操作的函数和宏,主要有向TKB中添加公理、进行推理和回答查询等.实验结果验证SHOQ(D)系统的表达能力优于FACT系统.     

A Proof Search Specification of the π-Calculus

We present a meta-logic that contains a new quantifier (for encoding “generic judgments”) and inference rules for reasoning within fixed points of a given specification. We then specify the operational semantics and bisimulation relations for the finite π-calculus within this meta-logic. Since we restrict to the finite case, the ability of the meta-logic to reason within fixed points becomes a powerful and complete tool since simple proof search can compute this one fixed point. The quantifier helps with the delicate issues surrounding the scope of variables within π-calculus expressions and their executions (proofs). We shall illustrate several merits of the logical specifications we write: they are natural and declarative; they contain no side conditions concerning names of variables while maintaining a completely formal treatment of such variables; differences between late and open bisimulation relations are easy to see declaratively; and proof search involving the application of inference rules, unification, and backtracking can provide complete proof systems for both one-step transitions and for bisimulation.     

模糊联想推理及其实现

本文给出了用模糊联想记忆网络实现肯定前件式,否定后件式或同时包含这两种模糊推理形式的充要条件,并提出了一个增加网络神经元的增强学习算法,这种学习算法能够可靠有效地用于任意多个基于规则的不同形式模糊推理。     

On the use of interval mathematics in fuzzy expert systems

Fuzzy expert systems attempt to model the cognitive processes of human experts. They currently accomplish this by capturing knowledge in the form of linguistic propositions. Real-world problems dictate the need to include mathematical knowledge as well. Pattern matching is a critical part of the inference procedure in expert systems. Matches are made between data clauses, premise clauses, and conclusion clauses, forming an inference chain. Preprocessing the clauses may generate intervals of real numbers which are compared in the fuzzy matching algorithm. These same intervals may be used in arithmetic expressions. the purpose of this article is to devise a method for incorporating arithmetic expressions into inference process of Fuzzy Expert Systems. Interval arithmetic is used to evaluate these expressions. Logical relations between intervals are analyzed using probability theory. © 1994 John Wiley & Sons, Inc.     

Adaptive Fuzzy Logics for Contextual Hedge Interpretation

The article presents several adaptive fuzzy hedge logics. These logics are designed to perform a specific kind of hedge detection. Given a premise set Γ that represents a series of communicated statements, the logics can check whether some predicate occurring in Γ may be interpreted as being (implicitly) hedged by technically, strictly speaking or loosely speaking, or simply non-hedged. The logics take into account both the logical constraints of the premise set as well as conceptual information concerning the meaning of potentially hedged predicates (stored in the memory of the interpreter in question). The proof theory of the logics is non-monotonic in order to enable the logics to deal with possible non-monotonic interpretation dynamics (this is illustrated by means of several concrete proofs). All the adaptive fuzzy hedge logics are also sound and strongly complete with respect to their [0,1]-semantics.     

汽车智能防撞自适应控制研究与仿真

针对汽车防撞模糊控制模型不能自动调整参数的缺点,建立汽车防撞自适应模糊推理模型。采用混合学习算法对自适应模糊推理模型的前提参数和结论参数进行辨识,以加速收敛。经模拟训练和仿真输出结果证明,该模型能够对汽车防撞模糊控制器隶属函数和模糊规则进行优化,较好地实现紧急报警情况下的汽车防撞自适应控制。     

提高一阶多值逻辑Tableau推理效率的布尔剪枝方法

含有量词的一阶多值Tableau方法具有统一的扩展规则，并由Zabel等人给出了可靠性和完备性的证明，但由于扩展后的分枝随着真值数目的增加而呈指数的增加，因而影响了机器推理执行的效率，该文提出了布尔剪枝方法，将带符号的公式与集合的上集／下集联系起来，使含量词的一阶多值逻辑公式的扩展规则大大简化，进一步，通过对布尔剪枝方法的分析，建立了一类特殊一阶多值逻辑正则公式的更为简洁的Tableau推理方法，该方法使得含量词的一阶多值逻辑Tableau推理类同于经典逻辑Tableau方法。