An efficient algorithm to generate prime implicants (Q1283201)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An efficient algorithm to generate prime implicants |
scientific article; zbMATH DE number 1275083
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An efficient algorithm to generate prime implicants |
scientific article; zbMATH DE number 1275083 |
Statements
An efficient algorithm to generate prime implicants (English)
0 references
12 January 2000
0 references
Based on the property that the prime implicant of a formula in conjunctive normal form in propositional logic is the concatenation of the prime implicants of two of its formulae, the authors give an efficient recursive algorithm to generate prime implicants. Several experimental results are also presented.
0 references
prime implicant
0 references
hypothetical reasoning
0 references
prime paths
0 references
knowledge compilation
0 references
recursive algorithm
0 references
0.839798092842102
0 references
0.821610152721405
0 references
0.8190032839775085
0 references
0.8147774934768677
0 references
