修正的RDP逻辑系统中的广义矛盾式

讨论了修正的RDP逻辑系统中的广义矛盾式,并对该系统中的广义矛盾式进行了分划;给出了修正的RDP逻辑系统中的广义矛盾式之间的一种降级算法并讨论了它的性质。     

关于择优蕴涵的悖论

本文基于对蕴涵悖论的讨论，分析了已有非单调逻辑，次协调逻辑中择优蕴涵的合理性，发现由于这些择优蕴涵对结论缺少限制，从而不可避免地有从而不可避免地有蕴悖论。     

一个经典悖论在类比学习中的解决

自动知识获取的知识库一直面临因不协调引起的知识不一致问题.经典逻辑不具备处理不协调性的能力,而次协调逻辑是一个能够在不协调的情况下进行正常推理的逻辑.本文试图通过将经典悖论的一个例子转成类比学习中的模型,用次协调的思想对在类比学习中解决知识前后不一致性问题作一些探讨.     

悖论逻辑的表演算

悖论逻辑ＬＰ是一个超协调逻辑，发展超协调逻辑（ＬＰ）的目的是使得不会从矛盾推出任一命题，但它有一个主要缺点：就是一些在经典逻辑中有效的推理在ＬＰ中不再有效；极小悖论逻辑ＬＰｍ能克服这个缺点，使得在没有矛盾的直接影响下超协调逻辑等价于经典逻辑．ＬＰ和ＬＰｍ原来都只给出语义定义，虽然已有ＬＰ的证明论，但如何得到一个ＬＰｍ的证明论仍是一个未解问题．本文提出了一种可靠与完全的表演算作为ＬＰ与ＬＰｍ的证明论．     

真实的谎言——图形中的矛盾空间问题

优秀的设计来源于意念的创造,矛盾空间是艺术空间,是创造性思维的重要表现形式之一。本文由一部影片开始,引发了对于视觉思维、矛盾空间、数学与悖论之间的关系的思考。     

悖论逻辑及其表演算

悖论逻辑LP是一个超协调逻辑,极小悖论逻辑LPm是一个LP的非单调逻辑扩展.本文给出了一阶LP和LPm的表演算.为此,本文在论证了(极小)悖论逻辑语义性质基础上,首先给出一个LP的(记号)表演算,然后给出一个LPm的极小表演算,并证明了两个表演算分别对于LP和LPm语义的可靠与完全性定理.     

修正的Gdel逻辑系统中子代数的广义重言式理论

将修正的Gdel逻辑系统中的广义重言式理论进行推广,讨论其序稠密子代数的广义重言式理论,并利用可达广义重言式概念和α-矛盾式概念在G的序稠密子代数中给出F(S)关于┐同余的一个分划.     

模糊逻辑系统与支持向量机的关系探索

研究了模糊逻辑系统和支持向量机的关系,指出模糊逻辑系统是以峰点作为支持向量,以隶属函数作为基函数的推理系统．模糊逻辑系统是一种特殊的支持向量机。文中提出了一种基于模糊规则的支持向量机控制模型,仿真结果表明了这种模型的可行性和有效性。     

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

讨论了修正的RDP逻辑系统中序稠密子代数的广义重言式理论,并利用可达广义重言式概念和[α-]矛盾式概念在[RDP]的序稠密子代数中给出[F(S)]关于[～]同余的一个分划。     

修正的G(o)del逻辑系统中子代数的广义重言式理论

将修正的G(o)6del逻辑系统中的广义重言式理论进行推广,讨论其序稠密子代数的广义重言式理论,并利用可达广义重言式概念和α-矛盾式概念在G-的序稠密子代数中给出F(S)关于┓同余的一个分划.     

Tableau Systems for Paraconsistency and Minimal Inconsistency

In this paper,the semantics of a paraconsistent logic and its nonmonotonic extension by minimal inconsistency are presented first.And then signed tableaux for paraconsistent logic and minimal tableaux for logic of minimal inconsistency is proposed.Finally,the reduction of logic of paraconsistency and minimal inconsistncy on ordinary semantics which provides new approach to proof procedure and implementation of paraconsistency and minimal inconsistency are provided.     

A fact dependency system for the logic programmer

We describe experimental work in logic programming for architects, leading to the setting up of a fact dependency system. The system operates as an interpreter of the user's instructions, storing his decision and the conclusions inferred from those decisions. Consistency from a user's point of view is automatically maintained. A separate introduction to the Prolog logic programming language is appended to this paper.     

Three-dimensional fuzzy logic system for process modeling and control

The traditional fuzzy logic system (FLS) can only model and control the process in two-dimensional nature. Many of real-world systems are of multidimensional features, such as, thermal and fluid processes with spatiotemporal dynamics, biological systems, or decision-making processes that contain stochastic and imprecise uncertainties. These types of systems are difficult for the traditional FLS to model and control because they require a third dimension for spatial or probabilistic information. The type-2 fuzzy set provides the possibility to develop a three-dimensional fuzzy logic system for modeling and controlling these processes in three-dimensional nature.     

A logic programming system for nonmonotonic reasoning

The evolution of logic programming semantics has included the introduction of a new explicit form of negation, beside the older implicit (or default) negation typical of logic programming. The richer language has been shown adequate for a spate of knowledge representation and reasoning forms.The widespread use of such extended programs requires the definition of a correct top-down querying mechanism, much as for Prolog wrt. normal programs. One purpose of this paper is to present and exploit a SLDNF-like derivation procedure, SLX, for programs with explicit negation under well-founded semantics (WFSX) and prove its soundness and completeness. (Its soundness wrt. the answer-sets semantics is also shown.) Our choice ofWFSX as the base semantics is justi-fied by the structural properties it enjoys, which are paramount for top-down query evaluation.Of course, introducing explicit negation requires dealing with contradiction. Consequently, we allow for contradiction to appear, and show moreover how it can be removed by freely changing the truth-values of some subset of a set of predefined revisable literals. To achieve this, we introduce a paraconsistent version ofWFSX, WFSX _p , that allows contradictions and for which our SLX top-down procedure is proven correct as well.This procedure can be used to detect the existence of pairs of complementary literals inWESX _p simply by detecting the violation of integrity rulesf L, -L introduced for eachL in the language of the program. Furthermore, integrity constraints of a more general form are allowed, whose violation can likewise be detected by SLX.Removal of contradiction or integrity violation is accomplished by a variant of the SLX procedure that collects, in a formula, the alternative combinations of revisable literals' truth-values that ensure the said removal. The formulas, after simplification, can then be satisfied by a number of truth-values changes in the revisable, among true, false, and undefined. A notion of minimal change is defined as well that establishes a closeness relation between a program and its revisions. Forthwith, the changes can be enforced by introducing or deleting program rules for the revisable literals.To illustrate the usefulness and originality of our framework, we applied it to obtain a novel logic programming approach, and results, in declarative debugging and model-based diagnosis problems.     

A fuzzy logic system based on Schweizer-Sklar t-norm

In recent years, the basic research of fuzzy logic and fuzzy reasoning is growing ac- tively day by day, such as the basic logic system BL proposed by Hajek[1]; fuzzy logic system MTL proposed by Esteva and Godo[2]; fuzzy reasoning, implication operators …     

Reasoning in Medical and Tutoring Systems: A Decidable First-Order Temporal Paraconsistent Non-Commutative Logic

Reasoning in medical and tutoring systems requires expressions relating not only to time-dependency, paraconsistency, constructiveness, and resource-sensitivity, but also order-sensitivity. Our objective in this study is to construct a decidable rst-order logic for appropriately expressing this reasoning. To meet this objective, we introduce a rst-order temporal paraconsistent non-commutative logic as a Gentzen-type sequent calculus. This logic has no structural rules but has some bounded temporal operators and a paraconsistent negation connective. The main result of this study is to show this logic to be decidable. Based on this logic, we present some illustrative examples for reasoning in medical and tutoring systems.     

逻辑系统Ht中三-I算法的另一种证明

在讨论Ht代数的一些性质的基础上,得到系统Ht中的三I算法的另一种证明。指出多值逻辑系统Ht中的三I算法是P还原算法,并解决了Ht中的FMT问题。在多值逻辑系统Ht中,若令t=1,则得到多值逻辑系统W。所以多值逻辑系统Ht中的结论在t=1的情况下就是多值逻辑系统W中的结论。     

Network forensics based on fuzzy logic and expert system

Network forensics is a research area that finds the malicious users by collecting and analyzing the intrusion or infringement evidence of computer crimes such as hacking. In the past, network forensics was only used by means of investigation. However, nowadays, due to the sharp increase of network traffic, not all the information captured or recorded will be useful for analysis or evidence. The existing methods and tools for network forensics show only simple results. The administrators have difficulty in analyzing the state of the damaged system without expert knowledge. Therefore, we need an effective and automated analyzing system for network forensics. In this paper, we firstly guarantee the evidence reliability as far as possible by collecting different forensic information of detection sensors. Secondly, we propose an approach based on fuzzy logic and expert system for network forensics that can analyze computer crimes in network environment and make digital evidences automatically. At the end of the paper, the experimental comparison results between our proposed method and other popular methods are presented. Experimental results show that the system can classify most kinds of attack types (91.5% correct classification rate on average) and provide analyzable and comprehensible information for forensic experts.     

逻辑系统Gn中理论的真度概念及其应用

首次在命题逻辑系统中引入理论的真度概念,使得真度的概念由公式的真度推广为公式集的真度,从而简化了发散度的概念;在逻辑系统G_n中讨论了理论Γ1、Γ2和Γ1∪Γ2的真度、相容度和发散度之间的关系。     

Robust adaptive fuzzy logic power system stabilizer

This paper introduces a robust adaptive fuzzy controller as a power system stabilizer (RFPSS) used to damp inter-area modes of oscillation following disturbances in power systems. In contrast to the IEEE standard multi-band power system stabilizer (MB-PSS), robust adaptive fuzzy-based stabilizers are more efficient because they cope with oscillations at different operating points. The proposed controller adopts a dynamic inversion approach. Since feedback linearization is practically imperfect, components that ensure robust and adaptive performance are included in the control law to compensate for modelling errors and achieve acceptable tracking errors. Two fuzzy systems are implemented. The first system models the nominal values of the system’s nonlinearities. The second system is an adaptive one that compensates for modelling errors. A feedback linearization-based control law is implemented using the identified model. The gains of the controller are tuned via a particle swarm optimization routine to ensure system stability and minimum sum of the squares of the speed deviations. A bench-mark problem of a 4-machine 2-area power system is used to demonstrate the performance of the proposed controller and to show its superiority over other conventional stabilizers used in the literature.