An efficient algorithm to generate prime implicants
From MaRDI portal
Publication:1283201
DOI10.1023/A:1005940031099zbMATH Open0929.03018OpenAlexW1978916005MaRDI QIDQ1283201FDOQ1283201
Authors: A. K. Shiny, Arun K. Pujari 
Publication date: 12 January 2000
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1005940031099
Recommendations
- Algorithms for selective enumeration of prime implicants
- scientific article; zbMATH DE number 3894978
- Computation of prime implicants using matrix and paths
- Enumerating prime implicants of propositional formulae in conjunctive normal form
- Polynomial-time algorithms for generation of prime implicants
Cited In (16)
- Algorithms for selective enumeration of prime implicants
- An SE-tree-based prime implicant generation algorithm
- Title not available (Why is that?)
- A rewriting strategy to generate prime implicates in equational logic
- Computing prime implicates by pruning the search space and accelerating subsumption
- Title not available (Why is that?)
- Polynomial-time algorithms for generation of prime implicants
- An incremental algorithm for computing prime implicates in modal logic
- A Numerical Procedure for Determination of the Prime Implicants of a Boolean Function
- Prime implicate generation in equational logic
- An incremental method for generating prime implicants/implicates
- Enumerating prime implicants of propositional formulae in conjunctive normal form
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quantifier-free equational logic and prime implicate generation
This page was built for publication: An efficient algorithm to generate prime implicants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1283201)
