A New Algorithm for Generating Prime Implicants

DOI10.1109/T-C.1970.222917MaRDI QIDQ5594188zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

computer science and automata

Cited in

(17)

• Polynomial-time algorithms for generation of prime implicants
• Characterizing diagnoses and systems
• A flexible formal framework for masking/demasking faults
• An SE-tree-based prime implicant generation algorithm
• An algorithm to generate prime implicants and its application to the selection problem
• Computing prime implicants via transversal clauses
• Une approche intentionnelle du calcul des implicants premiers et essentiels des fonctions booléennes
• Boolean algebra admits no convergent term rewriting system
• Prominent classes of the most general subsumptive solutions of Boolean equations
• Computing prime implicants
• A new class of explanations for classifiers with non-binary features
• Entailing generalization boosts enumeration
• A continuous approach to inductive inference
• Optimizing the clausal normal form transformation
• Efficient query processing with reduced implicate tries
• An incremental method for generating prime implicants/implicates
• Computational aspects of monotone dualization: a brief survey

This page was built for publication: A New Algorithm for Generating Prime Implicants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5594188)