Publication Type

Journal Article

Book Title/Conference/Journal

Journal of Logic and Computation

Year

9-2023

Abstract

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, Computing defeasible meta-logic. In JELIA 2021, LNCS, vol. 12678, pp. 69-84. Springer.). 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 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 (DDL) with meta-rules to represent (i) defeasible meta-theories with deontic modalities and (ii) two different types of conflicts among rules: Simple Conflict DDL and Cautious Conflict DDL. Second, we advance efficient algorithms to compute the extensions for both variants.

Keywords

Defeasible logic, principles, intentions, semantics, language, systems

Disciplines

Computer Law | Logic and Foundations of Mathematics

Subject(s)

Basic or Discovery Scholarship

ISSN/ISBN

0955-792X

Publisher

Oxford University Press (OUP)

DOI

10.1093/logcom/exac081

Version

acceptedVersion

Language

eng

Copyright Holder

Authors

Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.

Format

application/PDF

Additional URL

https://doi.org/10.1093/logcom/exac081

Download

Share

COinS