Skip to content
Research Article Open access CC BY 4.0

A Novel Method for Compact Listing of All Particular Solutions of a System of Boolean Equations

Ali Muhammad Ali Rushdi, Waleed Ahmad

Journal of Advances in Mathematics and Computer Science · pp. 1–18 · Published 15 Jun 2017

10.9734/BJMCS/2017/33884

Abstract

Any system of ‘big’ Boolean equations can be reduced to a single Boolean equation {g(Z) = 1} . We propose a novel method for producing a general parametric solution for such a Boolean equation without attempting to minimize the number of parameters used, but instead using independent parameters belonging to the two-valued Boolean algebra B2 for each asserted atom that appears in the discriminants of the functiong(Z). We sacrifice minimality of parameters and algebraic expressions for ease, compactness and efficiency in listing all particular solutions. These solutions are given by additive formulas expressing a weighted sum of the asserted atoms of g(Z), with the weight of every atom (called its contribution) having a number of alternative possible values equal to the number of appearances of the atom in the discriminants of g(Z) . This allows listing a huge number of particular solutions within a very small space and the possibility of constructing solutions of desirable features. The new method is demonstrated via three examples over the ‘big’ Boolean algebras,B4,B16, and B256, respectively. The examples demonstrate a variety of pertinent issues such as complementation, algebra collapse, incremental solution, and handling of equations separately or jointly.

‘Big’ Boolean algebras Boolean-equation solving parametric solutions particular solutions contributions of atoms Karnaugh-map like structures

References (20)

  1. 1 "International Journal of Computer Mathematics" [DOI]
  2. 2 Boolean functions and equations
  3. 3 Boolean Reasoning: The Logic of Boolean Equations
  4. 4 Lattice Functions and Equations [DOI]
  5. 5 Boolean reasoning: The logic of Boolean equations [DOI]
  6. 6 Using variable-entered Karnaugh maps to produce compact parametric general solutions of Boolean equations [DOI]
  7. 7 Using variable-entered karnaugh maps to solve boolean equations [DOI]
  8. 8 A Boolean minimization procedure using the variable-entered Karnaugh map and the generalized consensus concept [DOI]
  9. 9 Efficient Solution of Boolean Equations Using Variable-Entered Karnaugh Maps
  10. 10 Further Improved Variable-Entered Karnaugh Map Procedures for Obtaining the Irredundant Forms of an Incompletely-Specified Switching Function [DOI]
  11. 11 Parametric solutions of Boolean equations [DOI]
  12. 12 Prominent classes of the most general subsumptive solutions of Boolean equations [DOI]
  13. 13 Reduced Solutions of Boolean Equations [DOI]
  14. 14 Using Karnaugh maps to solve Boolean equations by successive elimination [DOI]
  15. 15 Algebraic Methods Versus Map Methods Of Solving Boolean Equations [DOI]
  16. 16 Boolean equations with many unknowns [DOI]
  17. 17 Solution of equations in Boolean algebra [DOI]
  18. 18 Some remarks on number of parameters of the solutions of Boolean equations [DOI]
  19. 19 Segmental solutions of Boolean equations [DOI]
  20. 20 On systems of Boolean equations [DOI]

Cited by 11

A Tutorial Exposition of Various Methods for Analyzing Capacitated Networks

Ali Muhammad Ali Rushdi, Omar Mutab Alsalami · Journal of Advances in Mathematics and Computer Science · 2020

The Eigenvectors of the Transition Matrix as Predictors of the Dynamics of a Synchronous Boolean Network

Ali Muhammad Ali Rushdi, Adnan Ahmad Alsogati · Journal of Advances in Mathematics and Computer Science · 2020

Solution of Boolean equations via atomic decomposition into independent switching equations

Ahmed Said Balamesh, Ali Muhammad Rushdi · International Journal of Computer Mathematics: Computer Systems Theory · 2019

Digital Circuit Design Utilizing Equation Solving over ‘Big’ Boolean Algebras

Ali Muhammad Ali Rushdi, Waleed Ahmad · International Journal of Mathematical, Engineering and Management Sciences · 2018

Showing 4 of 11 known citations — external sources report more than can currently be individually listed.

Article metrics

Real usage data collected on this platform.

11

Page views

0

PDF downloads

7

Outbound clicks

11

Citations

Views over time

Views by country

Approximate, from request IP at view time — not citizenship or institution. Countries with fewer than 5 views are grouped as "Other".

Traffic sources

Referring site, by host.

Views and downloads exclude known bots/crawlers. Citations combines this platform's own DOI-resolved index with each external source's own reported total — see Cited by above for individually listed citing works. Last refreshed 0 seconds ago.