Computing Strong and Weak Permissions in Defeasible Logic

12/01/2012
by   Guido Governatori, et al.
0

In this paper we propose an extension of Defeasible Logic to represent and compute three concepts of defeasible permission. In particular, we discuss different types of explicit permissive norms that work as exceptions to opposite obligations. Moreover, we show how strong permissions can be represented both with, and without introducing a new consequence relation for inferring conclusions from explicit permissive norms. Finally, we illustrate how a preference operator applicable to contrary-to-duty obligations can be combined with a new operator representing ordered sequences of strong permissions which derogate from prohibitions. The logical system is studied from a computational standpoint and is shown to have liner computational complexity.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

04/07/2014

Thou Shalt is not You Will

In this paper we discuss some reasons why temporal logic might not be su...
11/22/2010

A Logical Charaterisation of Ordered Disjunction

In this paper we consider a logical treatment for the ordered disjunctio...
03/27/2013

Probability as a Modal Operator

This paper argues for a modal view of probability. The syntax and semant...
10/06/2018

System Consequence

This paper discusses system consequence, a central idea in the project t...
07/26/2019

Revisiting Explicit Negation in Answer Set Programming

A common feature in Answer Set Programming is the use of a second negati...
09/06/2017

Normative Multi-Agent Systems and Kelsenian Jurisprudence

A multi-agent system (MAS) is a collection of autonomous entities, calle...
01/20/2018

Knowledge Representation for High-Level Norms and Violation Inference in Logic Programming

Most of the knowledge Representation formalisms developed for representi...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.