直觉F推理与普通F推理的比较研究

直觉F推理克服了普通F推理在不确定性信息的描述、推理结果可信性等方面存在的局限性。在介绍普通F推理直觉化扩展的基础上,首先分析了两类推理算法的相互转化问题,指出普通F推理是直觉F推理的一种特例,当直觉指数为0时二者可相互转化。其次,比较了两类算法的还原性,分析表明Zadeh型、Mamdani型、Larsen型直觉F推理算法与其对应的普通F推理算法具有相同的还原性。最后,通过实例研究了直觉F推理算法在推理结果精度、可信性上的优势,从而较普通F推理更适用于智能控制与决策。     

Fuzzy inference on an analog fuzzy chip

Our analog fuzzy processor features an inference speed of more than 1 million fuzzy logical inferences per second, excluding defuzzification. A rule chip processes fuzzy inferences while a second chip handles defuzzification, a functional division that facilitates flexible system configuration. The chips are compact fuzzy systems that save chip area and are suitable for built-in applications. They process high-speed fuzzy logic operations in parallel mode and, during execution of fuzzy inferences, feature an adaptable fuzzy system based on a rule set     

Subsystem inference representation for fuzzy systems based uponproduct-sum-gravity rule

A new representation which expresses a product-sum-gravity (PSG) inference in terms of additive and multiplicative subsystem inferences of single variable is proposed. The representation yields additional insight into the structure of a fuzzy system and produces an approximate functional characterization of its inferred output. The form of the approximating function is dictated by the choice or polynomial, sinusoidal, or other designs of subsystem inferences. With polynomial inferences, the inferred output approximates a polynomial function the order of which is dependent on the numbers of input membership functions. Explicit expressions for the function and corresponding error of approximation are readily obtained for analysis. Subsystem inferences emulating sinusoidal functions are also discussed. With proper scaling, they produce a set of orthonormal subsystem inferences. The orthonormal set points to a possible “modal” analysis of fuzzy inference and yields solution to an additive decomposable approximation problem. This work also shows that, as the numbers of input membership functions become large, a fuzzy system with PSG inference would converge toward polynomial or Fourier series expansions. The result suggests a new framework to consider fuzzy systems as universal approximators     

A binary relation inference network Part 1. General concepts

Many human and machine reasoning tasks require complicated inferences between objects and events, in which the constituting inference processes depend in turn on successive inferences on more basic binary relations. Given a set of n binary relations between m different objects or events, it is possible to infer other consistent binary relations, to check for relation inconsistency, to resolve conflicts in multiple inferences, by an efficient form of parallel computation: a binary relation inference network. This paper proposes a synchronous computational mechanism for such an inference network, and discusses its topology and physical implementation structures. Network properties and behaviours have also been studied, and some interesting results on computational passes, structural graph, unconstrained and constrained networks, energy functions and convergence conditions are obtained. Potential applications of the inference network for a time-referencing problem and for an autonomous air-traffic controller are technically feasible.     

Fast inference in SAM fuzzy systems using transition matrices

Fast inference using transition matrices (FITM) is a new fast algorithm for performing inferences in fuzzy systems. It is based on the assumption that fuzzy inputs can be expressed as a linear composition of the fuzzy sets used in the rule base. This representation let us interpret a fuzzy set as a vector, so we can just work with the coordinates of it instead of working with the whole set. The inference is made using transition matrices. The key of the method is the fact that a lot of operations can be precomputed offline to obtain the transition matrices, so actual inferences are reduced to a few online matrix additions and multiplications. The algorithm is designed for the standard additive model using the sum-product inference composition.     

Fuzzy inference in rule-based real-time control

In this paper research into the application of ‘expert system’-like inference mechanisms in the field of fuzzy control is adressed. Using techniques from the area of rule-based expert systems, a more flexible way of design and modification is presented of new and existing fuzzy systems for modelling and control. In comparison with ‘normal’ applications of fuzzy inference, the ćompositional rule of inference is replaced by a fuzzy inference engine. General applicability of the fuzzy inference engine is made possible by its general character as a fuzzy expert system shell. Succesful implementations in simulation and realtime control environments show the flexibility and usefullness of the described fuzzy inference engine.     

Nonconservative exact small-sample inference for discrete data

Exact small-sample methods for discrete data use probability distributions that do not depend on unknown parameters. However, they are conservative inferentially: the actual error probabilities for tests and confidence intervals are bounded above by the nominal level. This article surveys ways of reducing or even eliminating the conservatism. Fuzzy inference is a recent innovation that enables one to achieve the error probability exactly. We present a simple way of conducting fuzzy inference for discrete one-parameter exponential family distributions. In practice, most scientists would find this approach unsuitable yet might be disappointed by the conservatism of ordinary exact methods. Thus, we recommend using exact small-sample distributions but with inferences based on the mid-P value. This approach can be motivated by fuzzy inference, it is less conservative than standard exact methods, yet usually it does well in terms of achieving desired error probabilities. We illustrate for inferences about the binomial parameter.     

Nonconservative exact small-sample inference for discrete data

Exact small-sample methods for discrete data use probability distributions that do not depend on unknown parameters. However, they are conservative inferentially: the actual error probabilities for tests and confidence intervals are bounded above by the nominal level. This article surveys ways of reducing or even eliminating the conservatism. Fuzzy inference is a recent innovation that enables one to achieve the error probability exactly. We present a simple way of conducting fuzzy inference for discrete one-parameter exponential family distributions. In practice, most scientists would find this approach unsuitable yet might be disappointed by the conservatism of ordinary exact methods. Thus, we recommend using exact small-sample distributions but with inferences based on the mid-P value. This approach can be motivated by fuzzy inference, it is less conservative than standard exact methods, yet usually it does well in terms of achieving desired error probabilities. We illustrate for inferences about the binomial parameter.     

A hardware digital fuzzy inference engine using standard integrated circuits

The paper describes a general-purpose board-level fuzzy inference engine intended primarily for experimental and educational applications. The components are all standard TTL integrated circuits (7400 series) and CMOS RAMs (CY7C series). The engine processes 16 rules in parallel with two antecedents and one consequent per rule. The design may easily be scaled to accommodate more or fewer rules. Static RAMs are used to store membership functions of both antecedent and consequent variables. “Min-max” composition is used for inferencing, and for defuzzification, the mean of maxima strategy is used. Simulation on VALID CAE software predicts that the engine is capable of performing up to 1.56 million fuzzy logic inferences per second.     

A context switchable fuzzy inference chip

This paper describes a novel design of a fuzzy inference chip that allows for real-time online context switching. A context refers to a situation or scenario of an application requiring specific domain knowledge. In particular, our focus is on the class of applications involving embedded fuzzy control. The domain knowledge therefore refers to fuzzy rules and memberships. The kind of applications being considered is real-time in nature, which necessitates the implementation of hardware for fuzzy inferencing. The chip architecture is described and details on the design of the chip is presented.     

The construction of a fuzzy inference network by extension of the rule inference network

Fuzzy logic can bring about inappropriate inferences as a result of ignoring some information in the reasoning process. Neural networks are powerful tools for pattern processing, but are not appropriate for the logical reasoning needed to model human knowledge. The use of a neural logic network derived from a modified neural network, however, makes logical reasoning possible. In this paper, we construct a fuzzy inference network by extending the rule–inference network based on an existing neural logic network. The propagation rule used in the existing rule–inference network is modified and applied. In order to determine the belief value of a proposition pertaining to the execution part of the fuzzy rules in a fuzzy inference network, the nodes connected to the proposition to be inferenced should be searched for. The search costs are compared and evaluated through application of sequential and priority searches for all the connected nodes.     

Fuzzy classifications using fuzzy inference networks

In this paper, fuzzy inference models for pattern classifications have been developed and fuzzy inference networks based on these models are proposed. Most of the existing fuzzy rule-based systems have difficulties in deriving inference rules and membership functions directly from training data. Rules and membership functions are obtained from experts. Some approaches use backpropagation (BP) type learning algorithms to learn the parameters of membership functions from training data. However, BP algorithms take a long time to converge and they require an advanced setting of the number of inference rules. The work to determine the number of inference rules demands lots of experiences from the designer. In this paper, self-organizing learning algorithms are proposed for the fuzzy inference networks. In the proposed learning algorithms, the number of inference rules and the membership functions in the inference rules will be automatically determined during the training procedure. The learning speed is fast. The proposed fuzzy inference network (FIN) classifiers possess both the structure and the learning ability of neural networks, and the fuzzy classification ability of fuzzy algorithms. Simulation results on fuzzy classification of two-dimensional data are presented and compared with those of the fuzzy ARTMAP. The proposed fuzzy inference networks perform better than the fuzzy ARTMAP and need less training samples.     

A novel approach for multistage inference fuzzy control

This paper presents a methodology to the design of a multistage inference fuzzy controller in which the consequence in an inference stage is passed to the next stage as fact, and so forth. A new general method which is based on a performance index of the control system is used to generate fuzzy rule bases for the multistage inference. This proposed method can reduce the design cycle time. In order to reduce the computation time, a method for precomputing the match-degrees of fuzzy values is adopted. Thus, the number of operations that must be carried out at execution time can be significantly reduced. The new method has been applied to two applications, a two-trailer-and-truck system and a three-trailer-and-truck system. The simulation studies showed that the proposed method is feasible.     

Genetic tuning of fuzzy inference within fuzzy classifier systems

Abstract: In generating a suitable fuzzy classifier system, significant effort is often placed on the determination and the fine tuning of the fuzzy sets. However, in such systems little thought is given to the way in which membership functions are combined within the fuzzy rules. Often traditional fuzzy inference strategies are used which consequently provide no control over how strongly or weakly the inference is applied within these rules. Furthermore such strategies will allow no interaction between grades of membership. A number of theoretical fuzzy inference operators have been proposed for both regression and classification problems but they have not been investigated in the context of real-world applications. In this paper we propose a novel genetic algorithm framework for optimizing the strength of fuzzy inference operators concurrently with the tuning of membership functions for a given fuzzy classifier system. Each fuzzy system is generated using two well-established decision tree algorithms: C4.5 and CHAID. This will enable both classification and regression problems to be addressed within the framework. Each solution generated by the genetic algorithm will produce a set of fuzzy membership functions and also determine how strongly the inference will be applied within each fuzzy rule. We investigate several theoretical proven fuzzy inference techniques (T-norms) in the context of both classification and regression problems. The methodology proposed is applied to a number of real-world data sets in order to determine the effects of the simultaneous tuning of membership functions and inference parameters on the accuracy and robustness of fuzzy classifiers.     

On the extension of the compositional rule of inference

In this article we introduce an extension of Zadeh's compositional rule of inference in terms of the general rule of inference using a triangular norm extended to n arguments. Using this extension, all inferences schemes, crisp as well as fuzzy, based on the compositional rule of inference can be obtained in a uniform way. © 1993 John Wiley & Sons, Inc.     

A multilevel systolic approach for fuzzy inference hardware

Our digital fuzzy processor's main features are high throughput, performance independent of fuzzy-model size, high design parameter flexibility, Max-Min inference, and ability to handle a large number of complex rules without loss of efficiency. We carried out circuit development using a VHDL simulator, with European Silicon Structures' 1-μm standard cells. We have achieved performance results of over 10-million fuzzy logical inferences per second     

The use of explicit goals for knowledge to guide inference and learning

Combinatorial explosion of inferences has always been a central problem in artificial intelligence. Although the inferences that can be drawn from a reasoner's knowledge and from available inputs is very large (potentially infinite), the inferential resources available to any reasoning system are limited. With limited inferential capacity and very many potential inferences, reasoners must somehow control the process of inference. Not all inferences are equally useful to a given reasoning system. Any reasoning system that has goals (or any form of a utility function) and acts based on its beliefs indirectly assigns utility to its beliefs. Given limits on the process of inference, and variation in the utility of inferences, it is clear that a reasoner ought to draw the inferences that will be most valuable to it. This paper presents an approach to this problem that makes the utility of a (potential) belief an explicit part of the inference process. The method is to generate explicit desires for knowledge. The question of focus of attention is thereby transformed into two related problems: How can explicit desires for knowledge be used to control inference and facilitate resource-constrained goal pursuit in general? and, Where do these desires for knowledge come from? We present a theory of knowledge goals, or desires for knowledge, and their use in the processes of understanding and learning. The theory is illustrated using two case studies, a natural language understanding program that learns by reading novel or unusual newspaper stories, and a differential diagnosis program that improves its accuracy with experience.     

基于分散模糊推理的多输入多输出系统预测控制

对于动态过程具有明显迟延和惯性的MIMO系统,常规模糊控制难以建立模糊规则,控制效果不理想.针对MIMO控制对象,提出一种基于分散模糊推理的预测控制(predictive control based on decentralized fuzzy inference, DFIPC)方法.构造一组与被控输出相对应的分散模糊推理模块,每个推理模块利用一组分散的模糊推理单元,分别根据各个输出的期望值与预测值之间的偏差进行分散推理.在时间层面,根据动态响应程度对推理结果进行加权综合,获得等效控制输入;进一步,通过对等效控制输入加权综合产生系统实际控制输入增量,从而有效克服模糊推理系统处理多维输入信息时模糊规则难以建立的困难.最后,通过实验验证所提出控制方法对于迟延和惯性明显的MIMO控制对象的有效性和适应性.     

Robustness of interval-valued fuzzy inference

Since interval-valued fuzzy set intuitively addresses not only vagueness (lack of sharp class boundaries) but also a feature of uncertainty (lack of information), interval-valued fuzzy reasoning plays a vital role in intelligent systems including fuzzy control, classification, expert systems, and so on. To utilize interval-valued fuzzy inference better, it is very important to study the fundamental properties of interval-valued fuzzy inference such as robustness. In this paper, we first discuss the robustness of interval-valued fuzzy connectives. And then investigate the robustness of interval-valued fuzzy reasoning in terms of the sensitivity of interval-valued fuzzy connectives and maximum perturbation of interval-valued fuzzy sets. These results reveal that the robustness of interval-valued fuzzy reasoning is directly linked to the selection of interval-valued fuzzy connectives.