An Overview of Recent Developments in Big Boolean Equations

02/17/2023
by   Ali Muhammad Ali Rushdi, et al.
0

Methods of solving big Boolean equations can be broadly classified as algebraic, tabular, numerical and map methods. The most prominent among these classes are the algebraic and map methods. This paper surveys and compares these two types of methods as regards simplicity, efficiency, and usability. The paper identifies the main types of solutions of Boolean equations as subsumptive general solutions, parametric general solutions and particular solutions. In a subsumptive general solution, each of the variables is expressed as an interval based on successive conjunctive or disjunctive eliminants of the original function. In a parametric general solution each of the variables is expressed via arbitrary parameters which are freely chosen elements of the underlying Boolean algebra. A particular solution is an assignment from the underlying Boolean algebra to every pertinent variable that makes the Boolean equation an identity. The paper offers a tutorial exposition, review, and comparison of the three types of solutions by way of an illustrative example. This example is also viewed from the perspective of a recently developed technique that relies on atomic decomposition. Map techniques are demonstrated to be at least competitive with (and occasionally superior to) algebraic techniques, since they have a better control on the minimality of the pertinent function representations, and hence are more capable of producing more compact solutions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/07/2021

Palindromic linearization and numerical solution of nonsymmetric algebraic T-Riccati equations

We identify a relationship between the solutions of a nonsymmetric algeb...
research
05/19/2019

About a 'concrete' Rauszer Boolean algebra generated by a preorder

Inspired by the fundamental results obtained by P. Halmos and A. Monteir...
research
12/18/2017

Quantum Algorithms for Boolean Equation Solving and Quantum Algebraic Attack on Cryptosystems

Decision of whether a Boolean equation system has a solution is an NPC p...
research
01/31/2018

An efficient algorithm for global interval solution of nonlinear algebraic equations and its GPGPU implementation

Solving nonlinear algebraic equations is a classic mathematics problem, ...
research
06/26/2017

The Boolean Solution Problem from the Perspective of Predicate Logic - Extended Version

Finding solution values for unknowns in Boolean equations was a principa...
research
09/29/2011

Extension of Boolean algebra by a Bayesian operator; application to the definition of a Deterministic Bayesian Logic

This work contributes to the domains of Boolean algebra and of Bayesian ...
research
02/18/2023

Switching-Algebraic Calculation of Banzhaf Voting Indices

This paper employs switching-algebraic techniques for the calculation of...

Please sign up or login with your details

Forgot password? Click here to reset