Abstract
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 |
Subtitle of host publication | Principles and Practice of Multi-Agent Systems: 23rd International Conference, Nagoya, Japan, November 18–20, 2020, Proceedings |
Editors | Takahiro Uchiya, Quan Bai, Iván Marsá Maestre |
Place of Publication | Cham |
Publisher | Springer, Cham |
Pages | 199-214 |
Number of pages | 16 |
Volume | LNCS/LNAI 12568 |
Edition | 1st |
ISBN (Electronic) | 9783030693220 |
ISBN (Print) | 9783030693213 |
DOIs | |
Publication status | Published - 14 Feb 2021 |
Externally published | Yes |
Event | 23rd International Conference on Principles and Practice of Multi-Agent Systems - Virtual, Online Duration: 18 Nov 2020 → 20 Nov 2020 Conference number: 23 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Publisher | Springer Nature Switzerland AG |
Volume | 12568 LNCS/LNAI |
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 |
City | Virtual, Online |
Period | 18/11/20 → 20/11/20 |