iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://doi.org/10.1007/BF00991483
Simplification of fuzzy switching functions | International Journal of Parallel Programming Skip to main content
Springer Nature Link
Log in

Simplification of fuzzy switching functions

  • Published:
International Journal of Computer & Information Sciences Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. F. P. Preparata and R. T. Yeh, “Continuously valued logic,”J. Comput. Syst. Sci. 6(5): 397–418 (1972).

    Google Scholar 

  2. A. Kandel, “On minimization of fuzzy functions,”IEEE Trans. Comput. C-22(9):826–832 (1973).

    Google Scholar 

  3. L. A. Zadeh, “Fuzzy sets,”Inf. Control 8:338–353 (1965).

    Google Scholar 

  4. A. Kandel, “A note on the simplification of fuzzy switching functions,”CSR 139, Computer Science Department, New Mexico Institute of Mining and Technology, Socorro, New Mexico (1975).

    Google Scholar 

Download references

Author information

Author notes

  1. Thomas P. Neff

    Present address: Computer Science Department, Cornell University, Ithaca, New York

Authors and Affiliations

  1. Computer Science Department, New Mexico Institute of Mining and Technology, Socorro, New Mexico

    Thomas P. Neff

  2. Electrical Engineering Department, Ben-Gurion University of the Negev, Beer-Sheva, Israel

    Abraham Kandel

Authors
  1. Thomas P. Neff
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Abraham Kandel
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

On leave from the Computer Science Department, New Mexico Institute of Mining and Technology, Socorro, New Mexico.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Neff, T.P., Kandel, A. Simplification of fuzzy switching functions. International Journal of Computer and Information Sciences 6, 55–70 (1977). https://doi.org/10.1007/BF00991483

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00991483

Key words

Search

Navigation