Modeling Contrary-to-Duty with CP-nets

03/23/2020
by   Roberta Calegari, et al.
4

In a ceteris-paribus semantics for deontic logic, a state of affairs where a larger set of prescriptions is respected is preferable to a state of affairs where some of them are violated. Conditional preference nets (CP-nets) are a compact formalism to express and analyse ceteris paribus preferences, which nice computational properties. This paper shows how deontic concepts can be captured through conditional preference models. A restricted deontic logic will be defined, and mapped into conditional preference nets. We shall also show how to model contrary to duties obligations in CP-nets and how to capture in this formalism the distinction between strong and weak permission.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/31/2013

Modèle flou d'expression des préférences basé sur les CP-Nets

This article addresses the problem of expressing preferences in flexible...
research
09/28/2011

On Graphical Modeling of Preference and Importance

In recent years, CP-nets have emerged as a useful tool for supporting pr...
research
04/24/2015

Logical Conditional Preference Theories

CP-nets represent the dominant existing framework for expressing qualita...
research
01/15/2014

The Computational Complexity of Dominance and Consistency in CP-Nets

We investigate the computational complexity of testing dominance and con...
research
06/26/2018

Complexity Results for Preference Aggregation over (m)CP-nets: Pareto and Majority Voting

Combinatorial preference aggregation has many applications in AI. Given ...
research
09/21/2021

Perpetual Free-choice Petri nets are lucent – proof of a theorem of van der Aalst using CP-exhaustions

Van der Aalst's theorem is an important result for the analysis and synt...
research
09/21/2021

Enriching a CP-Net by Asymmetric Merging

Conditional ceteris paribus preference networks (CP-nets) are commonly u...

Please sign up or login with your details

Forgot password? Click here to reset