Permissions and Uncontrollable Propositions in DSDL3: Non-monotonicity and Algorithms. (bibtex)
by S. Kaci, L. van der Torre
Abstract:
In this paper we are interested in non-monotonic extensions of Bengt Hansson's standard dyadic deontic logic 3, known as DSDL3. We study specificity principles for DSDL3 with both controllable and uncontrollable propositions. We introduce an algorithm for minimal specificity which not only covers obligations but also permissions, and we discuss the distinction between weak and strong permissions. Moreover, we introduce ways to combine algorithms for minimal and maximal specificity for DSDL3 with controllable and uncontrollable propositions, based on 'optimistic' and 'pessimistic' reasoning respectively.
Reference:
Permissions and Uncontrollable Propositions in DSDL3: Non-monotonicity and Algorithms. (S. Kaci, L. van der Torre), In Deontic Logic and Artificial Normative Systems, 8th International Workshop on Deontic Logic in Computer Science, DEON 2006, Utrecht, The Netherlands, July 12-14, 2006, Proceedings (L. Goble, J.-J. Meyer, eds.), Springer, volume 4048, 2006.
Bibtex Entry:
@InProceedings{Kaci2006c,
  Title                    = {Permissions and Uncontrollable Propositions in {DSDL}3: Non-monotonicity and Algorithms.},
  Author                   = {S. Kaci and L. van der Torre},
  Booktitle                = {Deontic Logic and Artificial Normative Systems, 8th International Workshop on Deontic Logic in Computer Science, DEON 2006, Utrecht, The Netherlands, July 12-14, 2006, Proceedings},
  Year                     = {2006},
  Editor                   = {L. Goble and J.-J. Meyer},
  Publisher                = {Springer},
  Series                   = {Lecture Notes in Computer Science},
  Volume                   = {4048},

  Abstract                 = {In this paper we are interested in non-monotonic extensions of Bengt Hansson's standard dyadic deontic logic 3, known as DSDL3. We study specificity principles for DSDL3 with both controllable and uncontrollable propositions. We introduce an algorithm for minimal specificity which not only covers obligations but also permissions, and we discuss the distinction between weak and strong permissions. Moreover, we introduce ways to combine algorithms for minimal and maximal specificity for DSDL3 with controllable and uncontrollable propositions, based on 'optimistic' and 'pessimistic' reasoning respectively.},
  Affiliation              = {icr},
  Bdsk-url-1               = {http://icr.uni.lu/leonvandertorre/papers/deon06a.pdf},
  Bibsource                = {DBLP, http://dblp.uni-trier.de},
  ISBN                     = {3-540-35842-0},
  Timestamp                = {2013.07.26},
  Url                      = {http://icr.uni.lu/leonvandertorre/papers/deon06a.pdf}
}
Powered by bibtexbrowser