Simplification of fuzzy switching functions |
| |
Authors: | Thomas P Neff Abraham Kandel |
| |
Affiliation: | (1) Computer Science Department, New Mexico Institute of Mining and Technology, Socorro, New Mexico;(2) Present address: Computer Science Department, Cornell University, Ithaca, New York;(3) Electrical Engineering Department, Ben-Gurion University of the Negev, Beer-Sheva, Israel |
| |
Abstract: | This paper is concerned with the study of simplification of fuzzy switching functions. A novel algorithm for generating all fuzzy prime implicants is introduced, followed by a new method of simplification of fuzzy switching functions. This algorithm is then reduced to a simple algorithm that produces only those fuzzy prime implicants that are essential. There areonly two other valid techniques for the minimization of fuzzy switching functions in the literature,(1,2) and those methods are not very suitable for computerized application. Thus, the principal advantages of this technique are the new concept of direct simplification via essential fuzzy prime implicants (without generation of all of the fuzzy prime implicants), and the fact that the algorithm is the first one to be suitable for efficient computer implementation.On leave from the Computer Science Department, New Mexico Institute of Mining and Technology, Socorro, New Mexico. |
| |
Keywords: | Minimization fuzzy switching function fuzzy prime implicant fuzzy consensus fuzzy algebra |
本文献已被 SpringerLink 等数据库收录! |
|