Computational Complexity of Input/Output Logic

Sun, Xin; Ambrossio, Diego Agustin

doi:10.1007/978-3-319-26181-2_7

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2018

Publication Types

Select...

Article1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the existing norm-based deontic logics, the computational complexity of input/output logic and deontic defeasible logic is studied in [27,26]. In this paper, we study the complexity of imperative logic and deontic default logic (Sections 3 and 5.1).…”

Section: Introductionmentioning

confidence: 99%

Norm-based deontic logic for access control, some computational results

Sun

Zhao²,

Robaldo

2018

Future Generation Computer Systems

Self Cite

View full text Add to dashboard Cite

a b s t r a c tIn this paper we study the complexity of deontic logics grounded on norm-based semantics and apply norm-based deontic logic to access control. Four principal norm-based deontic logics have been proposed so far: imperative logic, input/output logic, deontic default logic and deontic defeasible logic. We present the readers that imperative logic is complete for the 2ed level of the polynomial hierarchy and deontic default logic is located in the 3ed level of the polynomial hierarchy. We then show how it is possible to impose restrictions to imperative logic such that the complexity goes down to be tractable, allowing the logic to be used in practical applications. We focus on a specific application: access control.

show abstract

Section: Introductionmentioning

confidence: 99%