An erotetic calculus for a given logic constitutes a sequent-style proof-theoretical formalization of the logic grounded in Inferential Erotetic Logic (\({\mathsf{IEL}}\)). In this paper, a new erotetic calculus for Classical Propositional Logic (\({\mathsf{CPL}}\)), dual with respect to the existing ones, is given. We modify the calculus to obtain complete proof systems for the propositional part of paraconsistent logic \({\mathsf{CLuN}}\) and its extensions \({\mathsf{CLuNs}}\) and \({\mathsf{mbC}}\). The method is based on dual resolution. Moreover, the resolution rule is non-clausal. According to the authors knowledge, this is the first account of resolution for \({\mathsf{mbC}}\). Last but not least, as the method is grounded in \({\mathsf{IEL}}\), it constitutes an important tool for the so-called question-processing.