<?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%">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%">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%">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>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%">Beirlaen, Mathieu</style></author><author><style face="normal" font="default" size="100%">Straßer, Christian</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%">An Inconsistency-Adaptive Deontic Logic for Normative Conflicts</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%">2</style></number><volume><style face="normal" font="default" size="100%">42</style></volume><pages><style face="normal" font="default" size="100%">285–315</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 present the inconsistency-adaptive deontic logic \sys{DP}$^r$, a nonmonotonic logic for dealing with conflicts between normative statements. On the one hand, this logic does not lead to explosion in view of normative conflicts. On the other hand, \sys{DP}$^r$ still verifies all intuitively reliable inferences valid in Standard Deontic Logic (\sys{SDL}). \sys{DP}$^r$ interprets a given premise set as normally as possible with respect to \sys{SDL}. Whereas some \sys{SDL}-rules are verified unconditionally by \sys{DP}$^r$, others are verified conditionally. The latter are applicable unless they rely on formulas that turn out to behave inconsistently in view of the premises. This dynamic process is mirrored by the proof theory of \sys{DP}$^r$&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%">Beirlaen, Mathieu</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-monotonic reasoning with normative conflicts in multi-agent 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%">2013</style></year></dates><number><style face="normal" font="default" size="100%">6</style></number><volume><style face="normal" font="default" size="100%">24</style></volume><pages><style face="normal" font="default" size="100%">1179–1207</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 present two multi-agent deontic logics that consistently accommodate various types of normative conflicts. Its language features modal operators for obligation and permission, and for the realization of individual and collective actions. The logic is non-classical since it makes use of a paraconsistent and paracomplete negation connective. Moreover, it is non-monotonic due to its definition within the adaptive logics framework for defeasible reasoning. The logic is equipped with a defeasible proof theory and 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%">Beirlaen, Mathieu</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%">Two adaptive logics of norm-propositions</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%">2013</style></year></dates><number><style face="normal" font="default" size="100%">2</style></number><volume><style face="normal" font="default" size="100%">11</style></volume><pages><style face="normal" font="default" size="100%">147–168</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 present two defeasible logics of norm-propositions (statements about norms) that (i) consistently allow for the possibility of normative gaps and normative conflicts, and (ii) map each premise set to a sufficiently rich consequence set. In order to meet (i), we define the logic &lt;strong&gt;LNP&lt;/strong&gt;, a conflict- and gap-tolerant logic of norm-propositions capable of formalizing both normative conflicts and normative gaps within the object language. Next, we strengthen &lt;strong&gt;LNP&lt;/strong&gt; within the adaptive logic framework for non-monotonic reasoning in order to meet (ii). This results in the adaptive logics &lt;strong&gt;LNP&lt;sup&gt;r&lt;/sup&gt;LNP&lt;sup&gt;r&lt;/sup&gt;&lt;/strong&gt; and &lt;strong&gt;LNP&lt;sub&gt;mLNP&lt;sup&gt;m&lt;/sup&gt;&lt;/sub&gt;&lt;/strong&gt;, which interpret a given set of premises in such a way that normative conflicts and normative gaps are avoided whenever possible. &lt;strong&gt;LNP&lt;sup&gt;r&lt;/sup&gt;LNP&lt;sup&gt;r&lt;/sup&gt;&lt;/strong&gt; and &lt;strong&gt;LNP&lt;sup&gt;m&lt;/sup&gt;LNP&lt;sup&gt;m&lt;/sup&gt;&lt;/strong&gt; are equipped with a preferential semantics and a dynamic proof theory.&lt;/p&gt;</style></abstract></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%">Straßer, Christian</style></author><author><style face="normal" font="default" size="100%">Beirlaen, Mathieu</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Agotnes, Thomas</style></author><author><style face="normal" font="default" size="100%">Broersen, Jan</style></author><author><style face="normal" font="default" size="100%">Elgesem, Dag</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">An Andersonian deontic logic with contextualized sanctions</style></title><secondary-title><style face="normal" font="default" size="100%">11th International Conference on Deontic Logic in Computer Science, DEON2012</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pages><style face="normal" font="default" size="100%">151-169</style></pages><isbn><style face="normal" font="default" size="100%">9783642315695</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;We present a refinement of Anderson's reduction of deontic logic to modal logic with only alethic modalities. The refined proposal contextualizes the Andersonian sanction constant s by replacing it with a unary sanction operator S that is dependent on the concrete normative requirement that is violated. A formula S B is then for instance interpreted as ldquo B causes a sanctionrdquo or as ldquo B provides a reason for (the applicability of) a sanctionrdquo. Due to its modified sanction operator, the resulting logic DSL invalidates some instances of the inheritance principle. This gives rise to new interesting features. For instance, DSL consistently allows for the presence of conflicting obligations. Moreover, it provides novel insights in various central `paradoxes' in deontic logic such as the Ross paradox, the paradox of the good Samaritan, and Forrester's `gentle murderer' paradox.&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%">Straßer, Christian</style></author><author><style face="normal" font="default" size="100%">Meheus, Joke</style></author><author><style face="normal" font="default" size="100%">Beirlaen, Mathieu</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Tolerating Deontic Conflicts by Adaptively Restricting Inheritance</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><volume><style face="normal" font="default" size="100%">219</style></volume><pages><style face="normal" font="default" size="100%">477-506</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 order to deal with the possibility of deontic conflicts Lou Goble developed a group of logics &lt;strong&gt;DPM&lt;/strong&gt; that are characterized by a restriction of the inheritance principle. While they approximate the deductive power of standard deontic logic, they do so only if the user adds certain statements to the premises. By adaptively strengthening the &lt;strong&gt;DPM&lt;/strong&gt; logics, this paper presents logics that overcome this shortcoming. Furthermore, they are capable of modeling the dynamic and defeasible aspect of our normative reasoning by their dynamic proof theory. This way they enable us to have a better insight in the relations between obligations and thus to localize deontic conflicts.&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%">Beirlaen, Mathieu</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Tolerating Normative Conflicts in Deontic Logic.</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%">September 13</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 Christian Straßer&lt;/p&gt;</style></custom1></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%">Beirlaen, Mathieu</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Van Kerkhove, Bart</style></author><author><style face="normal" font="default" size="100%">Libert, Thierry</style></author><author><style face="normal" font="default" size="100%">Vanpaemel, Geert</style></author><author><style face="normal" font="default" size="100%">Marage, Pierre</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Towards More Conflict-Tolerant Deontic Logics</style></title><secondary-title><style face="normal" font="default" size="100%">Logic, Philosophy and History of Science in Belgium II</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><publisher><style face="normal" font="default" size="100%">Koninklijke Vlaamse Academie van België</style></publisher><pub-location><style face="normal" font="default" size="100%">Brussel</style></pub-location><pages><style face="normal" font="default" size="100%">1-8</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 &lt;em&gt;Ethical Consistency&lt;/em&gt;, Bernard Williams vindicated the possibility of moral conflicts; he proposed to consistently allow for the presence of such conflicts within the logic of &lt;em&gt;ought&lt;/em&gt;. In determining the nature of moral conflict, Williams stressed its contingency. In this paper, Williams characterization of moral conflict is defended. However, Williams solution for consistently allowing for such conflicts within the logic of &lt;em&gt;ought&lt;/em&gt; is shown to be too crude. Whereas Williams rejects &lt;em&gt;all&lt;/em&gt; applications of the agglomeration rule in the logic of &lt;em&gt;ought&lt;/em&gt;, it is shown that a more sophisticated approach is needed. An alternative solution is presented in which the application of the agglomeration rule is made conditional upon the principle that&quot; &lt;em&gt;ought&lt;/em&gt;implies &lt;em&gt;can&lt;/em&gt;.&quot;&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%">Beirlaen, Mathieu</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Understanding Human Agency, by Erasmus Mayr (review; in Dutch)</style></title><secondary-title><style face="normal" font="default" size="100%">Tijdschrift voor Filosofie</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><volume><style face="normal" font="default" size="100%">2</style></volume><pages><style face="normal" font="default" size="100%">383-385</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>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Beirlaen, Mathieu</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Pelis, Michal</style></author><author><style face="normal" font="default" size="100%">Puncochar, Vit</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A unifying framework for reasoning about normative conflicts</style></title><secondary-title><style face="normal" font="default" size="100%">The logica yearbook 2011</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><publisher><style face="normal" font="default" size="100%">College Publications</style></publisher><pages><style face="normal" font="default" size="100%">1–14</style></pages><isbn><style face="normal" font="default" size="100%">9781848900714</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;First, two context-dependent desiderata are presented for devising calculi of deontic logic that can consistently accommodate normative conflicts. Conflict-tolerant deontic logics (CTDLs) can be evaluated by their treatment of the trade-off between these desiderata. Next, it is argued that CTDLs defined within the standard format for adaptive logics are particularly good at overcoming this trade-off.&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%">Beirlaen, Mathieu</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Aristotle's Modal Proofs, by Adriane Rini (review; in Dutch)</style></title><secondary-title><style face="normal" font="default" size="100%">Tijdschrift voor Filosofie</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%">73</style></number><volume><style face="normal" font="default" size="100%">4</style></volume><pages><style face="normal" font="default" size="100%">749-751</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%">Beirlaen, Mathieu</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Ethical consistency and the logic of ought</style></title><secondary-title><style face="normal" font="default" size="100%">Theoretical and applied ethics</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%">3</style></number><volume><style face="normal" font="default" size="100%">1</style></volume><pages><style face="normal" font="default" size="100%">45–51</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 Ethical Consistency, Bernard Williams vindicated the possibility of moral conflicts; he proposed to consistently allow for the presence of such conflicts within the logic of 'ought'. In determining the nature of moral conflict, Williams stressed its contingency. In this paper, Williams’ characterization of moral conflict is defended. However, Williams’ solution for consistently allowing for such conflicts within the logic of 'ought' is shown to be too crude. Whereas Williams rejects all applications of the agglomeration rule in the logic of 'ought', it is shown that a more sophisticated approach is needed. An alternative solution is presented in which the application of the agglomeration rule is made conditional upon the principle that ˝ought implies can˝.&lt;/p&gt;</style></abstract></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%">Beirlaen, Mathieu</style></author><author><style face="normal" font="default" size="100%">Straßer, Christian</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Leite, Joao</style></author><author><style face="normal" font="default" size="100%">Torroni, Paolo</style></author><author><style face="normal" font="default" size="100%">Agotnes, Thomas</style></author><author><style face="normal" font="default" size="100%">Boella, Guido</style></author><author><style face="normal" font="default" size="100%">van der Torre, Leon</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">A paraconsistent multi-agent framework for dealing with normative conflicts</style></title><secondary-title><style face="normal" font="default" size="100%">12th International Workshop on Computational Logic in Multi-Agent Systems (CLIMA XII)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2011</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-642-22359-4</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pages><style face="normal" font="default" size="100%">312-329</style></pages><isbn><style face="normal" font="default" size="100%">9783642223587</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;In a multi-agent deontic setting, normative conflicts can take a variety of different logical forms. In this paper, we present a very general characterization of such conflicts, including both intra- and inter-agent normative conflicts, conflicts between groups of agents, conflicts between obligations and permissions, and conflicts between contradictory norms. In order to account for the consistent possibility of this wide variety of conflict-types, we present a paraconsistent deontic logic, i.e. a logic that invalidates the classical principle of non-contradiction. Next, we strengthen this logic within the adaptive logics framework for defeasible reasoning. The resulting inconsistency-adaptive deontic logic interprets a given set of norms 'as consistently as possible'.&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><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%">Beirlaen, Mathieu</style></author><author><style face="normal" font="default" size="100%">Gauderis, Tjerk</style></author><author><style face="normal" font="default" size="100%">Gervais, Raoul</style></author><author><style face="normal" font="default" size="100%">Kosolosky, Laszlo</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Report LRR10: Logic, reasoning and rationality</style></title><secondary-title><style face="normal" font="default" size="100%">The Reasoner</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.kent.ac.uk/secl/philosophy/jw/TheReasoner/vol4/TheReasoner-4(11).pdf</style></url></web-urls></urls><number><style face="normal" font="default" size="100%">11</style></number><volume><style face="normal" font="default" size="100%">4</style></volume><pages><style face="normal" font="default" size="100%">165–166</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>27</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></authors></contributors><titles><title><style face="normal" font="default" size="100%">Towards more conflict-tolerant deontic logics by relaxing the interdefinability between obligations and permissions</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;While conflict-tolerant logics (CTDLs) usually allow for obligation- obligation conflicts, they fall short of tolerating obligation-permission con- flicts (OP-conflicts) of the type O&lt;em&gt;A&lt;/em&gt; &amp;amp;\#8743; P&amp;amp;\#172; &lt;em&gt;A&lt;/em&gt;. Moreover, for the sake of conflict-tolerance these logics usually do not validate the very intuitive principle (D), O&lt;em&gt;A&lt;/em&gt; &amp;amp;\#8835; P&lt;em&gt;A&lt;/em&gt;. We demonstrate in this paper that by relaxing the interdefinability between obligations and permission P&lt;em&gt;A&lt;/em&gt; =&lt;sub&gt;df&lt;/sub&gt; &amp;amp;\#172;O&amp;amp;\#172;&lt;em&gt;A&lt;/em&gt; that is characteristic for most deontic logics, the logics get more conflict-tolerant since they allow for OP-conflicts. Moreover, this way they can be equipped with (D) without the need to sacrifice conflict-tolerance. In this paper we offer a generic procedure that transforms a given CTDL into a logic that tolerates OP-conflicts and validates (D).&lt;/p&gt;</style></abstract></record></records></xml>