A Novel Method for Compact Listing of All Particular Solutions of a System of Boolean Equations
Journal Title: Journal of Advances in Mathematics and Computer Science - Year 2017, Vol 22, Issue 6
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, B_4, B_16, and B_256, respectively. The examples demonstrate a variety of pertinent issues such as complementation, algebra collapse, incremental solution, and handling of equations separately or jointly.
Authors and Affiliations
Ali Muhammad Ali Rushdi, Waleed Ahmad
Keywords
Related Articles
- EP ID EP322631
- DOI 10.9734/BJMCS/2017/33884
- Views 87
- Downloads 0
Geodesically Complete Lie Algebroid
In this paper we introduce the notion of geodesically complete Lie algebroid. We give a Riemannian distance on the connected base manifold of a Riemannian Lie algebroid. We also prove that the distance is equivalent to n...
Modelling Grammaticality-grading in Natural Language Systems Using a Vector Space Approach
There exist several natural language processing systems that focus on checking the grammaticality (grammatical correctness or incorrectness) of natural language texts. Studies however showed that most existing systems do...
Computation of k-out-of-n System Reliability via Reduced Ordered Binary Decision Diagrams
A prominent reliability model is that of the partially-redundant (k-out-of-n) system. We use algebraic as well as signal-flow-graph methods to explore and expose the AR algorithm for computing k-out-of-n reliability. We...
General Version of Gauss-type Proximal Point Method and Its Uniform Convergence Analysis for Metrically Regular Mappings
We study the uniform convergence of the general version of Gauss-type proximal point algorithm (GG-PPA), introduced by Alom et al. [1], for solving the parametric generalized equations y ∈ T(x), where T : X 2Y is a set...
Finite Time Blow-up, Extinction and Non-extinction of Solutions for an Evolutionary Problem
In this paper we consider a class of p-biharmonic parabolic equation with nonlocal nonlinearities and Neumann boundary condition. By constructing suitable auxiliary functions and using differential inequalities, we give...