Algorithms for selective enumeration of prime implicants
From MaRDI portal
Publication:1606302
DOI10.1016/S0004-3702(99)00035-1zbMATH Open0996.68181OpenAlexW2012022843MaRDI QIDQ1606302FDOQ1606302
Authors: Luigi Palopoli, Fiora Pirri, Clara Pizzuti 
Publication date: 24 July 2002
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0004-3702(99)00035-1
Recommendations
- An efficient algorithm to generate prime implicants
- Polynomial-time algorithms for generation of prime implicants
- scientific article; zbMATH DE number 3570346
- Computing prime implicates by pruning the search space and accelerating subsumption
- scientific article; zbMATH DE number 1390353
- An incremental method for generating prime implicants/implicates
- An SE-tree-based prime implicant generation algorithm
- scientific article; zbMATH DE number 3894978
- scientific article; zbMATH DE number 3922536
- Computation of prime implicants using matrix and paths
Cited In (12)
- An SE-tree-based prime implicant generation algorithm
- Title not available (Why is that?)
- Computing prime implicates by pruning the search space and accelerating subsumption
- On prime scenarios in qualitative spatial and temporal reasoning
- Polynomial-time algorithms for generation of prime implicants
- Fuzzy relational equations with min-biimplication composition
- A Numerical Procedure for Determination of the Prime Implicants of a Boolean Function
- Enumerating prime implicants of propositional formulae in conjunctive normal form
- Title not available (Why is that?)
- Title not available (Why is that?)
- SAT-Based Horn Least Upper Bounds
- Preferences and explanations
This page was built for publication: Algorithms for selective enumeration of prime implicants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1606302)
