Abstract
In this paper we deal with a generalization of the Quine–McCluskey method. We show that the generalized method can find a normal form for any finite-valued logical function. Moreover, this normal form is simpler than that found by the intuitive method using the table of values. The method has been successfully implemented and tested on examples.
Similar content being viewed by others
References
Daňková M, Perfilieva I (2003) Logical approximation II. soft Comput 7(4):228–233
Dubrova E (2002) Multiple-valued logic synthesis and optimization. In: Logic synthesis and verification, Kluwer, Dordrecht, pp 89–114
Hoernes GE, Heilweil MF (1964) Introduction to Boolean algebra and logic design. McGraw Hill, New York, San Francisco, Toronto, London
Kandel A, Lee SC (1979) Fuzzy functions and decomposition. In: Fuzzy switching and automata: theory and applications. Edward Arnold, London, pp 93–170
Kubátová H, Blažek Z (1999) Logical systems: exercises. CTU, Prague
Petrík M (2002) Svoboda maps in many-valued logic. J Electr Eng 53(12/s):100–104
Petrík M (2003) Finding normal forms using Svoboda maps. J Electr Eng 54(12/s):93–98
Post EL (1921) Introduction to a general theory of elementary propositions. J Math 43:163–185
Williamson DP (1998) Lecture notes on approximation algorithms. IBM Research Division, New York
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Petrík, M. Quine–McCluskey method for many-valued logical functions. Soft Comput 12, 393–402 (2008). https://doi.org/10.1007/s00500-007-0175-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-007-0175-x