CNF and DNF considered harmful for computing prime implicants/implicates

DOI10.1023/A:1005721905269MaRDI QIDQ1367074zbMATH OpenOpenAlexFDO

Authors Anavai Ramesh, George Becker, Neil V. Murray

Publication date 17 September 1997

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

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

zbMATH Keywords

prime implicatesprime implicants

Mathematics Subject Classification ID

Recommendations

• scientific article; zbMATH DE number 517005
• Computing prime implicants via transversal clauses
• Enumerating prime implicants of propositional formulae in conjunctive normal form
• Algorithms for selective enumeration of prime implicants

Cited in

(14)

• Belief revision with satisfaction measure
• A temporal negative normal form which preserves implicants and implicates
• Prime implicants of first order formulas via transversal clauses
• On k-Term DNF with the Largest Number of Prime Implicants
• scientific article; zbMATH DE number 517005 (Why is no real title available?)
• Abductive network action inference for targeted therapy discovery
• scientific article; zbMATH DE number 1916516 (Why is no real title available?)
• On conversions from CNF to ANF
• Efficient query processing with reduced implicate tries
• Prime forms and minimal change in propositional belief bases
• scientific article; zbMATH DE number 4099203 (Why is no real title available?)
• Minimal implicant and DNF representation
• Enumerating prime implicants of propositional formulae in conjunctive normal form
• A new class of explanations for classifiers with non-binary features

This page was built for publication: CNF and DNF considered harmful for computing prime implicants/implicates

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