Abstract
Lou Goble proposed powerful conditional deontic logics (CDPM) in that are able to deal with deontic conflicts by restricting the inheritance principle. One of the central problems for dyadic deontic logics is to properly treat the restricted applicability of the principle. “strengthening the antecedent”. In most cases it is desirable to derive from an obligation A under condition B, that A is also obliged under condition B and C. However, there are important counterexamples. Goble proposed a weakened rational monotonicity principle to tackle this problem. This solution is suboptimal as it is for some examples counter-intuitive or even leads to explosion. The chapter identifies also other problems of Goble’s systems. For instance, to make optimal use of the restricted inheritance principle, in many cases the user has to manually add certain statements to the premises. An adaptive logic framework on basis of CDPM is proposed which is able to tackle these problems. It allows for certain rules to be applied as much as possible. In this way counter-intuitive consequences as well as explosion can be prohibited and no user interference is required. Furthermore, for non-conflicting premise sets the adaptive logics are equivalent to Goble’s dyadic version of standard deontic logic.
A former version of the content of this chapter has been published under the name “An Adaptive Logic Framework for Conditional Obligations and Deontic Dilemmas” in the Journal “Logic and Logical Philosophy”, 2010, [1].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The permission operator is as usually defined by \(\mathsf {P}_{}(A\mid B) =_\mathrm{df }\lnot {\mathsf {O}}_{}(\lnot A\mid B)\).
- 2.
As in the monadic case in Chap. 10, we use a slight variation of Goble’s CDPM.2 which employs \(\vdash \bigl ({\mathsf {O}}_{}(A\mid C) \wedge {\mathsf {O}}_{}(B\mid C) \wedge \mathsf {P}_{}(A\wedge B\mid C)\bigr ) \supset {\mathsf {O}}_{}(A\wedge B\mid C)\) (CPAND) instead of our (CPAND\('\)). Using \({\mathbf{CDPM.2}}^{\prime}{\bf c}\) instead of CDPM.2c as lower limit logic leads to technically more elegant ALs. Furthermore, in contrast to CDPM.2c, \(\mathbf {{CDPM.2}}^{\prime}\!{\bf c}\), fulfills criterion \((C\star )\) that is going to be introduced in a moment.
- 3.
Some of the principles in \(\mathcal {P}\) will be defined later on (namely WRM\(_{\star }\), PS, CD and AWRM\(_{\star }\)).
- 4.
We slightly adjusted the criteria offered by Goble since his criteria were formulated in terms of theoremhood, while we focus on the consequences of premise sets. Models validating counter-instances of the criteria can be found in the proof of Theorem I.2.1 in Appendix I.
- 5.
References
Straßer, C.: An adaptive logic framework for conditional obligations and deontic dilemmas. Logic Log. Philos. 19(1–2), 95–128 (2010)
Goble, L.: A proposal for dealing with deontic dilemmas. In: Lomuscio, A., Nute, D. (eds.) DEON. Lecture Notes in Computer Science, vol. 3065, pp. 74–113. Springer (2004)
Straßer, C., Meheus, J., Beirlaen, M.: Tolerating deontic conflicts by adaptively restricting inheritance. Logique et Analyse 219, 477–506 (2012)
Straßer, C.: A deontic logic framework allowing for factual detachment. J. Appl. Logic 9(1), 61–80 (2010)
Meheus, J., Beirlaen, M., Putte, F.V.D.: Avoiding deontic explosion by contextually restricting aggregation. In: Governatori, G., Sartor, G. (eds.) DEON (10th International Conference on Deontic Logic in Computer Science). Lecture Notes in Artificial Intelligence, vol. 6181, pp. 148–165. Springer (2010)
Meheus, J., Beirlaen, M., Putte, F.V.D., Straßer, C.: Non-adjunctive deontic logics that validate aggregation as much as Possible. (Forthcoming)
Goble, L.: A logic for deontic dilemmas. J. Appl. Logic 3, 461–483 (2005)
Horty, J.F.: Nonmonotonic foundations for deontic logic. In: Nute, D. (ed.) Defeasible Deontic Logic, Studies in Epistemology, Logic, Methodology, and Philosophy of Science, vol 263, pp. 17–44. Kluwer (1997)
Chisholm, R.M.: Contrary-to-duty imperatives and deontic logic. Analysis 24, 33–36 (1963)
Forrester, J.: Gentle murder, or the adverbial samaritan. J. Philos. 81, 193–197 (1984)
Kraus, S., Lehmann, D.J., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artif. Intell. 44, 167–207 (1990)
Lehmann, D.J., Magidor, M.: What does a conditional knowledge base entail? Artif. Intell. 55(1), 1–60 (1992)
van Fraassen, B.C.: The logic of conditional obligation. J. Philos. Logic 1, 417–438 (1972)
Lewis, D.: Counterfactuals. Blackwell Publishers (2000)
Goble, L.: Preference semantics for deontic logic. Part I: Simple models. Logique et Analyse 183–184, 383–418 (2003)
Acknowledgments
I thank Joke Meheus, Mathieu Beirlaen, Frederik Van De Putte, and the anonymous referees of the Journal of Logical Philosophy for valueable comments which helped to improve the paper.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Straßer, C. (2014). An Adaptive Logic Framework for Conditional Obligations and Deontic Dilemmas. In: Adaptive Logics for Defeasible Reasoning. Trends in Logic, vol 38. Springer, Cham. https://doi.org/10.1007/978-3-319-00792-2_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-00792-2_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-00791-5
Online ISBN: 978-3-319-00792-2
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)