We present a formal semantics for deontic logic based on the concept of ceteris paribus preferences. We introduce notions of unconditional obligation and permission as well as conditional obligation and permission that are interpreted relative to this semantics. We show that these notions satisfy some intuitive properties and, at the same time, do not encounter some problems and paradoxes that have been extensively discussed in the deontic logic literature. We prove that the satisfiability problem for our logic is in NP. Finally, we show that the fragment of our logic in which the content of a deontic operator is a literal has an equivalent representation based on conditional preference networks (CP-nets).
Loreggia, A., Lorini, E., Sartor, G. (2022). Modelling Ceteris Paribus Preferences with Deontic Logic. JOURNAL OF LOGIC AND COMPUTATION, 32(2), 347-368 [10.1093/logcom/exab088].
Modelling Ceteris Paribus Preferences with Deontic Logic
Loreggia, Andrea;Lorini, Emiliano;Sartor, Giovanni
2022
Abstract
We present a formal semantics for deontic logic based on the concept of ceteris paribus preferences. We introduce notions of unconditional obligation and permission as well as conditional obligation and permission that are interpreted relative to this semantics. We show that these notions satisfy some intuitive properties and, at the same time, do not encounter some problems and paradoxes that have been extensively discussed in the deontic logic literature. We prove that the satisfiability problem for our logic is in NP. Finally, we show that the fragment of our logic in which the content of a deontic operator is a literal has an equivalent representation based on conditional preference networks (CP-nets).File | Dimensione | Formato | |
---|---|---|---|
JOURNAL_CILC_CP_deontic_logic .pdf
Open Access dal 21/02/2023
Tipo:
Postprint
Licenza:
Licenza per Accesso Aperto. Creative Commons Attribuzione (CCBY)
Dimensione
520.7 kB
Formato
Adobe PDF
|
520.7 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.