peer reviewedInput/output logics are abstract structures designed to represent conditional norms. The complexity of input/output logic has been sparsely developed. In this paper we study the complexity of input/output logics. We show that the lower bound of the complexity of the fulfillment problem of 4 input/output logics is coNP, while the upper bound is either coNP or P^NP
peer reviewedInput/Output (I/O) logics address the abstract study of conditional norms. Here, norms ...
We translate unconstrained and constrained input/output logics as introduced by Makinson and van der...
A definition of complexity based on logic functions, which are widely used as compact descriptions o...
Input/output logics are abstract structures designed to represent conditional norms. The complexity ...
peer reviewedThis paper reports a correspondence between input/output logic and the theory of joinin...
We explain the {em raison d\u27^etre} and basic ideas of input/output logic, sketching the central e...
AbstractWe investigate the complexity of derivations from logic programs, and find it closely relate...
If computational complexity is the study of what makes certain computational problems inherently dif...
peer reviewedMakinson and van der Torre [13] introduce a number of input/output (I/O) logics to reas...
International audienceWe consider logic-based argumentation in which an argument is a pair (Phi, alp...
Bounds for the computational complexity of major justification logics were found in papers by Buss, ...
The most celebrated open problem in theoretical computer science is, undoubtedly, the problem of whe...
Makinson and van der Torre [14] introduce a number of in- put/output (I/O) logics to reason about co...
AbstractThe central research question of this paper is how notions developed in interactive computin...
We establish a general connection between fixpoint logic and complexity. On one side, we have fixpoi...
peer reviewedInput/Output (I/O) logics address the abstract study of conditional norms. Here, norms ...
We translate unconstrained and constrained input/output logics as introduced by Makinson and van der...
A definition of complexity based on logic functions, which are widely used as compact descriptions o...
Input/output logics are abstract structures designed to represent conditional norms. The complexity ...
peer reviewedThis paper reports a correspondence between input/output logic and the theory of joinin...
We explain the {em raison d\u27^etre} and basic ideas of input/output logic, sketching the central e...
AbstractWe investigate the complexity of derivations from logic programs, and find it closely relate...
If computational complexity is the study of what makes certain computational problems inherently dif...
peer reviewedMakinson and van der Torre [13] introduce a number of input/output (I/O) logics to reas...
International audienceWe consider logic-based argumentation in which an argument is a pair (Phi, alp...
Bounds for the computational complexity of major justification logics were found in papers by Buss, ...
The most celebrated open problem in theoretical computer science is, undoubtedly, the problem of whe...
Makinson and van der Torre [14] introduce a number of in- put/output (I/O) logics to reason about co...
AbstractThe central research question of this paper is how notions developed in interactive computin...
We establish a general connection between fixpoint logic and complexity. On one side, we have fixpoi...
peer reviewedInput/Output (I/O) logics address the abstract study of conditional norms. Here, norms ...
We translate unconstrained and constrained input/output logics as introduced by Makinson and van der...
A definition of complexity based on logic functions, which are widely used as compact descriptions o...
DOI
Add to ORKG