Skip to main content
SpringerLink
Log in

A mathematical approach to the boolean minimization problem

  • Published:
Quality & Quantity Aims and scope Submit manuscript

Abstract

Any minimization problem involves a computer algorithm. Many such algorithms have been developed for the boolean minimizations, in diverse areas from computer science to social sciences (with the famous QCA algorithm). For a small number of entries (causal conditions in the QCA) any such algorithm will find a minimal solution, especially with the aid of the modern computers. However, for a large number of conditions a quick and complete solution is not easy to find using an algorithmic approach, due to the extremely large space of possible combinations to search in. In this article I will demonstrate a simple alternative solution, a mathematical method to obtain all possible minimized prime implicants. This method is not only easier to understand than other complex algorithms, but it proves to be a faster method to obtain an exact and complete boolean solution.

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

Access this article

Log in via an institution

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

  • Cronqvist, L.: Tool for small-N analysis [Version 1.255], Marburg. Retrieved from http://www.tosmana.net in January 2007

  • De Meur, G., Rihoux, B.: L’analyse Quali-Quantitative Comparee. Approche, techniques et applications en Science Humaines. Academia-Bruylant, Louvain-La-Neuve (2002)

  • Duşa A.: User manual for the QCA(GUI) package in R. J. Business Res. 60(5), 576–586 (2007)

    Article  Google Scholar 

  • Fišer P., Kubátová H.: Flexible two-level Boolean minimizer BOOM-II and its applications. IEEE Comput. Soc., Washington, DC, USA (2006)

    Google Scholar 

  • McCluskey E.J.: Minimization of Boolean functions. Bell Syst. Technical J. 5, 1417–1444 (1956)

    Google Scholar 

  • Mill J.S.: A System of Logic. Longman, Green, and Co., London (1843)

    Google Scholar 

  • Quine W.O.: The problem of simplifying truth functions. Bell Syst. Technical J. 5, 521–531 (1952)

    Google Scholar 

  • Quine W.O.: A way to simplify truth functions. Bell Syst. Technical J. 62, 627–631 (1955)

    Google Scholar 

  • R Development Core Team: R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria (2007)

  • Ragin C.C.: The Comparative Method. Moving Beyond Qualitative and Quantitative Strategies. University Of California Press, Berkeley (1987)

    Google Scholar 

  • Ragin, C.C.: Fuzzy Set Social Science. The University of Chicago Press (2000)

  • Ragin, C.C.: User’s Guide to Fuzzy-Set/Qualitative Comparative Analysis 2.0. Department of Sociology, University of Arizona, Tucson, Arizona (2006)

  • Shannon, C.E.: A Symbolic Analysis of Relay and Switching Sircuits. Massachusetts Institute of Technology, Department of Electrical Engineering. Retrieved from http://theses.mit.edu in October 2005

Download references

Author information

Authors and Affiliations

  1. Faculty of Sociology and Social Work, University of Bucharest, 1, Schitu Mǎgureanu Road, 050025, Bucharest, Romania

    Adrian Duşa

Authors
  1. Adrian Duşa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Adrian Duşa.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Duşa, A. A mathematical approach to the boolean minimization problem. Qual Quant 44, 99–113 (2010). https://doi.org/10.1007/s11135-008-9183-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11135-008-9183-x

Keywords

Search

Navigation