An SE-tree-based prime implicant generation algorithm

DOI10.1007/BF01530750zbMath0861.68033OpenAlexW2014832702MaRDI QIDQ1924815

Ron Rymon

Publication date: 20 October 1996

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01530750

zbMATH Keywords

prime implicantsPI generation algorithms

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (3)

SAT-Based Horn Least Upper Bounds ⋮ On propositional definability ⋮ Computational aspects of monotone dualization: a brief survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• An incremental method for generating prime implicants/implicates
• A theory of diagnosis from first principles
• A circumscriptive theorem prover
• A correction to the algorithm in Reiter's theory of diagnosis
• A comparative study of several proof procedures
• RST Flip-Flop Input Equations
• A New Algorithm for Generating Prime Implicants
• The Problem of Simplifying Truth Functions

This page was built for publication: An SE-tree-based prime implicant generation algorithm