Computing Strong and Weak Permissions in Defeasible Logic
Computing Strong and Weak Permissions in Defeasible Logic
复制标题
以可失效逻辑计算强权限和弱权限
DOI：
--
复制
发表时间：
2012
影响因子：
1.5
通讯作者：
Simone Scannapieco
中科院分区：
文献类型：
--
作者：
Guido Governatori;Francesco Olivieri;A. Rotolo;Simone Scannapieco
在本文中，我们提出了一个扩展的可废止逻辑表示和计算不同的概念的可废止许可。特别是，我们讨论了一些类型的明确的许可规范，作为例外，相反的义务或编码许可的权利。此外，我们展示了如何强许可可以表示，并没有引入一个新的推论关系，从明确的许可规范的结论。最后，我们说明了如何适用于相反的义务的偏好操作符可以与一个新的操作符表示强许可的有序序列相结合。从计算的角度研究的逻辑系统，并示出具有线性的计算复杂性。
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.