On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
Logic for Artificial Intelligence
Logic for Artificial Intelligence
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The circuit value problem is log space complete for P
ACM SIGACT News
Classical and Nonclassical Logics: An Introduction to the Mathematics of Propositions
Classical and Nonclassical Logics: An Introduction to the Mathematics of Propositions
Function Algebras on Finite Sets: Basic Course on Many-Valued Logic and Clone Theory (Springer Monographs in Mathematics)
Normal forms and free algebras for some extensions of MTL
Fuzzy Sets and Systems
The complexity of propositional implication
Information Processing Letters
Information Processing Letters
Generalized modal satisfiability
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
In 1979, H. Lewis shows that the computational complexity of the Boolean satisfiability problem dichotomizes, depending on the Boolean operations available to formulate instances: intractable (NP-complete) if negation of implication is definable, and tractable (in P) otherwise [21]. Recently, an investigation in the same spirit has been extended to nonclassical propositional logics, modal logics in particular [2, 3]. In this note, we pursue this line in the realm of many-valued propositional logics, and obtain complexity classifications for the parameterized satisfiability problem of two pertinent samples, Kleene and Gödel logics.