A Mechanism for Reasoning over Defeasible Preferences in Arg2P

   Info_icon.svg   data    BibTeX_logo.svg   bibtex

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.

hosting event
reference publication
funding project
Project_icon.svg CompuLaw — Computable Law (01/11/2019–31/10/2025)
Project_icon.svg StairwAI — Stairway to AI: Ease the Engagement of Low-Tech users to the AI-on-Demand platform through AI (01/01/2021–31/12/2023)
related product
works as
reference talk for

cover