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.

本文针对行为规范方面，将 Meta rules 适用于可撤销逻辑中，提出了两个变体的 Defeasible Deontic Logic，并针对这两个变体提出了高效的算法，此方法可适用于法规和信息技术领域。

伦理元规则

Deontic Meta-Rules

This paper presents an extension of Defeasible Deontic Logic to deal with the
Pragmatic Oddity problem. The logic applies three general principles: (1) the
Pragmatic Oddity problem must be solved within a general logical treatment of
CTD reasoning; (2) non-monotonic methods must be adopted to handle CTD
reasoning; (3) logical models of CTD reasoning must be computationally feasible
and, if possible, efficient. The proposed extension of Defeasible Deontic Logic
elaborates a preliminary version of the model proposed by Governatori and
Rotolo (2019). The previous solution was based on particular characteristics of
the (constructive, top-down) proof theory of the logic. However, that method
introduces some degree of non-determinism. To avoid the problem, we provide a
bottom-up characterisation of the logic. The new characterisation offers
insights for the efficient implementation of the logic and allows us to
establish the computational complexity of the problem.

本文扩展了反驳性德欧派逻辑，以解决实用奇异性问题，并采用非单调方法处理 CTD 推理，构建逻辑模型具有计算可行性和效率，提供了对逻辑的高效实现及计算复杂度的解决方案。