Computation of prime implicants using matrix and paths

DOI10.1093/LOGCOM/8.2.135MaRDI QIDQ4399714zbMATH OpenOpenAlexFDO

Authors A. K. Shiny, Arun K. Pujari

Publication date 28 July 1998

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/a59dfb6ead7c80eeb899b381cee1313cfa18767f

zbMATH Keywords

conjunctive normal formknowledge base

Mathematics Subject Classification ID

Classical propositional logic (03B05) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35)

Recommendations

• Computing prime implicants via transversal clauses
• An efficient algorithm to generate prime implicants
• scientific article; zbMATH DE number 517005
• CNF and DNF considered harmful for computing prime implicants/implicates

Cited in

(10)

• An efficient algorithm to generate prime implicants
• Algorithms for selective enumeration of prime implicants
• Theory and implementation of coalitional analysis in cooperative decision making
• scientific article; zbMATH DE number 3570346 (Why is no real title available?)
• scientific article; zbMATH DE number 517005 (Why is no real title available?)
• Prime implicants of first order formulas via transversal clauses
• An incremental algorithm for computing prime implicates in modal logic
• A Numerical Procedure for Determination of the Prime Implicants of a Boolean Function
• A matrix-based approach to searching colored paths in a weighted colored multidigraph
• An incremental method for generating prime implicants/implicates

This page was built for publication: Computation of prime implicants using matrix and paths

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