[en] In the present work we illustrate how two sorts of defeasiblereasoning that are fundamental in the normative domain, that is, reasoning about exceptions and reasoning about violations, can be simulated via monotonic propositional theories based on a bimodal language with primitive operators representing knowledge and obligation. The proposed theoretical framework paves the way to using native theorem provers for multimodal logic, such as MleanCoP, in order to automate normative reasoning.
Disciplines :
Sciences informatiques
Auteur, co-auteur :
LIBAL, Tomer ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
VAN DER TORRE, Leon ; University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS)
GABBAY, Dov M. ; University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
Pascucci, Matteo; Central European University
Co-auteurs externes :
yes
Langue du document :
Anglais
Titre :
A bimodal simulation of defeasibility in thenormative domain
