Computing prime implicates by pruning the search space and accelerating subsumption
From MaRDI portal
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)- Algorithms for selective enumeration of prime implicants
- An SE-tree-based prime implicant generation algorithm
- A rewriting strategy to generate prime implicates in equational logic
- Identifying prime implicate branches in reduced implicate tries
- Prime implicate tries
- scientific article; zbMATH DE number 3922536 (Why is no real title available?)
- scientific article; zbMATH DE number 3570346 (Why is no real title available?)
- scientific article; zbMATH DE number 856969 (Why is no real title available?)
- scientific article; zbMATH DE number 1390353 (Why is no real title available?)
- An incremental algorithm for computing prime implicates in modal logic
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)