TY - Generic T1 - Adaptive Deontic Logics Y1 - In Press A1 - Van De Putte, Frederik A1 - Beirlaen, Mathieu A1 - Meheus, Joke JA - Handbook of Deontic Logic and Normative Systems PB - College Publications VL - 2 ER - TY - JOUR T1 - Non-Adjunctive Deontic Logics That Validate Aggregation as Much as Possible JF - Journal of Applied Logic Y1 - In Press A1 - Meheus, Joke A1 - Beirlaen, Mathieu A1 - Van De Putte, Frederik A1 - Straßer, Christian ER - TY - JOUR T1 - Adaptive Deontic Logics: A Survey JF - IfCoLog Journal of Logics and their Applications Y1 - 2019 A1 - Van De Putte, Frederik A1 - Beirlaen, Mathieu A1 - Meheus, Joke VL - 6 SP - 523-608 UR - http://www.collegepublications.co.uk/downloads/ifcolog00032.pdf ER - TY - JOUR T1 - Adaptive Logic Characterizations of Input/output Logic JF - Studia Logica Y1 - 2016 A1 - Straßer, Christian A1 - Beirlaen, Mathieu A1 - Van De Putte, Frederik AB -

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.

VL - 104 SP - 869-916 CP - 5 ER - TY - JOUR T1 - An Inconsistency-Adaptive Deontic Logic for Normative Conflicts JF - Journal of Philosophical Logic Y1 - 2013 A1 - Beirlaen, Mathieu A1 - Straßer, Christian A1 - Meheus, Joke AB -

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$

VL - 42 SP - 285–315 ER - TY - JOUR T1 - Non-monotonic reasoning with normative conflicts in multi-agent deontic logic JF - Journal of Logic and Computation Y1 - 2013 A1 - Beirlaen, Mathieu A1 - Straßer, Christian AB -

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.

VL - 24 SP - 1179–1207 ER - TY - JOUR T1 - Two adaptive logics of norm-propositions JF - JOURNAL OF APPLIED LOGIC Y1 - 2013 A1 - Beirlaen, Mathieu A1 - Straßer, Christian AB -

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 LNP, 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 LNP within the adaptive logic framework for non-monotonic reasoning in order to meet (ii). This results in the adaptive logics LNPrLNPr and LNPmLNPm, which interpret a given set of premises in such a way that normative conflicts and normative gaps are avoided ‘whenever possible’. LNPrLNPr and LNPmLNPm are equipped with a preferential semantics and a dynamic proof theory.

VL - 11 SP - 147–168 ER - TY - Generic T1 - An Andersonian deontic logic with contextualized sanctions T2 - 11th International Conference on Deontic Logic in Computer Science, DEON2012 Y1 - 2012 A1 - Straßer, Christian A1 - Beirlaen, Mathieu ED - Agotnes, Thomas ED - Broersen, Jan ED - Elgesem, Dag AB -

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.

JA - 11th International Conference on Deontic Logic in Computer Science, DEON2012 PB - Springer SP - 151-169 SN - 9783642315695 ER - TY - JOUR T1 - Tolerating Deontic Conflicts by Adaptively Restricting Inheritance JF - Logique et Analyse Y1 - 2012 A1 - Straßer, Christian A1 - Meheus, Joke A1 - Beirlaen, Mathieu AB -

In order to deal with the possibility of deontic conflicts Lou Goble developed a group of logics DPM 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 DPM 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.

VL - 219 SP - 477-506 ER - TY - Generic T1 - Tolerating Normative Conflicts in Deontic Logic. Y1 - 2012 A1 - Beirlaen, Mathieu PB - Ghent University U1 -

Joke Meheus and Christian Straßer

ER - TY - Generic T1 - Towards More Conflict-Tolerant Deontic Logics Y1 - 2012 A1 - Beirlaen, Mathieu ED - Van Kerkhove, Bart ED - Libert, Thierry ED - Vanpaemel, Geert ED - Marage, Pierre AB -

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" oughtimplies can."

JA - Logic, Philosophy and History of Science in Belgium II PB - Koninklijke Vlaamse Academie van België CY - Brussel SP - 1-8 ER - TY - JOUR T1 - Understanding Human Agency, by Erasmus Mayr (review; in Dutch) JF - Tijdschrift voor Filosofie Y1 - 2012 A1 - Beirlaen, Mathieu VL - 2 SP - 383-385 ER - TY - Generic T1 - A unifying framework for reasoning about normative conflicts Y1 - 2012 A1 - Beirlaen, Mathieu ED - Pelis, Michal ED - Puncochar, Vit AB -

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.

JA - The logica yearbook 2011 PB - College Publications SP - 1–14 SN - 9781848900714 ER - TY - JOUR T1 - Aristotle's Modal Proofs, by Adriane Rini (review; in Dutch) JF - Tijdschrift voor Filosofie Y1 - 2011 A1 - Beirlaen, Mathieu VL - 4 SP - 749-751 ER - TY - JOUR T1 - Ethical consistency and the logic of ought JF - Theoretical and applied ethics Y1 - 2011 A1 - Beirlaen, Mathieu AB -

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˝.

VL - 1 SP - 45–51 ER - TY - Generic T1 - A paraconsistent multi-agent framework for dealing with normative conflicts T2 - 12th International Workshop on Computational Logic in Multi-Agent Systems (CLIMA XII) Y1 - 2011 A1 - Beirlaen, Mathieu A1 - Straßer, Christian ED - Leite, Joao ED - Torroni, Paolo ED - Agotnes, Thomas ED - Boella, Guido ED - van der Torre, Leon AB -

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'.

JA - 12th International Workshop on Computational Logic in Multi-Agent Systems (CLIMA XII) PB - Springer SP - 312-329 SN - 9783642223587 UR - http://dx.doi.org/10.1007/978-3-642-22359-4 ER - TY - CONF T1 - Avoiding Deontic Explosion by Contextually Restricting Aggregation T2 - Proceedings of the 10th International Conference on Deontic Logic in Computer Science (DEON 2010) Y1 - 2010 A1 - Meheus, Joke A1 - Beirlaen, Mathieu A1 - Van De Putte, Frederik ED - Governatori, Guido ED - Sartor, Giovanni AB -

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.

JA - Proceedings of the 10th International Conference on Deontic Logic in Computer Science (DEON 2010) PB - Springer CY - Dordrecht ER - TY - JOUR T1 - Report LRR10: Logic, reasoning and rationality JF - The Reasoner Y1 - 2010 A1 - Beirlaen, Mathieu A1 - Gauderis, Tjerk A1 - Gervais, Raoul A1 - Kosolosky, Laszlo VL - 4 SP - 165–166 UR - http://www.kent.ac.uk/secl/philosophy/jw/TheReasoner/vol4/TheReasoner-4(11).pdf ER - TY - RPRT T1 - Towards more conflict-tolerant deontic logics by relaxing the interdefinability between obligations and permissions Y1 - 2010 A1 - Straßer, Christian A1 - Beirlaen, Mathieu AB -

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 OA &\#8743; P&\#172; A. Moreover, for the sake of conflict-tolerance these logics usually do not validate the very intuitive principle (D), OA &\#8835; PA. We demonstrate in this paper that by relaxing the interdefinability between obligations and permission PA =df &\#172;O&\#172;A 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).

ER -