Published on Mon Mar 23 2020

Modeling Contrary-to-Duty with CP-nets

Roberta Calegari, Andrea Loreggia, Emiliano Lorini, Francesca Rossi, Giovanni Sartor

Conditional preference nets (CP-nets) are a compact formalism to express and analyse ceteris paribus preferences. This paper shows how deontic concepts can be captured through conditional preference models.

0
0
0
Abstract

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.

Fri Apr 24 2015
Artificial Intelligence
Logical Conditional Preference Theories
CP-nets represent the dominant existing framework for expressing qualitative preferences between alternatives. To express preferences, the user specifies arbitrary (constraint) programs over a binary ordering relation on outcomes. We show how LCP theories unify and generalize existing conditional preference proposals.
0
0
0
Sat Dec 01 2012
Artificial Intelligence
Computing Strong and Weak Permissions in Defeasible Logic
In this paper we propose an extension of Defeasible Logic to represent and compute three concepts of defeasible permission. We discuss different types of explicit permissive norms that work as exceptions to opposite obligations. We show how strong permissions can be represented both with, and without introducing a new consequence
0
0
0
Sun May 19 2019
Artificial Intelligence
Is Free Choice Permission Admissible in Classical Deontic Logic?
Free choice permission (FCP) can license, under some minimal conditions, the derivation of an indefinite number of permissions. The systems that we present are not too weak from the inferential viewpoint, as far as permission is concerned. We do not commit to weakening any specific logic for obligations.
0
0
0
Fri Dec 20 2013
Artificial Intelligence
Negation in the Head of CP-logic Rules
CP-logic is a probabilistic extension of the logic FO(ID) Unlike ASP, both adhere to a Tarskian informal semantics, in which interpretations represent objective states-of-affairs.
0
0
0
Wed Oct 11 2017
Artificial Intelligence
Counterfactual Conditionals in Quantified Modal Logic
Counterfactual conditionals play a vital role in ethical and moral reasoning. We present a novel formalization of counterfactual conditionals in aquantified modal logic. We validate our model with two projects.
0
0
0
Wed Jun 01 2016
Artificial Intelligence
A structured argumentation framework for detaching conditional obligations
We present a general formal argumentation system for dealing with the detachment of conditional obligations. We answer the question whether an unconditional obligation is detachable by considering reasons for and against its detachment. We illustrate the modularity of the general framework by considering some extensions.
0
0
0