On the Strong Completeness of Åqvist's Dyadic Deontic Logic G

Authors:
Xavier Parent
Affiliations:
, Toulon, France 83100
Venue:
DEON '08 Proceedings of the 9th international conference on Deontic Logic in Computer Science
Year:
2008

Citing 8
Cited 1

General theory of cumulative inference

Proceedings of the 2nd international workshop on Non-monotonic reasoning
Nonmonotonic reasoning, preferential models and cumulative logics

Artificial Intelligence
What does a conditional knowledge base entail?

Artificial Intelligence
Unifying default reasoning and belief revision in a modal framework

Artificial Intelligence
General patterns in nonmonotonic reasoning

Handbook of logic in artificial intelligence and logic programming (vol. 3)
Modal logic

Modal logic
Contrary-to-duty reasoning with preference-based dyadic obligations

Annals of Mathematics and Artificial Intelligence
Defeasible Deontic Logic

Defeasible Deontic Logic

Contrary-To-Duties in games

Logic Programs, Norms and Action

Quantified Score

Hi-index	0.00

Visualization

Abstract

Åqvist's dyadic deontic logic G, which aims at providing an axiomatic characterization of Hansson's seminal system DSDL3 for conditional obligation, is shown to be strongly complete with respect to its intended modelling.