<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Verdée, Peter</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A proof procedure for adaptive logics</style></title><secondary-title><style face="normal" font="default" size="100%">Logic Journal of IGPL</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><volume><style face="normal" font="default" size="100%">21</style></volume><pages><style face="normal" font="default" size="100%">743-766</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;</style></abstract></record></records></xml>