Computing Strong and Weak Permissions in Defeasible Logic
MetadataShow full item record
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.
Journal of Philosophical Logic
© 2013 Springer Netherlands. This is an electronic version of an article published in Journal of Philosophical Logic, Volume 42, Issue 6, pp 799–829, 2013. Journal of Philosophical Logic is available online at: http://link.springer.com/ with the open URL of your article.
Computational Logic and Formal Languages