๐ฎ
๐ฎ
The Ethereal
Is Free Choice Permission Admissible in Classical Deontic Logic?
May 19, 2019 ยท The Ethereal ยท ๐ International Workshop on Deontic Logic in Computer Science
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Guido Governatori, Antonino Rotolo
arXiv ID
1905.07696
Category
cs.LO: Logic in CS
Cross-listed
cs.AI,
cs.MA
Citations
4
Venue
International Workshop on Deontic Logic in Computer Science
Last Checked
5 months ago
Abstract
In this paper, we explore how, and if, free choice permission (FCP) can be accepted when we consider deontic conflicts between certain types of permissions and obligations. As is well known, FCP can license, under some minimal conditions, the derivation of an indefinite number of permissions. We discuss this and other drawbacks and present six Hilbert-style classical deontic systems admitting a guarded version of FCP. The systems that we present are not too weak from the inferential viewpoint, as far as permission is concerned, and do not commit to weakening any specific logic for obligations.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
๐ Similar Papers
In the same crypt โ Logic in CS
๐ฎ
๐ฎ
The Ethereal
Safe Reinforcement Learning via Shielding
๐ฎ
๐ฎ
The Ethereal
Formal Verification of Piece-Wise Linear Feed-Forward Neural Networks
๐ฎ
๐ฎ
The Ethereal
Heterogeneous substitution systems revisited
๐ฎ
๐ฎ
The Ethereal
Omega-Regular Objectives in Model-Free Reinforcement Learning
๐ฎ
๐ฎ
The Ethereal