A Mechanism for Reasoning over Defeasible Preferences in Arg2P

This paper introduces argumentation over preferences in Arg-tuProlog, a light-weight argumentation framework based on logic programming. First, a computational mechanism is implemented in Arg-tuProlog according to the defeasible preference model introduced by Dung. Then, the computational mechanism is generalised so as to enable the exploitation of an arbitrary preference relation over arguments. Running examples are presented and discussed.