An improved incremental algorithm for generating prime implicates
From MaRDI portal
Recommendations
- Computing prime implicates by pruning the search space and accelerating subsumption
- scientific article; zbMATH DE number 517005
- An efficient algorithm to generate prime implicants
- An incremental algorithm for computing prime implicates in modal logic
- Computing prime implicants via transversal clauses
Cited in
(14)- A corrigendum for the optimized-IPIA
- Automated reasoning and exhaustive search: Quasigroup existence problems
- Algorithms for selective enumeration of prime implicants
- A generic framework for implicate generation modulo theories
- An SE-tree-based prime implicant generation algorithm
- Computing prime implicates by pruning the search space and accelerating subsumption
- A rewriting strategy to generate prime implicates in equational logic
- Quantifier-free equational logic and prime implicate generation
- Prime implicate tries
- scientific article; zbMATH DE number 3570346 (Why is no real title available?)
- Prime implicate generation in equational logic
- scientific article; zbMATH DE number 856969 (Why is no real title available?)
- An incremental algorithm for computing prime implicates in modal logic
- An incremental method for generating prime implicants/implicates
This page was built for publication: An improved incremental algorithm for generating prime implicates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4934645)
