Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (Q1408381)
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 1981509
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets |
scientific article; zbMATH DE number 1981509 |
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
0 references
0 references
0.8959572315216064
0 references
0.8194622993469238
0 references
0.804893434047699
0 references
