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