Advanced search
1 file | 277.80 KB

Avoiding deontic explosion by contextually restricting aggregation

Joke Meheus (UGent) , Mathieu Beirlaen (UGent) and Frederik Van De Putte (UGent)
Author
Organization
Abstract
In this paper, we present an adaptive logic for deontic conflicts, called P2.1(r), that is based on Goble's logic SDLaPe-a bimodal extension of Goble's logic P that invalidates aggregation for all prima facie obligations. The logic P2.1(r) has several advantages with respect to SDLaPe. 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 SDLaPe. The logic 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.
Keywords
defeasible deontic reasoning, adaptive logic, deontic explosion, non-adjunctive deontic logic, Conflict-tolerant deontic logic, LOGIC, MORAL DILEMMAS

Downloads

  • adecra-llncs open.pdf
    • full text
    • |
    • open access
    • |
    • PDF
    • |
    • 277.80 KB

Citation

Please use this url to cite or link to this publication:

Chicago
Meheus, Joke, Mathieu Beirlaen, and Frederik Van De Putte. 2010. “Avoiding Deontic Explosion by Contextually Restricting Aggregation.” In Deontic Logic in Computer Science, ed. Guido Governatori and Giovanni Sartor, 6181:148–165. Berlin, Germany: Springer.
APA
Meheus, J., Beirlaen, M., & Van De Putte, F. (2010). Avoiding deontic explosion by contextually restricting aggregation. In G. Governatori & G. Sartor (Eds.), DEONTIC LOGIC IN COMPUTER SCIENCE (Vol. 6181, pp. 148–165). Presented at the 10th International conference on Deontic Logic in Computer Science, Berlin, Germany: Springer.
Vancouver
1.
Meheus J, Beirlaen M, Van De Putte F. Avoiding deontic explosion by contextually restricting aggregation. In: Governatori G, Sartor G, editors. DEONTIC LOGIC IN COMPUTER SCIENCE. Berlin, Germany: Springer; 2010. p. 148–65.
MLA
Meheus, Joke, Mathieu Beirlaen, and Frederik Van De Putte. “Avoiding Deontic Explosion by Contextually Restricting Aggregation.” Deontic Logic in Computer Science. Ed. Guido Governatori & Giovanni Sartor. Vol. 6181. Berlin, Germany: Springer, 2010. 148–165. Print.
@inproceedings{1854791,
  abstract     = {In this paper, we present an adaptive logic for deontic conflicts, called P2.1(r), that is based on Goble's logic SDLaPe-a bimodal extension of Goble's logic P that invalidates aggregation for all prima facie obligations. The logic P2.1(r) has several advantages with respect to SDLaPe. For consistent sets of obligations it yields the same results as Standard Deontic Logic and for inconsistent sets of obligations, it validates aggregation {\textacutedbl}as much as possible{\textacutedbl}. It thus leads to a richer consequence set than SDLaPe. The logic 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.},
  author       = {Meheus, Joke and Beirlaen, Mathieu and Van De Putte, Frederik},
  booktitle    = {DEONTIC LOGIC IN COMPUTER SCIENCE},
  editor       = {Governatori , Guido and Sartor, Giovanni},
  isbn         = {9783642141829},
  issn         = {0302-9743},
  keyword      = {defeasible deontic reasoning,adaptive logic,deontic explosion,non-adjunctive deontic logic,Conflict-tolerant deontic logic,LOGIC,MORAL DILEMMAS},
  language     = {eng},
  location     = {Fiesole, Italy},
  pages        = {148--165},
  publisher    = {Springer},
  title        = {Avoiding deontic explosion by contextually restricting aggregation},
  url          = {http://dx.doi.org/10.1007/978-3-642-14183-6\_12},
  volume       = {6181},
  year         = {2010},
}

Altmetric
View in Altmetric
Web of Science
Times cited: