Abstract / Description of output
Various structured argumentation frameworks utilize preferences as part of their inference procedure. In this paper, we consider an inverse of the standard reasoning problem, seeking to identify what preferences could lead to a given set of conclusions being drawn. We ground our work in the Assumption-Based Argumentation (ABA) framework, and present an algorithm which computes and enumerates all possible sets of preferences (restricted to three identified cases) over the assumptions in the system from which a desired conflict-free set of conclusions can be obtained under a given semantics. After describing our algorithm, we establish its soundness, completeness and complexity.
Original language | English |
---|---|
Title of host publication | PRIMA 2020: Principles and Practice of Multi-Agent Systems |
Editors | Takahiro Uchiya, Quan Bai, Iván Marsá Maestre |
Place of Publication | Cham |
Publisher | Springer |
Pages | 199-214 |
Number of pages | 16 |
ISBN (Electronic) | 978-3-030-69322-0 |
ISBN (Print) | 978-3-030-69321-3 |
DOIs | |
Publication status | Published - 14 Feb 2021 |
Event | 23rd International Conference on Principles and Practice of Multi-Agent Systems - Online, Nagoya, Japan Duration: 18 Nov 2020 → 20 Aug 2021 http://uchiya.web.nitech.ac.jp/prima2020/ |
Publication series
Name | Lecture Notes in Computer Science |
---|---|
Publisher | Springer |
Volume | 12568 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | 23rd International Conference on Principles and Practice of Multi-Agent Systems |
---|---|
Abbreviated title | PRIMA 2020 |
Country/Territory | Japan |
City | Nagoya |
Period | 18/11/20 → 20/08/21 |
Internet address |