<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Vermeir, Timothy</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Carnielli, Walter A.</style></author><author><style face="normal" font="default" size="100%">Coniglio, Marcelo E.</style></author><author><style face="normal" font="default" size="100%">Loffredo D'Ottaviano, Itala M.</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">An Inconsistency-Adaptive Proof Procedure for Logic Programming</style></title><secondary-title><style face="normal" font="default" size="100%">Paraconsistency. The Logical Way to the Inconsistent</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2002</style></year></dates><publisher><style face="normal" font="default" size="100%">Marcel Dekker</style></publisher><pub-location><style face="normal" font="default" size="100%">New York</style></pub-location><pages><style face="normal" font="default" size="100%">323-340</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;It is the goal of this paper to de ne a paraconsistent proof procedure that has the best of two mechanisms, in casu logic programming and inconsistency-adaptive logics. From logic programming we will maintain the ease of computing, and from adaptive logics their paraconsistency, dynamics and non-monotonicity. This will be done by combining the notion of competitor from logic programming together with the conditionallity that is common in all adaptive proofs.&lt;/p&gt;</style></abstract></record></records></xml>