<?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></authors></contributors><titles><title><style face="normal" font="default" size="100%">Some Computational Aspects of Inconsistency-Adaptive logics</style></title><secondary-title><style face="normal" font="default" size="100%">CLE e-Prints</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year></dates><number><style face="normal" font="default" size="100%">7</style></number><volume><style face="normal" font="default" size="100%">2</style></volume><pages><style face="normal" font="default" size="100%">15 pp.</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;This paper concerns a goal directed proof procedure for the propo- sitional fragment of the adaptive logic ACLuN1. The procedure forms an algorithm for final derivability and may easily be generalized for the propositional fragment of all at adaptive logics. The aim is to articulate a procedure that, if extended to the predicative level, provides criteria for final derivability.&lt;/p&gt;</style></abstract></record></records></xml>