Prominent classes of the most general subsumptive solutions of Boolean equations

DOI10.1016/j.ins.2014.04.057zbMath1360.06007OpenAlexW1994207070MaRDI QIDQ507645

Ali Muhammad Ali Rushdi, Hussain Mobarak Albarakati

Publication date: 7 February 2017

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2014.04.057

zbMATH Keywords

complete sumBoolean equationsubsumptive general solutiondon't care classeliminantRudeanu class

Mathematics Subject Classification ID

Boolean functions (06E30)

Uses Software

• JBool

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subsumptive general solutions and parametric general solutions of Post equations
• Consensus algorithms for the generation of all maximal bicliques
• Rough sets and Boolean reasoning
• Boolean sets and most general solutions of Boolean equations
• Improved variable-entered Karnaugh map procedures
• A characterization of Boolean collections of set-valued functions
• Unique solutions of Boolean ring equations
• Boolean equations with many unknowns
• Solution of equations in Boolean algebra
• Boolean differential equations
• On quadratic Boolean equations
• Solution of Boolean equations
• Parametric solutions of Boolean equations
• Using variable-entered karnaugh maps to solve boolean equations
• Using variable-entered Karnaugh maps to produce compact parametric general solutions of Boolean equations
• A Way to Simplify Truth Functions
• Boolean transformations with unique fixed points
• Generation of Prime Implicants from Subfunctions and a Unifying Approach to the Covering Problem
• Meet and Join Derivatives and Their Use in Switching Theory
• Algebraic Methods Versus Map Methods Of Solving Boolean Equations
• A Method for Generating Prime Implicants of a Boolean Expression
• A Recursive Paradigm to Solve Boolean Relations
• On systems of Boolean equations
• A Machine-Oriented Logic Based on the Resolution Principle
• RST Flip-Flop Input Equations
• A New Algorithm for Generating Prime Implicants
• On Cores and Prime Implicants of Truth Functions
• A Computing Procedure for Quantification Theory
• Association Reducts: Boolean Representation
• The Problem of Simplifying Truth Functions

This page was built for publication: Prominent classes of the most general subsumptive solutions of Boolean equations