In this paper, the complexity of several paraconsistent inference relations, based on multivalued logics, is investigated. Many inference relations pointed out so far by Arieli and Avron, Besnard and Schaub, D’Ottaviano and da Costa, Frisch, Levesque, Priest are considered from the computational side. All these relations can be gathered into two categories: the basic ones stem directly from the...