On the complexity of input/output logic
From MaRDI portal
Publication:1688711
DOI10.1016/j.jal.2017.03.002zbMath1436.03142OpenAlexW2593005162MaRDI QIDQ1688711
Publication date: 11 January 2018
Published in: Journal of Applied Logic (Search for Journal in Brave)
Full work available at URL: http://orbilu.uni.lu/handle/10993/23949
Modal logic (including the logic of norms) (03B45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
From input/output logics to conditional logics via sequents -- with provers ⋮ On the complexity of input/output logic ⋮ Formalizing GDPR provisions in reified I/O logic: the DAPRECO knowledge base
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adaptive logic characterizations of input/output logic
- Adaptive logics using the minimal abnormality strategy are \(\Pi^1_1\)-complex
- A universal logic approach to adaptive logics
- A different approach to deontic logic: Deontic logic viewed as a variant of dynamic logic
- A theory of permission based on the notion of derogation
- Interpretation and inference with maximal referential terms
- A near-optimal method for reasoning about action
- Propositional dynamic logic of regular programs
- Permission from an input/output perspective
- Input/output logics
- On the complexity of input/output logic
- Conflict-driven answer set solving: from theory to practice
- The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
- On the identification of quantifiers' witness sets: a study of multi-quantifier sentences
- Computing strong and weak permissions in defeasible logic
- “Sing and Dance!”
- How to Build Input/Output Logic
- Normative Consequence: The Problem of Keeping It Whilst Giving It up
- The dynamic logic of permission
- Reasoning About Permission and Obligation
- Reasoning with Moral Conflicts
- Computational Complexity
- Constraints for input/output logics
This page was built for publication: On the complexity of input/output logic
