A subclass of Horn CNFs optimally compressible in polynomial time (Q693287): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: DBLP publication ID (P1635): journals/amai/BorosCKK09, #quickstatements; #temporary_batch_1731530891435 |
||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/amai/BorosCKK09 / rank | |||
Normal rank | |||
Latest revision as of 21:54, 13 November 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
0 references
0 references
