An efficient algorithm to generate prime implicants

DOI10.1023/A:1005940031099MaRDI QIDQ1283201zbMATHOpenAlexFDO

Authors A. K. Shiny, Arun K. Pujari

Publication date 12 January 2000

Published in Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1005940031099

zbMATH Keywords

recursive algorithmknowledge compilationhypothetical reasoningprime implicantprime paths

Mathematics Subject Classification ID

Classical propositional logic (03B05) Mechanization of proofs and logical operations (03B35)

Recommendations

• Algorithms for selective enumeration of prime implicants
• scientific article; zbMATH DE number 3894978
• Computation of prime implicants using matrix and paths
• Enumerating prime implicants of propositional formulae in conjunctive normal form
• Polynomial-time algorithms for generation of prime implicants

Cited in

(16)

• scientific article; zbMATH DE number 1390353 (Why is no real title available?)
• Algorithms for selective enumeration of prime implicants
• scientific article; zbMATH DE number 856969 (Why is no real title available?)
• An incremental method for generating prime implicants/implicates
• scientific article; zbMATH DE number 3570346 (Why is no real title available?)
• scientific article; zbMATH DE number 3894978 (Why is no real title available?)
• Quantifier-free equational logic and prime implicate generation
• Polynomial-time algorithms for generation of prime implicants
• scientific article; zbMATH DE number 3922536 (Why is no real title available?)
• An incremental algorithm for computing prime implicates in modal logic
• A rewriting strategy to generate prime implicates in equational logic
• An SE-tree-based prime implicant generation algorithm
• A Numerical Procedure for Determination of the Prime Implicants of a Boolean Function
• Computing prime implicates by pruning the search space and accelerating subsumption
• Enumerating prime implicants of propositional formulae in conjunctive normal form
• Prime implicate generation in equational logic

This page was built for publication: An efficient algorithm to generate prime implicants

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