<?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%">Meheus, Joke</style></author><author><style face="normal" font="default" size="100%">Provijn, Dagmar</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Direct Dynamic Proofs for Classical Compatibility</style></title><secondary-title><style face="normal" font="default" size="100%">Logique et Analyse</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year></dates><number><style face="normal" font="default" size="100%">185–188</style></number><volume><style face="normal" font="default" size="100%">47</style></volume><pages><style face="normal" font="default" size="100%">305–317</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 paper, we present a goal-directed proof procedure for abductive reasoning. This procedure will be compared with Alisedas approach based on semantic tableaux. We begin with some comments on Alisedas algorithms for computing conjunctive abductions and show that they do not entirely live up to their aims. Next we give a concise account of goal-directed proofs and we show that abductive explanations are a natural spin-off of these proofs. Finally, we show that the goal-directed procedure solves the problems we encountered in Alisedas algorithms.&lt;/p&gt;</style></abstract></record></records></xml>