EUVIMEDEUVIMED entdecken
Crossref

Novel Boolean logic manipulation : A symbolic computation and camouflaged graph construction

Gete Umbrey, Bhaba Kumar Sarma, Bhuban Chandra Deuri, Alfonso Bustamante, Botem Moyong

Journal of Information & Optimization Sciences · 2026 · 47 (4) · 1567-1589

DOI: 10.47974/jios-2220 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Information & Optimization Sciences, 2026. Verfasst von Gete Umbrey und 4 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This article introduces a systematic, symbolic, and pure algebraic technique called the “Extraction and Combination Method” for minimizing Boolean expressions. This method simplifies Boolean expressions through a sequence of algebraic manipulations that methodically extract factors and combine terms to reduce the complexity of redundant literal terms and operations. The algorithmic process involves the breakdown of the complex Boolean expression into distinct components, applying the natural and fundamental laws of Boolean algebra. Systematic ordering and generalization of Boolean operations/subexpressions ensure that we can invariably reach termination and achieve a unique minimized form for any given Boolean expression. The set of processes of decomposition of the expression into subexpressions, parallel minimization, and recombination is repeated iteratively until we get an optimized form. The minimization process avoids exhaustive truth table generation. We proposed to seamlessly transform the algebraic form used in our framework into a Boolean graph-a simple undirected graph in the graph-theoretic sense that allows Boolean expressions to be studied and manipulated through graph operations such as union and intersection, and establishes a natural bridge between algebraic logic and classical graph theory. The method enables tautology detection, construction of Boolean graph and camouflaged graph, identification and removal of auxiliary vertices and auxiliary subgraphs, and derivation of simplified Boolean graphs representing minimal expressions.

Zitieren

APA

Umbrey, G., Sarma, B. K., Deuri, B. C., Bustamante, A., & Moyong, B. (2026). Novel Boolean logic manipulation : A symbolic computation and camouflaged graph construction. Journal of Information & Optimization Sciences, 47(4), 1567-1589. https://doi.org/10.47974/jios-2220

Vancouver

Umbrey G, Sarma BK, Deuri BC, Bustamante A, Moyong B. Novel Boolean logic manipulation : A symbolic computation and camouflaged graph construction. Journal of Information & Optimization Sciences. 2026;47(4):1567-1589. doi:10.47974/jios-2220

BibTeX
@article{Umbrey2026,
  author = {Umbrey, Gete and Sarma, Bhaba Kumar and Deuri, Bhuban Chandra and Bustamante, Alfonso and Moyong, Botem},
  title = {Novel Boolean logic manipulation : A symbolic computation and camouflaged graph construction},
  journal = {Journal of Information & Optimization Sciences},
  year = {2026},
  volume = {47},
  number = {4},
  pages = {1567--1589},
  doi = {10.47974/jios-2220}
}
Kostenlos starten →