论文标题
道元符号
Deontic Meta-Rules
论文作者
论文摘要
在逻辑中使用元规则的使用，即其内容包含其他规则的规则，最近在非单调推理的设置中引起了人们的关注：在Olivieri等人（2021）中提出了（元）扩展此类理论的第一个逻辑形式化和有效的算法（2021年），该工作扩展了此类formitigal框架，通过考虑Deontic的构图来扩展这种现实框架。由此产生的逻辑不仅能够建模政策，还可以解决许多法律体系中发生的知名方面。已经研究了我们刚才提到的应用区域中使用不良逻辑（DL）对元符号建模的使用。在这一研究中，上面提到的研究并不关注元符号的一般计算特性。 这项研究以两个主要贡献填补了这一空白。首先，我们介绍并形式化了两个具有元符号的可d不脱节的悬浮逻辑的变体，以表示（1）具有能态模态的可性元理论，以及（2）规则之间的两种不同类型的冲突：简单的冲突不良的义义逻辑，谨慎的冲突冲突和谨慎的冲突不足。其次，我们推进有效算法以计算两个变体的扩展。
The use of meta-rules in logic, i.e., rules whose content includes other rules, has recently gained attention in the setting of non-monotonic reasoning: a first logical formalisation and efficient algorithms to compute the (meta)-extensions of such theories were proposed in Olivieri et al (2021) This work extends such a logical framework by considering the deontic aspect. The resulting logic will not just be able to model policies but also tackle well-known aspects that occur in numerous legal systems. The use of Defeasible Logic (DL) to model meta-rules in the application area we just alluded to has been investigated. Within this line of research, the study mentioned above was not focusing on the general computational properties of meta-rules. This study fills this gap with two major contributions. First, we introduce and formalise two variants of Defeasible Deontic Logic with Meta-Rules to represent (1) defeasible meta-theories with deontic modalities, and (2) two different types of conflicts among rules: Simple Conflict Defeasible Deontic Logic, and Cautious Conflict Defeasible Deontic Logic. Second, we advance efficient algorithms to compute the extensions for both variants.
