A subclass of Horn CNFs optimally compressible in polynomial time (Q693287): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:35, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A subclass of Horn CNFs optimally compressible in polynomial time |
scientific article |
Statements
A subclass of Horn CNFs optimally compressible in polynomial time (English)
0 references
7 December 2012
0 references
propositional Horn expert systems
0 references
Horn functions
0 references
Horn minimization
0 references
Boolean minimization
0 references
CQ functions
0 references
essential sets
0 references
exclusive sets
0 references
polynomial-time HM algorithm
0 references
