Permissions and uncontrollable propositions in DSDL3: non-monotonicity and algorithms

Authors:
Souhila Kaci;Leendert van der Torre
Affiliations:
Centre de Recherche en Informatique de Lens (C.R.I.L.)–C.N.R.S, France;University of Luxembourg
Venue:
DEON'06 Proceedings of the 8th international conference on Deontic Logic and Artificial Normative Systems
Year:
2006

Citing 13
Cited 0

Nonmonotonic reasoning, preferential models and cumulative logics

Artificial Intelligence
What does a conditional knowledge base entail?

Artificial Intelligence
Conditional logics of normality: a modal approach

Artificial Intelligence
Contrary-to-duty reasoning with preference-based dyadic obligations

Annals of Mathematics and Artificial Intelligence
Towards a Possibilistic Logic Handling of Preferences

Applied Intelligence
A Note on the Rational Closure of Knowledge Bases with Both Positive and Negative Knowledge

Journal of Logic, Language and Information
Utilitarian Desires

Autonomous Agents and Multi-Agent Systems
Deriving individual obligations from collective obligations

AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
Desires, Norms and Constraints

AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
System Z: a natural ordering of defaults with tractable applications to nonmonotonic reasoning

TARK '90 Proceedings of the 3rd conference on Theoretical aspects of reasoning about knowledge
Nonmonotonic logics: meaning and utility

IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 1
On the logic of cooperation and propositional control

Artificial Intelligence
Algorithms for a nonmonotonic logic of preferences

ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we are interested in non-monotonic extensions of Bengt Hansson's standard dyadic deontic logic 3, known as DSDL3. We study specificity principles for DSDL3 with both controllable and uncontrollable propositions. We introduce an algorithm for minimal specificity which not only covers obligations but also permissions, and we discuss the distinction between weak and strong permissions. Moreover, we introduce ways to combine algorithms for minimal and maximal specificity for DSDL3 with controllable and uncontrollable propositions, based on ‘optimistic' and ‘pessimistic' reasoning respectively.