Cook's NP-completeness theorem is extended to all many-valued sentential logics, including the infinite-valued calculus of Łukasiewicz.
Satisfiability in many-valued sentential logic is NP-complete / D. MUNDICI. - In: THEORETICAL COMPUTER SCIENCE. - ISSN 0304-3975. - STAMPA. - 52:(1987), pp. 145-153. [10.1016/0304-3975(87)90083-1]
Satisfiability in many-valued sentential logic is NP-complete
MUNDICI, DANIELE
1987
Abstract
Cook's NP-completeness theorem is extended to all many-valued sentential logics, including the infinite-valued calculus of Łukasiewicz.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in FLORE sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
