<?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%">Batens, Diderik</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Magnani, Lorenzo</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A Diagrammatic Proof Search Procedure as Part of a Formal Approach to Problem Solving</style></title><secondary-title><style face="normal" font="default" size="100%">Model Based Reasoning in Science and Engineering. Cognitive Science, Epistemology, Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2006</style></year></dates><publisher><style face="normal" font="default" size="100%">King's College Publications</style></publisher><pages><style face="normal" font="default" size="100%">265–284</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 aims at describing a goal-directed and diagrammatic method for proof search. The method (and one of the logics obtained by it) is particularly interesting in the context of formal problem solving. A typical property is that it consists of attempts to justify so-called bottom boxes by means of premise elements (diagrammatic elements obtained from premises) and logical elements. Premises are not preprocessed, whence most premises lead to a variety of premise elements.&lt;/p&gt;</style></abstract></record></records></xml>