Superiority Based Revision of Defeasible Theories

We propose a systematic investigation on how to modify a preference relation in a defeasible logic theory to change the conclusions of the theory itself. We argue that the approach we adopt is applicable to legal reasoning, where users, in general, cannot change facts and rules, but can propose their preferences about the relative strength of the rules. We provide a comprehensive study of the possible combinatorial cases and we identify and analyse the cases where the revision process is successful.

• Type: Journal
• Year: 2010
• Where: RULEML
• Authors: Guido Governatori, Francesco Olivieri, Simone Scannapieco, Matteo Cristani
• Keywords: Defeasible Logic Theory, Internet Technology, Possible Combinatorial Cases, Preference Relation, RULEML 2010