Skip to Content

A Mechanism for Reasoning over Defeasible Preferences in Arg2P

   Info_icon.svg       BibTeX_logo.svg   
Giuseppe Pisano

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
Event_icon.svg CILC 2021
reference publication
Publication_icon.svg A Mechanism for Reasoning over Defeasible Preferences in Arg2P (paper in proceedings, 2021) — Giuseppe Pisano, Roberta Calegari, Andrea Omicini, Giovanni Sartor
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)
works as
reference talk for
Publication_icon.svg A Mechanism for Reasoning over Defeasible Preferences in Arg2P (paper in proceedings, 2021) — Giuseppe Pisano, Roberta Calegari, Andrea Omicini, Giovanni Sartor

cover
Talks
search • all
A Mechanism for Reasoning over Defeasible Preferences in Arg2P
— sort
talk
— language
English wgb.gif
who
— speakers
Giuseppe Pisano
— authors
Giuseppe Pisano  •  Roberta Calegari  •  Andrea Omicini  •  Giovanni Sartor
where & when
— place
Parma, Italy
— date
07/09/2021
APICe
— hosting event
CILC 2021
— reference publication
A Mechanism for Reasoning over Defeasible Preferences in Arg2P
— funding project
CompuLaw  •  StairwAI