3-SAT = SAT for a class of normal modal logics (Q673009): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(95)00060-p / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2028506047 / rank | |||
Normal rank | |||
Latest revision as of 10:57, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 3-SAT = SAT for a class of normal modal logics |
scientific article |
Statements
3-SAT = SAT for a class of normal modal logics (English)
0 references
28 February 1997
0 references
Automatic theorem proving
0 references
Computational complexity
0 references
Normal modal logics
0 references
Modal clauses
0 references
0 references
