2010
DOI: 10.1016/j.jal.2010.01.001
|View full text |Cite
|
Sign up to set email alerts
|

A theory of permission based on the notion of derogation

Abstract: This paper presents a unifying theory of permission that integrates the concept of negative permission with three concepts of positive permission, namely explicit permission, exemption and antithetic permission. The concepts are defined and logically related by paying particular attention to the system of which they form part. A simple procedure for calculating the permitted actions that can be said to be implicit in a code of norms or a policy specification is then given.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
29
0

Year Published

2014
2014
2019
2019

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 40 publications
(29 citation statements)
references
References 20 publications
0
29
0
Order By: Relevance
“…For instance, PO-Spec models permission as derogation (Stolpe, 2010): a permission may suspend a more general obligation.…”
Section: Attacks Incorporating Modalitiesmentioning
confidence: 99%
“…For instance, PO-Spec models permission as derogation (Stolpe, 2010): a permission may suspend a more general obligation.…”
Section: Attacks Incorporating Modalitiesmentioning
confidence: 99%
“…In our example above, this would lead to the derivability of the permission ¬out¬s detached at line 7 in the proof, whereas the obligation out¬s at line 6 is not derivable. Prioritizing permissions in this way gives us a concept that is similar to Stolpe's notion of 'permission as derogation' [43]. We return to this point in Section 5.3 where we discuss prioritized norms.…”
Section: Permissions By Defaultmentioning
confidence: 98%
“…The reason why the original (constrained) I/O functions are suboptimal for the explication of defeasible reasoning in this context is due to the undecidability of predicate logic: there is no effective way to perform the consistency check that is necessary to calculate the maxfamilies. 43 The dynamic proof theory of ALs comes in handy since it doesn't force us to make consistency checks 'on the spot'. Instead, we can defeasibly assume that a set of conditionals is consistent.…”
Section: Prioritiesmentioning
confidence: 99%
See 2 more Smart Citations