Computing prime implicates by pruning the search space and accelerating subsumption

DOI10.1093/LOGCOM/EXV071zbMATH Open1380.68155OpenAlexW2587854631MaRDI QIDQ3133151FDOQ3133151

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

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)

Cited In (6)

• Algorithms for selective enumeration of prime implicants
• An SE-tree-based prime implicant generation algorithm
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

   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 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• An incremental method for generating prime implicants/implicates 👍 👎

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)