Satisfiability in many-valued sentential logic is NP-complete (Q1100196): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:40, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Satisfiability in many-valued sentential logic is NP-complete |
scientific article |
Statements
Satisfiability in many-valued sentential logic is NP-complete (English)
0 references
1987
0 references
NP-completeness
0 references
many-valued sentential logics
0 references
infinite-valued calculus of Łukasiewicz
0 references
