In this paper we define a framework to introduce gradedness in Deontic logics through the use of fuzzy modalities. By way of example, we instantiate the framework to Standard Deontic logic (SDL) formulas. Given a deontic formula Φ ∈ SDL, our language contains formulas of the form r → NΦ or r → PΦ, where r ∈ [0, 1], expressing that the preference or probability degree respectively of a norm Φ is at least r. We present sound and complete axiomatisations for these logics.
|Title of host publication||Deontic Logic in Computer Science - 9th International Conference, DEON 2008, Proceedings|
|Number of pages||15|
|Publication status||Published - 2008|
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
- Deontic Logic
- Fuzzy Logic