A deontic argumentation framework based on deontic defeasible logic

Abstract

Deontic Defeasible Logic (DDL) is a simple and computationally efficient approach for the representation of normative reasoning. Traditionally defeasible logics are defined proof theoretically based on the proof conditions for the logic. In this paper we present an argumentation system that corresponds to a variant of DDL. The resulting machinery is able to grasp in a natural way intuitions behind deontic reasoning with conditional norms featuring obligations, prohibitions, and (strong or weak) permissions.