Optimal compression of propositional Horn knowledge bases: Complexity and approximation (Q1313951)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 500712
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimal compression of propositional Horn knowledge bases: Complexity and approximation |
scientific article; zbMATH DE number 500712 |
Statements
Optimal compression of propositional Horn knowledge bases: Complexity and approximation (English)
0 references
24 April 2000
0 references
optimal compression
0 references
propositional Horn production rule
0 references
knowledge bases
0 references
NP-completeness
0 references
Boolean function
0 references
0.8675264716148376
0 references
0.8565203547477722
0 references
0.8285601735115051
0 references
0.8169314861297607
0 references
0.7892016172409058
0 references
