Investigating The Piece-Wise Linearity And Benchmark Related To Koczy-Hirota Fuzzy Linear Interpolation

arXiv.org Artificial Intelligence

Fuzzy Rule Interpolation (FRI) reasoning methods have been introduced to address sparse fuzzy rule bases and reduce complexity. The first FRI method was the Koczy and Hirota (KH) proposed "Linear Interpolation". Besides, several conditions and criteria have been suggested for unifying the common requirements FRI methods have to satisfy. One of the most conditions is restricted the fuzzy set of the conclusion must preserve a Piece-Wise Linearity (PWL) if all antecedents and consequents of the fuzzy rules are preserving on PWL sets at {\alpha}-cut levels. The KH FRI is one of FRI methods which cannot satisfy this condition. Therefore, the goal of this paper is to investigate equations and notations related to PWL property, which is aimed to highlight the problematic properties of the KH FRI method to prove its efficiency with PWL condition. In addition, this paper is focusing on constructing benchmark examples to be a baseline for testing other FRI methods against situations that are not satisfied with the linearity condition for KH FRI.


SIGMAN96-014.pdf

AAAI Conferences

The problcmls of AI effectivent s in manufacturing for Design, Scheduling, Control and Proce -.; Diagnosis are considered. We have developed an effective dialog procedure for a designer. This procedure I ei him to identify file no..xh.'d parameters of a d igned product, i.e., to distinct acceptable paranleters, utm acceptable parameters and paran eters that require additional design sttgly. In lx'x'luling we developed a new intelligent procedure to formulate and find an effective schedule.


Reduction of fuzzy automata by means of fuzzy quasi-orders

arXiv.org Artificial Intelligence

In our recent paper we have established close relationships between state reduction of a fuzzy recognizer and resolution of a particular system of fuzzy relation equations. In that paper we have also studied reductions by means of those solutions which are fuzzy equivalences. In this paper we will see that in some cases better reductions can be obtained using the solutions of this system that are fuzzy quasi-orders. Generally, fuzzy quasi-orders and fuzzy equivalences are equally good in the state reduction, but we show that right and left invariant fuzzy quasi-orders give better reductions than right and left invariant fuzzy equivalences. We also show that alternate reductions by means of fuzzy quasi-orders give better results than alternate reductions by means of fuzzy equivalences. Furthermore we study a more general type of fuzzy quasi-orders, weakly right and left invariant ones, and we show that they are closely related to determinization of fuzzy recognizers. We also demonstrate some applications of weakly left invariant fuzzy quasi-orders in conflict analysis of fuzzy discrete event systems.


New Movement and Transformation Principle of Fuzzy Reasoning and Its Application to Fuzzy Neural Network

arXiv.org Artificial Intelligence

In this paper, we propose a new fuzzy reasoning principle, so called Movement and Transformation Principle(MTP). This Principle is to obtain a new fuzzy reasoning result by Movement and Transformation the consequent fuzzy set in response to the Movement, Transformation, and Movement-Transformation operations between the antecedent fuzzy set and fuzzificated observation information. And then we presented fuzzy modus ponens and fuzzy modus tollens based on MTP. We compare proposed method with Mamdani fuzzy system, Sugeno fuzzy system, Wang distance type fuzzy reasoning method and Hellendoorn functional type method. And then we applied to the learning experiments of the fuzzy neural network based on MTP and compared it with the Sugeno method. Through prediction experiments of fuzzy neural network on the precipitation data and security situation data, learning accuracy and time performance are clearly improved. Consequently we show that our method based on MTP is computationally simple and does not involve nonlinear operations, so it is easy to handle mathematically.


On revising fuzzy belief bases

arXiv.org Artificial Intelligence

We look at the problem of revising fuzzy belief bases, i.e., belief base revision in which both formulas in the base as well as revision-input formulas can come attached with varying truth-degrees. Working within a very general framework for fuzzy logic which is able to capture a variety of types of inference under uncertainty, such as truth-functional fuzzy logics and certain types of probabilistic inference, we show how the idea of rational change from 'crisp' base revision, as embodied by the idea of partial meet revision, can be faithfully extended to revising fuzzy belief bases. We present and axiomatise an operation of partial meet fuzzy revision and illustrate how the operation works in several important special instances of the framework.