Two tractable subclasses of minimal unsatisfiable formulas (Q1961649)
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 1394423
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two tractable subclasses of minimal unsatisfiable formulas |
scientific article; zbMATH DE number 1394423 |
Statements
Two tractable subclasses of minimal unsatisfiable formulas (English)
0 references
28 February 2000
0 references
simplification procedure
0 references
satisfiability test
0 references
splitting
0 references
collapsing
0 references
conjunctive normal form
0 references
minimal unsatisfiability
0 references
polynomial time
0 references
0.9279807209968568
0 references
0.8821582794189453
0 references
0.8734959363937378
0 references
0.8451614379882812
0 references
