A New Algorithm for Generating Prime Implicants
From MaRDI portal
Publication:5594188
DOI10.1109/T-C.1970.222917zbMath0197.14601OpenAlexW2031784867MaRDI QIDQ5594188
No author found.
Publication date: 1970
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/t-c.1970.222917
Related Items
Boolean algebra admits no convergent term rewriting system, Efficient query processing with reduced implicate tries, An SE-tree-based prime implicant generation algorithm, An incremental method for generating prime implicants/implicates, Une approche intentionnelle du calcul des implicants premiers et essentiels des fonctions booléennes, Computational aspects of monotone dualization: a brief survey, Polynomial-time algorithms for generation of prime implicants, Prominent classes of the most general subsumptive solutions of Boolean equations, Characterizing diagnoses and systems, A continuous approach to inductive inference, A flexible formal framework for masking/demasking faults, An algorithm to generate prime implicants and its application to the selection problem, Optimizing the clausal normal form transformation, Computing prime implicants via transversal clauses
