Affiliations: [a] University of Brescia - Brescia, Italy
| [b] University of Bologna - Bologna, Italy
| [c] IRIT, CNRS, Toulouse University - France
| [d] IBM Research - Yorktown Heights, NY, USA
| [e] European University Institute - Florence, Italy
Correspondence:
[*]
Corresponding author: Andrea Loreggia, University of Brescia - Brescia, Italy. E-mail: andrea.loreggia@unibs.it.
Abstract: Preferences are ubiquitous in our everyday life. They are essential in the decision making process of individuals. Recently, they have also been employed to represent ethical principles, normative systems or guidelines. In this work we focus on a ceteris paribus semantics for deontic logic: a state of affairs where a larger set of respected prescriptions is preferable to a state of affairs where some are violated. Conditional preference networks (CP-nets) are a compact formalism to express and analyse ceteris paribus preferences, with some desirable computational properties. In this paper, we show how deontic concepts (such as contrary-to-duty obligations) can be modeled with generalized CP-nets (GCP-nets) and how to capture the distinction between strong and weak permission in this formalism. To do that, we leverage on an existing restricted deontic logic that will be mapped into conditional preference nets.
