2015
DOI: 10.1007/978-3-662-48561-3_38
|View full text |Cite
|
Sign up to set email alerts
|

On the Complexity of Input/Output Logic

Abstract: Abstract. The complexity of input/output logic has been sparsely developed. In this paper we study the complexity of four existing input/output logics. We show that the lower bound of the complexity of the fulfillment problem of these input/output logics is coNP, while the upper bound is either coNP, or P N P .

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2017
2017

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 11 publications
0
1
0
Order By: Relevance
“…Norm-based semantics has been proposed as an alternative to deontic frameworks based on possible-world semantics, such as STIT logic [20] and dynamic deontic logic [27]. It has been argued that norm-based semantics provides: (1) a more flexible handling of the well-known Jørgensen's dilemma [22], stating that, contrary to declarative statements, norms do not corresponds to truth values, i.e., they cannot be described as true or false; (2) a straightforward and simple way to deal with moral conflicts and different kinds of permissions (see [29,25] to see how to deal with these in input/output logic); (3) a simpler and easy-to-control complexity; it has been argued [39] that compliance checking in Input/Output logic are coNP/NP hard and in the second level of the polynomial hierarchy, while STIT and dynamic deontic logic are respectively undecidable and EXPTIME-complete.…”
Section: Reification and Input/output Logicmentioning
confidence: 99%
“…Norm-based semantics has been proposed as an alternative to deontic frameworks based on possible-world semantics, such as STIT logic [20] and dynamic deontic logic [27]. It has been argued that norm-based semantics provides: (1) a more flexible handling of the well-known Jørgensen's dilemma [22], stating that, contrary to declarative statements, norms do not corresponds to truth values, i.e., they cannot be described as true or false; (2) a straightforward and simple way to deal with moral conflicts and different kinds of permissions (see [29,25] to see how to deal with these in input/output logic); (3) a simpler and easy-to-control complexity; it has been argued [39] that compliance checking in Input/Output logic are coNP/NP hard and in the second level of the polynomial hierarchy, while STIT and dynamic deontic logic are respectively undecidable and EXPTIME-complete.…”
Section: Reification and Input/output Logicmentioning
confidence: 99%