<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>34</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Van De Putte, Frederik</style></author><author><style face="normal" font="default" size="100%">Klein, Dominik</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Pooling Modalities and Pointwise Intersection: Semantics, Expressivity, and Applications</style></title></titles><dates><year><style  face="normal" font="default" size="100%">Submitted</style></year></dates><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>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Van De Putte, Frederik</style></author><author><style face="normal" font="default" size="100%">Beirlaen, Mathieu</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%">Adaptive Deontic Logics</style></title><secondary-title><style face="normal" font="default" size="100%">Handbook of Deontic Logic and Normative Systems</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">In Press</style></year></dates><edition><style face="normal" font="default" size="100%">1</style></edition><publisher><style face="normal" font="default" size="100%">College Publications</style></publisher><volume><style face="normal" font="default" size="100%">2</style></volume><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%">Van De Putte, Frederik</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Coarse Deontic Logic</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Logic and Computation</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">In Press</style></year></dates><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%">Meheus, Joke</style></author><author><style face="normal" font="default" size="100%">Beirlaen, Mathieu</style></author><author><style face="normal" font="default" size="100%">Van De Putte, Frederik</style></author><author><style face="normal" font="default" size="100%">Straßer, Christian</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Non-Adjunctive Deontic Logics That Validate Aggregation as Much as Possible</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Applied Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">In Press</style></year></dates><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%">Frijters, Stef</style></author><author><style face="normal" font="default" size="100%">Van De Putte, Frederik</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Classical term-modal logics</style></title><secondary-title><style face="normal" font="default" size="100%">JOURNAL OF LOGIC AND COMPUTATION</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Arts and Humanities (miscellaneous)</style></keyword><keyword><style  face="normal" font="default" size="100%">CHOICE}</style></keyword><keyword><style  face="normal" font="default" size="100%">Hardware and Architecture</style></keyword><keyword><style  face="normal" font="default" size="100%">logic</style></keyword><keyword><style  face="normal" font="default" size="100%">Software</style></keyword><keyword><style  face="normal" font="default" size="100%">{Theoretical Computer Science</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2021</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">{http://dx.doi.org/10.1093/logcom/exaa053}</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">4</style></number><volume><style face="normal" font="default" size="100%">31</style></volume><pages><style face="normal" font="default" size="100%">1026-1054</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 introduce classical term-modal logics and argue that they are useful for modelling agent-relative notions of obligation, evidence and abilities, and their interaction with properties of and relations between the agents in question. We spell out the semantics of these logics in terms of neighborhood models, provide sound and strongly complete axiomatizations and establish the decidability of specific (agent-finite) variants.}&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%">Van De Putte, Frederik</style></author><author><style face="normal" font="default" size="100%">Klein, Dominik</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Pooling Modalities and Pointwise Intersection: Axiomatization and Decidability</style></title><secondary-title><style face="normal" font="default" size="100%">Studia Logica</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2020</style></year></dates><volume><style face="normal" font="default" size="100%">online first</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;&lt;span&gt;We establish completeness and the finite model property for logics featuring the &lt;/span&gt;&lt;em&gt;pooling modalities&lt;/em&gt;&lt;span&gt; that were introduced in Van De&amp;nbsp;Putte and Klein (Pooling modalities and pointwise intersection: semantics, expressivity, and applications). The definition of our canonical models combines standard techniques with a so-called “puzzle piece construction”, which we first illustrate informally. After that, we apply it to the weakest classical logics with pooling modalities and investigate the technique’s potential for the axiomatization of stronger logics, obtained by imposing well-known frame conditions on the models.&lt;/span&gt;&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%">Van De Putte, Frederik</style></author><author><style face="normal" font="default" size="100%">Beirlaen, Mathieu</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%">Adaptive Deontic Logics: A Survey</style></title><secondary-title><style face="normal" font="default" size="100%">IfCoLog Journal of Logics and their Applications</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2019</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.collegepublications.co.uk/downloads/ifcolog00032.pdf</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">3</style></number><volume><style face="normal" font="default" size="100%">6</style></volume><pages><style face="normal" font="default" size="100%">523-608</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><section><style face="normal" font="default" size="100%">523</style></section></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>34</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Van De Putte, Frederik</style></author><author><style face="normal" font="default" size="100%">Tamminga, Allard</style></author><author><style face="normal" font="default" size="100%">Duijf, Hein</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The best we can do (extended abstract, submitted to LOFT)</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><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>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Van De Putte, Frederik</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Choosing the right concept of &quot;right choices&quot; (technical report)</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><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>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Van De Putte, Frederik</style></author><author><style face="normal" font="default" size="100%">Frijters, Stef</style></author><author><style face="normal" font="default" size="100%">Meheus, Joke</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Condoravdi, Cleo</style></author><author><style face="normal" font="default" size="100%">Nair, Shyam</style></author><author><style face="normal" font="default" size="100%">Pigozzi, Gabriella</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">How to take heroin (if at all). A new approach to detachment in deontic logic</style></title><secondary-title><style face="normal" font="default" size="100%">Deontic Logic and Normative Systems: 14th International Conference</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2018</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><pages><style face="normal" font="default" size="100%">317-335</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><work-type><style face="normal" font="default" size="100%">submitted</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>34</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Van De Putte, Frederik</style></author><author><style face="normal" font="default" size="100%">Klein, Dominik</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Pointwise intersection in neighbourhood modal logic</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><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>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Van De Putte, Frederik</style></author><author><style face="normal" font="default" size="100%">Tamminga, Allard</style></author><author><style face="normal" font="default" size="100%">Duijf, Hein</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Doing Without Nature</style></title><secondary-title><style face="normal" font="default" size="100%">Logic, Rationality, and Interaction (LORI)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year><pub-dates><date><style  face="normal" font="default" size="100%">9-11/7/2017</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">VI</style></number><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pub-location><style face="normal" font="default" size="100%">Sapporro</style></pub-location><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>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Van De Putte, Frederik</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Free Choice Permission in STIT</style></title><secondary-title><style face="normal" font="default" size="100%">Logica Yearbook 2016</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><edition><style face="normal" font="default" size="100%">Pavel Arazim and Tomáš Lávička</style></edition><publisher><style face="normal" font="default" size="100%">College Publications</style></publisher><pages><style face="normal" font="default" size="100%">289--303</style></pages><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%">Straßer, Christian</style></author><author><style face="normal" font="default" size="100%">Beirlaen, Mathieu</style></author><author><style face="normal" font="default" size="100%">Van De Putte, Frederik</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Adaptive Logic Characterizations of Input/output Logic</style></title><secondary-title><style face="normal" font="default" size="100%">Studia Logica</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><volume><style face="normal" font="default" size="100%">104</style></volume><pages><style face="normal" font="default" size="100%">869-916</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 translate the unconstrained and constrained input/output-logics from [17, 18] to reflexive modal logics, using adaptive logics for the constrained case. The resulting reformulation has various advantages. First, we obtain a proof-theoretic (dynamic) characterization of input/output logics. Second, we demonstrate that our modal framework gives naturally rise to useful variants. Finally, the modal logics display a gain in expressive power over their original counterparts in the input/output framework.&lt;/p&gt;</style></abstract><issue><style face="normal" font="default" size="100%">5</style></issue><section><style face="normal" font="default" size="100%">869</style></section></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%">Straßer, Christian</style></author><author><style face="normal" font="default" size="100%">Van De Putte, Frederik</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Adaptive strategies and finite-conditional premise sets</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Logic and Computation</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">+ http://dx.doi.org/10.1093/logcom/exu044</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">5</style></number><volume><style face="normal" font="default" size="100%">26</style></volume><pages><style face="normal" font="default" size="100%">1517-1539</style></pages><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>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Van De Putte, Frederik</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Coarse Deontic Logic (short version)</style></title><secondary-title><style face="normal" font="default" size="100%">Deontic Logic and Normative Systems</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><publisher><style face="normal" font="default" size="100%">College Publications</style></publisher><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%">Van De Putte, Frederik</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Splitting and Relevance: Broadening the Scope of Parikh's Concepts</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%">2016</style></year></dates><volume><style face="normal" font="default" size="100%">59</style></volume><pages><style face="normal" font="default" size="100%">173 -205</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><issue><style face="normal" font="default" size="100%">234</style></issue><section><style face="normal" font="default" size="100%">173 </style></section></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%">Van De Putte, Frederik</style></author><author><style face="normal" font="default" size="100%">Straßer, Christian</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Adaptive logics: a parametric approach</style></title><secondary-title><style face="normal" font="default" size="100%">Logic Journal of the IGPL</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">+ http://dx.doi.org/10.1093/jigpal/jzu017</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">6</style></number><volume><style face="normal" font="default" size="100%">22</style></volume><pages><style face="normal" font="default" size="100%">905-932</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><section><style face="normal" font="default" size="100%">905</style></section></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%">Van De Putte, Frederik</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Default Assumptions and Selection Functions: A Generic Framework for Non-monotonic Logics</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of MICAI2013, Lecture Notes in Artificial Intelligence</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><volume><style face="normal" font="default" size="100%">8264</style></volume><pages><style face="normal" font="default" size="100%">54-67</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 investigate a generalization of so-called default-assumption consequence relations, obtained by replacing the consequence relation of classical logic with an arbitrary supraclassical, compact Tarski-logic, and using arbitrary selection functions on sets of sets of defaults. Both generalizations are inspired by various approaches in non-monotonic logic and belief revision. We establish some meta-theoretic properties of the resulting systems. In addition, we compare them with two other frameworks from the literature on non-monotonic logic, viz. adaptive logics and selection semantics.&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%">Urbaniak, Rafal</style></author><author><style face="normal" font="default" size="100%">Van De Putte, Frederik</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Induction from a single instance: Incomplete frames</style></title><secondary-title><style face="normal" font="default" size="100%">Foundations of science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><number><style face="normal" font="default" size="100%">4</style></number><volume><style face="normal" font="default" size="100%">18</style></volume><pages><style face="normal" font="default" size="100%">641–653</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 argue that an existing theory of concepts called dynamic frame theory, although not developed with that purpose in mind, allows for the precise formulation of a number of problems associated with induction from a single instance. A key role is played by the distinction we introduce between complete and incomplete dynamic frames, for incomplete frames seem to be very elegant candidates for the format of the background knowledge used in induction from a single instance. Furthermore, we show how dynamic frame theory provides the terminology to discuss the justification and the fallibility of incomplete frames. In the Appendix, we give a formal account of incomplete frames and the way these lead to induction from a single instance.&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%">Van De Putte, Frederik</style></author><author><style face="normal" font="default" size="100%">Straßer, Christian</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Preferential Semantics using Non-smooth Preference Relations</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Philosophical Logic</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><number><style face="normal" font="default" size="100%">5</style></number><volume><style face="normal" font="default" size="100%">43</style></volume><pages><style face="normal" font="default" size="100%">903–942</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 studies the properties of eight semantic consequence relations defined from a Tarski-logic &lt;strong&gt;L&lt;/strong&gt; and a preference relation &amp;amp;\#8826;. They are equivalent to Shohams so-called preferential entailment for smooth model structures, but avoid certain problems of the latter in non-smooth configurations. Each of the logics can be characterized in terms of what we call multi-selection semantics. After discussing this type of semantics, we focus on some concrete proposals from the literature, checking a number of meta-theoretic properties and elaborating on their intuitive motivation. As it turns out, many of their meta-properties only hold in case &amp;amp;\#8826; is transitive. To tackle this problem, we propose slight modifications of each of the systems, showing the resulting logics to behave better at the intuitive level and in metatheoretic terms, for arbitrary &amp;amp;\#8826;.&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%">Van De Putte, Frederik</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Prime implicates and relevant belief revision</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Logic and Computation</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">23</style></volume><pages><style face="normal" font="default" size="100%">109–119</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 article discusses Parikhs axiom of relevance in belief revision, and recalls some results from Kourousias and Makinson (2007, J. Symbolic Logic, &lt;strong&gt;72&lt;/strong&gt;, 9941002) in this context. The crucial distinction is emphasized between the uniqueness of the finest splitting of K and the fact that K has several normal forms associated with that finest splitting. The main new result of this article is a new proof for the theorem that the set of prime implicates of K is a normal form for the finest splitting of K. It is explained how this proof avoids a mistake in an earlier proof from Wu and Zhang (2010, Knowledge-Based Syst., &lt;strong&gt;23&lt;/strong&gt;, 7076). As a corollary, relevance can be re-defined without reference to the finest splitting, using the notion of path-relevance from Makinson (2009, J. Appl. Logic, &lt;strong&gt;7&lt;/strong&gt;, 377387). Finally, a weak yet sufficient condition for irrelevance is presented.&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%">Van De Putte, Frederik</style></author><author><style face="normal" font="default" size="100%">Straßer, Christian</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Three formats of prioritized adaptive logics: a comparative study</style></title><secondary-title><style face="normal" font="default" size="100%">Logic journal of the IGPL</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><volume><style face="normal" font="default" size="100%">21</style></volume><pages><style face="normal" font="default" size="100%">127–159</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;A broad range of defeasible reasoning forms has been explicated by prioritized adaptive logics. However, the relative lack in meta-theory of many of these logics stands in sharp contrast to the frequency of their application. This article presents the first comparative study of a large group of prioritized adaptive logics. Three formats of such logics are discussed: superpositions of adaptive logics, hierarchic adaptive logics from F. Van De Putte (2011, &lt;em&gt;Log. J. IGPL, doi:10.1093/jigpal/jzr025&lt;/em&gt;) and lexicographic adaptive logics from F. Van De Putte and C. Stra&amp;amp;\#223;er (2012, &lt;em&gt;Log. Anal., forthcoming&lt;/em&gt;). We restrict the scope to logics that use the strategy Minimal Abnormality. It is shown that the semantic characterizations of these systems are equivalent and that they are all sound with respect to either of these characterizations. Furthermore, sufficient conditions for the completeness and equivalence of the consequence relations of the three formats are established. Some attractive properties, including Fixed Point and the Deduction Theorem, are shown to hold whenever these conditions are obeyed.&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%">Gauderis, Tjerk</style></author><author><style face="normal" font="default" size="100%">Van De Putte, Frederik</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Abduction of generalizations</style></title><secondary-title><style face="normal" font="default" size="100%">Theoria - revista de teoria historia y fundamentos de la ciencia</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><number><style face="normal" font="default" size="100%">3</style></number><volume><style face="normal" font="default" size="100%">27</style></volume><pages><style face="normal" font="default" size="100%">345–364</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Abduction of generalizations is the process in which explanatory hypotheses are formed for generalizations such as pineapples taste sweet or rainbows appear when the sun breaks through the rain. This phenomenon has received little attention in formal logic and philosophy of science. The current paper remedies this lacuna by first giving an overview of some general characteristics of this process, elaborating on its ubiquity in scientific and everyday reasoning. Second, the adaptive logic LA &amp;amp;\#8704; is presented to explicate this process formally&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%">Van De Putte, Frederik</style></author><author><style face="normal" font="default" size="100%">Verdée, Peter</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The Dynamics of Relevance: Adaptive Belief Revision</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%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">May</style></date></pub-dates></dates><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">187</style></volume><pages><style face="normal" font="default" size="100%">1-42</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 presents eight (previously unpublished) adaptive logics for belief revision, each of which define a belief revision operation in the sense of the AGM framework. All these revision operations are shown to satisfy the six basic AGM postulates for belief revision, and Parikhs axiom of Relevance. Using one of these logics as an example, we show how their proof theory gives a more dynamic flavor to belief revision than existing approaches. It is argued that this turns belief revision (that obeys Relevance) into a more natural undertaking, where analytic steps are performed only as soon as they turn out to be necessary in order to uphold certain beliefs.&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%">Van De Putte, Frederik</style></author><author><style face="normal" font="default" size="100%">Straßer, Christian</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Extending the standard format of adaptive logics to the prioritized case</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%">2012</style></year></dates><number><style face="normal" font="default" size="100%">220</style></number><volume><style face="normal" font="default" size="100%">55</style></volume><pages><style face="normal" font="default" size="100%">601–641</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 introduces a new format for reasoning with prioritized stan- dards of normality. It is applicable in a broad variety of contexts, e.g. dealing with (possibly conflicting) prioritized belief bases or combining different reasoning methods in a prioritized way. The format is a gener- alization of the standard format of adaptive logics (see [4]). Every logic that is formulated within it has a straightforward semantics in the style of Shohams selection semantics (see [22]) and a dynamic proof theory. Fur- thermore, it can count on a rich meta-theory that inherits the attractive features of the standard format, such as soundness and completeness, re- flexivity, idempotence, cautious monotonicity, and many other properties.&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%">Van De Putte, Frederik</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Generic Formats for Prioritized Adaptive Logics. With Applications in Deontic Logic, Abduction and Belief Revision</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">May 24</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;Joke Meheus and Peter Verdée&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%">Straßer, Christian</style></author><author><style face="normal" font="default" size="100%">Van De Putte, Frederik</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Proof Theories for Superpositions of Adaptive Logics</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%">2012</style></year></dates><pages><style face="normal" font="default" size="100%">1–33</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The standard format for adaptive logics offers a generic and unifying formal framework for defeasible reasoning forms. One of its main distinguishing features is a dynamic proof theory by means of which it is able to explicate actual reasoning. In many applications it has proven very useful to superpose sequences of adaptive logics, such that each logic treats the consequence set of its predecessor as premise set. Although attempts have been made to define dynamic proof theories for some of the resulting logics, no generic proof theory is available yet. Moreover, the existing proof theories for concrete superpositions are suboptimal in various respects: the derivability relations characterized by these proposals are often not adequate with respect to the consequence relation of the superposed adaptive logics and in some cases they even trivialize premise sets. An adequate and generic proof theory is needed in order to meet the requirement of explicating defeasible reasoning in terms of superpositions of adaptive logics. This paper presents two generic proof theories for superpositions of adaptive logics in standard format. By means of simple examples, the basic ideas behind these proof theories are illustrated and it is shown how the older proposals are inadequate.&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%">Van De Putte, Frederik</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Hierarchic adaptive logics</style></title><secondary-title><style face="normal" font="default" size="100%">Logic Journal of the IGPL</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><number><style face="normal" font="default" size="100%">1</style></number><volume><style face="normal" font="default" size="100%">20</style></volume><pages><style face="normal" font="default" size="100%">45–72</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 article discusses the proof theory, semantics and meta-theory of a class of adaptive logics, called hierarchic adaptive logics. Their specific characteristics are illustrated throughout the article with the use of one exemplary logic HKx, an explicans for reasoning with prioritized belief bases. A generic proof theory for these systems is defined, together with a less complex proof theory for a subclass of them. Soundness and a restricted form of completeness are established with respect to a non-redundant semantics. It is shown that all hierarchic adaptive logics are reflexive, have the strong reassurance property and that a subclass of them is a fixed point for a broad class of premise sets. Finally, they are compared to a different yet related class of adaptive logics.&lt;/p&gt;</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Meheus, Joke</style></author><author><style face="normal" font="default" size="100%">Beirlaen, Mathieu</style></author><author><style face="normal" font="default" size="100%">Van De Putte, Frederik</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Governatori, Guido</style></author><author><style face="normal" font="default" size="100%">Sartor, Giovanni</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Avoiding Deontic Explosion by Contextually Restricting Aggregation</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 10th International Conference on Deontic Logic in Computer Science (DEON 2010)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pub-location><style face="normal" font="default" size="100%">Dordrecht</style></pub-location><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 an adaptive logic for deontic conflicts, called \sys{P2.1}$^r$, that is based on Goble's logic \sys{SDL}$a$\sys{P}$e$–-a bimodal extension of Goble's logic \sys{P} that invalidates aggregation for all \emph{prima facie} obligations. The logic \sys{P2.1}$^r$ has several advantages with respect to \sys{SDL}$a$\sys{P}$e$. For consistent sets of obligations it yields the same results as Standard Deontic Logic and for inconsistent sets of obligations, it validates aggregation ``as much as possible''. It thus leads to a richer consequence set than \sys{SDL}$a$\sys{P}$e$. The logic \sys{P2.1}$^r$ avoids Goble's criticisms against other non-adjunctive systems of deontic logic. Moreover, it can handle all the `toy examples' from the literature as well as more complex ones.&lt;/p&gt;</style></abstract></record></records></xml>