Computing strong and weak permissions in defeasible logic
From MaRDI portal
Publication:2441477
DOI10.1007/s10992-013-9295-1zbMath1286.03058DBLPjournals/jphil/GovernatoriORS13arXiv1212.0079OpenAlexW3106418261WikidataQ58176752 ScholiaQ58176752MaRDI QIDQ2441477
Antonino Rotolo, Guido Governatori, Simone Scannapieco, Francesco Olivieri
Publication date: 24 March 2014
Published in: Journal of Philosophical Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.0079
Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45)
Related Items (12)
A Decidable Multi-agent Logic for Reasoning About Actions, Instruments, and Norms ⋮ On the complexity of input/output logic ⋮ The rationale behind the concept of goal ⋮ Modal Rules: Extending Defeasible Logic with Modal Operators ⋮ Law and logic: a review from an argumentation perspective ⋮ Practical Normative Reasoning with Defeasible Deontic Logic ⋮ Computing strong and weak permissions in defeasible logic ⋮ Formalizing GDPR provisions in reified I/O logic: the DAPRECO knowledge base ⋮ Open Reading and Free Choice Permission: A Perspective in Substructural Logics ⋮ Rethinking Defeasible Reasoning: A Scalable Approach ⋮ Computing defeasible meta-logic ⋮ A normative supervisor for reinforcement learning agents
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- DELORES
- A theory of permission based on the notion of derogation
- Permission from an input/output perspective
- Input/output logics
- Computing strong and weak permissions in defeasible logic
- Conditional obligation and positive permission for agents in time
- What Are the Necessity Rules in Defeasible Reasoning?
- Justice Delayed Is Justice Denied: Logics for a Temporal Account of Reparations and Legal Compliance
- Possible World Semantics for Defeasible Deontic Logic
- Representation results for defeasible logic
- A defeasible logic for modelling policy-based intentions and motivational attitudes
- Propositional defeasible logic has linear complexity
- Relevance, Derogation and Permission
This page was built for publication: Computing strong and weak permissions in defeasible logic