<?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%">Batens, Diderik</style></author><author><style face="normal" font="default" size="100%">Meheus, Joke</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Shortcuts and Dynamic Marking in the Tableau Method for Adaptive logics</style></title><secondary-title><style face="normal" font="default" size="100%">Studia Logica</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2001</style></year></dates><volume><style face="normal" font="default" size="100%">69</style></volume><pages><style face="normal" font="default" size="100%">221–248</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Adaptive logics typically pertain to reasoning procedures for which there is no positive test. In \cite{DJ:tabl1}, we presented a tableau method for two inconsistency-adaptive logics. In the present paper, we first describe these methods (without repeating the meta-theoretic proofs). Next, we present several ways to increase the efficiency of the methods. This culminates in a dynamic marking procedure that indicates which branches have to be extended first, and thus guides one towards a decision–-the conclusion follows or does not follow–-in a very economical way.&lt;/p&gt;</style></abstract></record></records></xml>