On the counting complexity of propositional circumscription (Q963360)
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: On the counting complexity of propositional circumscription |
scientific article; zbMATH DE number 5694927
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the counting complexity of propositional circumscription |
scientific article; zbMATH DE number 5694927 |
Statements
On the counting complexity of propositional circumscription (English)
0 references
19 April 2010
0 references
computational complexity
0 references
counting complexity
0 references
propositional circumscription
0 references
Horn
0 references
dual Horn
0 references
bijunctive
0 references
and affine formulas
0 references
Hypergraph transversal
0 references
