Satisfiability in many-valued sentential logic is NP-complete (Q1100196): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(87)90083-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2087171264 / rank | |||
Normal rank | |||
Revision as of 21:04, 19 March 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
