<?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%">Meheus, Joke</style></author><author><style face="normal" font="default" size="100%">De Clercq, Kristof</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%">Goal-Directed Tableaux</style></title><secondary-title><style face="normal" font="default" size="100%">The Many Sides of Logic</style></secondary-title><tertiary-title><style face="normal" font="default" size="100%">Studies in Logic</style></tertiary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><publisher><style face="normal" font="default" size="100%">College Publications</style></publisher><pub-location><style face="normal" font="default" size="100%">London</style></pub-location><volume><style face="normal" font="default" size="100%">21</style></volume><pages><style face="normal" font="default" size="100%">241–256</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 contains a new format for analytic tableaux, called goal-directed tableaux. Their main interest lies in the fact that the search for a closed tableau proceeds in a highly constrained way. The goal-directed tableaux do not form a complete decision method for propositional classical logic (because they do not sustain Ex Falso Quodlibet). For consistent sets of premises, however, they lead to the same results as the usual analytic tableaux for classical logic.&lt;/p&gt;</style></abstract></record><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%">De Clercq, Kristof</style></author><author><style face="normal" font="default" size="100%">Verdée, Peter</style></author><author><style face="normal" font="default" size="100%">Meheus, Joke</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Yes Fellows, Most Human Reasoning is Complex</style></title><secondary-title><style face="normal" font="default" size="100%">Synthese</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2009</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/s11229-007-9268-4</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">166</style></volume><pages><style face="normal" font="default" size="100%">113–131</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 answers the philosophical contentions defended in Horsten and Welch (2007, Synthese, 158, 41-60). It contains a description of the standard format of adaptive logics, analyses the notion of dynamic proof required by those logics, discusses the means to turn such proofs into demonstrations, and argues that, notwithstanding their formal complexity, adaptive logics are important because they explicate an abundance of reasoning forms that occur frequently, both in scientific contexts and in common sense contexts.&lt;/p&gt;</style></abstract></record><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%">De Clercq, Kristof</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Logica in Communicatie. Bijdragen vanuit Vraaglogica en 'Belief Revision', Steunend op Adaptieve Logica's</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2004</style></year><pub-dates><date><style  face="normal" font="default" size="100%">September 3</style></date></pub-dates></dates><publisher><style face="normal" font="default" size="100%">Ghent University</style></publisher><work-type><style face="normal" font="default" size="100%">phd</style></work-type><custom1><style face="normal" font="default" size="100%">&lt;p&gt;Diderik Batens&lt;/p&gt;</style></custom1></record><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%">De Clercq, Kristof</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Rich Paraconsistent Extension of Full Positive Logic</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%">227–257</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 the present paper we devise and study the most natural predicative extension of Schütte's maximally paraconsistent logic. With some of its large fragments, this logic, \sys{CLuNs}, forms the most popular family of paraconsistent logics. Devising the system involves some entanglements, and the system itself raises several interesting questions. As the system and fragments were studied by other authors, we restrict our attention to results that we have not seen in press.&lt;/p&gt;</style></abstract><notes><style face="normal" font="default" size="100%">Appeared 2005</style></notes></record><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%">De Clercq, Kristof</style></author><author><style face="normal" font="default" size="100%">Verhoeven, Liza</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Sieving Out Relevant and Efficient Questions</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%">189–216</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Wisniewksis erotetic logic provides us with two slightly different semantic explications of the intuitive concept of a question arises from a set of declarative premises. Unfortunately, Wisniewskis erotetic concepts suffer from the drawback that they allow for the raising of irrelevant and inefficient questions. The aim of this paper is to show that raising such questions can be avoided by changing the underlying logic. Several closely related logical approaches which enable us to eliminate irrelevant and inefficient questions, are presented.&lt;/p&gt;</style></abstract></record><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%">Vanderbeeken, Robrecht</style></author><author><style face="normal" font="default" size="100%">De Clercq, Kristof</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Delrieux, Claudio</style></author><author><style face="normal" font="default" size="100%">Legris, Javier</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A Procedure for Generating (Conditional) Answers in a Goal-Directed Way</style></title><secondary-title><style face="normal" font="default" size="100%">Computer modeling of scientific reasoning</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year></dates><publisher><style face="normal" font="default" size="100%">Universidad Nacional Del Sur. EDIUNS</style></publisher><pub-location><style face="normal" font="default" size="100%">Bahia Blanca, Argentinia</style></pub-location><pages><style face="normal" font="default" size="100%">57–63</style></pages><isbn><style face="normal" font="default" size="100%">9879281896</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Two evolutionary games : collective action and prisoner's dilema / Jakson Alves de Aquino – A formal approach to problem solving / Diderik Batens – Application of mathematics and underdetermination / Ota\unmatched{0301}vio Bueno – A framework for combining defeasible argumentation with labeled deduction / Carlos Iva\unmatched{0301}n Chesn\unmatched{0303}evar and Guillermo Ricardo Simari – A procedure for generating (conditional) answers in a goal-directed way / Kristof De Clerq and Rob Vanderbeken – Abductive inference in defeasible reasoning : a model for research programmes / Claudio Delrieux – Kepler's near discovery of the sine law : a quantitative computational model / Albrecht Heeffer – Default models of rationality / Silvia Lerner – Most inferences are defeasible / Jose\unmatched{0301} Carlos Loureiro Ralha and Ce\unmatched{0301}lia Ghedini Rahla – Reasoning through doing : epistemic mediators in scientific reasoning / Lorenzo Magnani – Do we need paraconsistency in commonsense reasoning? / Joke Meheus – Descartes, a methodical elimination of paradoxes for (de)-ontology building / Jean Sallantin ... [et al.] – Measuring coherence using LP-models / Carlos A. Oller – What are multi-agent systems trying to accomplish? Towards pragmatic game-theoretical agenda / Ahti-Veikko Pietarinen – Direct dynamic proofs for compatibility / Dagmar Provijn – Semantic computations of truth, based on associations already learned / Patrick Suppes and Jean-Yves Be\unmatched{0301}ziau – On the sense of eating strawberries, or, On the exclusivity implcature fo 'or' / Liza Verhoeven and Leon Horsten – A note on epistemology and logical afrificial intelligence / Gregory R. Wheeler and Lui\unmatched{0301}s Moniz Pereira.&lt;/p&gt;</style></abstract></record><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%">Weber, Erik</style></author><author><style face="normal" font="default" size="100%">De Clercq, Kristof</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Meheus, Joke</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Why the logic of explanation is inconsistency-adaptive.</style></title><secondary-title><style face="normal" font="default" size="100%">Inconsistency in science</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%">Kluwer</style></publisher><pages><style face="normal" font="default" size="100%">165–184</style></pages><isbn><style face="normal" font="default" size="100%">1-4020-0630-6</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language></record><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%">De Clercq, Kristof</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Two New Strategies for Inconsistency-Adaptive Logics</style></title><secondary-title><style face="normal" font="default" size="100%">Logic and Logical Philosophy</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2000</style></year></dates><volume><style face="normal" font="default" size="100%">8</style></volume><pages><style face="normal" font="default" size="100%">65–80</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 I present two new strategies for inconsistency- adaptive logics: the reliable sufficient information strategyof ACLuN3 and the minimally abnormal sufficient information strategyof ACLuN4. I give proof theory and semantics for both ACLuN3 and ACLuN4. I also com- pare them with the well-known inconsistency-adaptive logics ACLuN1 and ACLuN2.&lt;/p&gt;</style></abstract></record><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%">De Clercq, Kristof</style></author><author><style face="normal" font="default" size="100%">Kurtonina, Natasha</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Embedding and Interpolation for Some Paralogics. The Propositional Case</style></title><secondary-title><style face="normal" font="default" size="100%">Reports on Mathematical Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">1999</style></year></dates><volume><style face="normal" font="default" size="100%">33</style></volume><pages><style face="normal" font="default" size="100%">29–44</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;We consider the very weak paracomplete and paraconsistent logics that are obtained by a straightforward weakening of Classical Logic, as well as some of their maximal extensions that are a fragment of Classical Logic. We prove (for the propositional case) that these logics may be faithfully embedded in Classical Logic (as well as in each other), and that the interpolation theorem obtains for them.&lt;/p&gt;</style></abstract></record></records></xml>