A Defeasible Deontic Calculus for Resolving Norm Conflicts

Taylor Olson, Roberto Salas-Damian, Kenneth D. Forbus
7/5/2024
cs.AI

No confident code implementation found for this paper.

Abstract

When deciding how to act, we must consider other agents' norms and values. However, our norms are ever-evolving. We often add exceptions or change our minds, and thus norms can conflict over time. Therefore, to maintain an accurate mental model of other's norms, and thus to avoid social friction, such conflicts must be detected and resolved quickly. Formalizing this process has been the focus of various deontic logics and normative multi-agent systems. We aim to bridge the gap between these two fields here. We contribute a defeasible deontic calculus with inheritance and prove that it resolves norm conflicts. Through this analysis, we also reveal a common resolution strategy as a red herring. This paper thus contributes a theoretically justified axiomatization of norm conflict detection and resolution.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{olson2024defeasible,
  title  = {A Defeasible Deontic Calculus for Resolving Norm Conflicts},
  author = {Taylor Olson and Roberto Salas-Damian and Kenneth D. Forbus},
  year   = {2024},
  eprint = {2407.04869},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2407.04869v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2407.04869.svg)](https://codeofpaper.com/paper/2407.04869)

Discussion