Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (Q1408381): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:30, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets |
scientific article |
Statements
Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (English)
0 references
15 September 2003
0 references
Autarky
0 references
Propositional satisfiability problem
0 references
Conjunctive normal form
0 references
Lean clause-set
0 references
Resolution
0 references
Linear autarky
0 references
Linear programming
0 references
Qualitative matrix analysis
0 references
Deficiency
0 references
Matching theory
0 references
Polynomial time
0 references
