DMCA
Computing Strong and Weak Permissions in Defeasible Logic (2013)
| Citations: | 9 - 6 self |
BibTeX
@MISC{Governatori13computingstrong,
author = {Guido Governatori and Francesco Olivieri and Antonino Rotolo and Simone Scannapieco},
title = {Computing Strong and Weak Permissions in Defeasible Logic},
year = {2013}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper we propose an extension of Defeasible Logic to represent and compute different concepts of defeasible permission. In particular, we discuss some types of explicit permissive norms that work as exceptions to opposite obligations or encode permissive rights. Moreover, we show how strong permissions can be represented both with, and without introducing a new consequence relation for inferring conclusions from explicit permissive norms. Finally, we illustrate how a preference operator applicable to contrary-to-duty obligations can be combined with a new operator representing ordered sequences of strong permissions. The logical system is studied from a computational standpoint and is shown to have linear computational complexity.
Keyphrases
defeasible logic weak permission strong permission explicit permissive norm linear computational complexity different concept defeasible permission preference operator new operator new consequence relation computational standpoint contrary-to-duty obligation permissive right logical system
