<?xml version="1.0" encoding="UTF-8"?><xml><records><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>