An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF (Q1277336)
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 for the minimal unsatisfiability problem for a subclass of CNF |
scientific article; zbMATH DE number 1248228
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF |
scientific article; zbMATH DE number 1248228 |
Statements
An efficient algorithm for the minimal unsatisfiability problem for a subclass of CNF (English)
0 references
7 June 1999
0 references
unsatisfiability problem
0 references
