Abstract
Argumentation frameworks with finitely many arguments can be presented in matrix form. For this reason, the strengths and weaknesses of matrix operations are migrated from a mathematical representation to a computer science interpretation. We present matrix operation algorithms that can answer whether a given set of arguments is part of an argumentation extension.
Original language | English |
---|---|
Title of host publication | 2015 Imperial College Computing Student Workshop, ICCSW 2015 |
Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
Pages | 29-36 |
Number of pages | 8 |
Volume | 49 |
ISBN (Electronic) | 9783959770002 |
DOIs | |
Publication status | Published - 1 Sept 2015 |
Event | 5th Imperial College Computing Student Workshop, ICCSW 2015 - London, United Kingdom Duration: 24 Sept 2015 → 25 Sept 2015 |
Other
Other | 5th Imperial College Computing Student Workshop, ICCSW 2015 |
---|---|
Country/Territory | United Kingdom |
City | London |
Period | 24/09/15 → 25/09/15 |
Keywords
- Algorithm
- Argumentation
- Extension
- Matrix
- Semantics