CNF and DNF considered harmful for computing prime implicants/implicates

DOI10.1023/A:1005721905269zbMATH Open0881.68107OpenAlexW1526521033MaRDI QIDQ1367074FDOQ1367074

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

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

zbMATH Keywords

prime implicatesprime implicants

Mathematics Subject Classification ID

Cited In (12)

• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Abductive network action inference for targeted therapy discovery
• Efficient query processing with reduced implicate tries
• Title not available (Why is that?)
• Prime forms and minimal change in propositional belief bases
• Minimal implicant and DNF representation
• 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)