Satisfiability in many-valued sentential logic is NP-complete (Q1100196)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Satisfiability in many-valued sentential logic is NP-complete |
scientific article; zbMATH DE number 4041894
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Satisfiability in many-valued sentential logic is NP-complete |
scientific article; zbMATH DE number 4041894 |
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
