On good algorithms for determining unsatisfiability of propositional formulas (Q1408376): 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 | On good algorithms for determining unsatisfiability of propositional formulas |
scientific article |
Statements
On good algorithms for determining unsatisfiability of propositional formulas (English)
0 references
15 September 2003
0 references
Satisfiability
0 references
Resolution
0 references
Theorem proving
0 references
Hitting set
0 references
