Computing prime implicates by pruning the search space and accelerating subsumption
DOI10.1093/LOGCOM/EXV071zbMATH Open1380.68155OpenAlexW2587854631MaRDI QIDQ3133151FDOQ3133151
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
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
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 (8)
- Algorithms for selective enumeration of prime implicants
- Prime implicate tries
- An SE-tree-based prime implicant generation algorithm
- Title not available (Why is that?)
- Title not available (Why is that?)
- Identifying prime implicate branches in reduced implicate tries
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
