Computing prime implicates by pruning the search space and accelerating subsumption

DOI10.1093/LOGCOM/EXV071MaRDI QIDQ3133151zbMATHOpenAlexFDO

Authors Andrew Matusiewicz, Neil V. Murray, Paul Olsen, Erik Rosenthal

Publication date 13 February 2018

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

Full work available at URL https://doi.org/10.1093/logcom/exv071

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Data structures (68P05) Classical propositional logic (03B05) Logic in computer science (03B70)

Recommendations

• An efficient algorithm to generate prime implicants
• Algorithms for selective enumeration of prime implicants
• Polynomial-time algorithms for generation of prime implicants
• Identifying prime implicate branches in reduced implicate tries
• scientific article; zbMATH DE number 3570346
• scientific article; zbMATH DE number 4094807
• scientific article; zbMATH DE number 1390353
• scientific article; zbMATH DE number 3922536
• An incremental method for generating prime implicants/implicates

Cited in

(10)

• 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?)
• scientific article; zbMATH DE number 3570346 (Why is no real title available?)
• 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
• Prime implicate tries
• An SE-tree-based prime implicant generation algorithm
• Identifying prime implicate branches in reduced implicate tries

This page was built for publication: Computing prime implicates by pruning the search space and accelerating subsumption

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