<?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%">Provijn, Dagmar</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Pushing the Search Paths in the Proofs. A Study in Proof Heuristics</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%">2001</style></year></dates><number><style face="normal" font="default" size="100%">173-175</style></number><volume><style face="normal" font="default" size="100%">44</style></volume><pages><style face="normal" font="default" size="100%">113–134</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Introducing techniques deriving from dynamic proofs in proofs for propositional classical logic is shown to lead to a proof format that enables one to push search paths into the proofs themselves. The resulting goal directed proof format is shown to provide a decision method for &lt;em&gt;A&lt;/em&gt;&lt;sub&gt;1&lt;/sub&gt;, ..., &lt;em&gt;A&lt;sub&gt;n&lt;/sub&gt;&lt;/em&gt; &lt;img src=&quot;vdash.gif&quot; alt=&quot;vdash&quot; /&gt; &lt;em&gt;B&lt;/em&gt; and a positive test for &lt;img src=&quot;ggamma.gif&quot; alt=&quot;Gamma&quot; /&gt; &lt;img src=&quot;vdash.gif&quot; alt=&quot;vdash&quot; /&gt; &lt;em&gt;A&lt;/em&gt;.&lt;/p&gt;</style></abstract></record></records></xml>