Computing prime implicants via transversal clauses

DOI10.1080/00207169908804764MaRDI QIDQ4243266zbMATH OpenOpenAlexFDO

Authors Arindama Singh

Publication date 19 December 1999

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169908804764

zbMATH Keywords

transversal clauses

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Prime implicants of first order formulas via transversal clauses
• scientific article; zbMATH DE number 517005
• Prime implicate generation in equational logic
• scientific article; zbMATH DE number 1076965
• An incremental algorithm for computing prime implicates in modal logic
• Quantifying conflicts in propositional logic through prime implicates
• Enumerating prime implicants of propositional formulae in conjunctive normal form
• scientific article; zbMATH DE number 4094807
• scientific article; zbMATH DE number 3997856
• A rewriting strategy to generate prime implicates in equational logic

Cites work

• A New Algorithm for Generating Prime Implicants
• An incremental method for generating prime implicants/implicates
• On the number of prime implicants
• Optimizing the clausal normal form transformation

Cited in

(6)

• CNF and DNF considered harmful for computing prime implicants/implicates
• scientific article; zbMATH DE number 517005 (Why is no real title available?)
• Computation of prime implicants using matrix and paths
• Prime implicants of first order formulas via transversal clauses
• scientific article; zbMATH DE number 1390353 (Why is no real title available?)
• An incremental method for generating prime implicants/implicates

This page was built for publication: Computing prime implicants via transversal clauses

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