In this article, I present a procedure that generates proofs for finally derivable adaptive logic consequences. A proof procedure for the inconsistency adaptive logic CLuNr is already presented in [7]. In this article a procedure for CLuNm is presented and the results for both logics are generalized to all adaptive logics, on the presupposition that there exists a proof procedure for the lower limit logic. The generated proofs are so called goal-directed proofs, i.e. proofs that (i) start with the formula (the goal) of which one wants to know whether it is a consequence of a certain premise set and (ii) only consist of lines that may potentially be useful for proving or disproving the goal. The goal-directed proofs form good explications of actual problem-solving reasoning processes.

%B Logic Journal of IGPL %V 21 %P 743-766 %G eng %R 10.1093/jigpal/jzs046