Two tractable subclasses of minimal unsatisfiable formulas (Q1961649): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:35, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two tractable subclasses of minimal unsatisfiable formulas |
scientific article |
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
