Axiomatic proof/refutation systems for the paraconsistent modal logics: KN4 and KN4.D are presented. The completeness proofs boil down to showing that every sequent is either provable or refutable. By constructing finite tree-type countermodels from refutations, the refined characterizations of these logics by classes of finite tree-type frames are established. The axiom systems also provide decision procedures for these logics.