License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ICCSW.2015.29
URN: urn:nbn:de:0030-drops-54783
Go to the corresponding OASIcs Volume Portal

Hadjisoteriou, Evgenios

Computing Argumentation with Matrices

7.pdf (0.4 MB)


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.

BibTeX - Entry

  author =	{Evgenios Hadjisoteriou},
  title =	{{Computing Argumentation with Matrices}},
  booktitle =	{2015 Imperial College Computing Student Workshop (ICCSW 2015)},
  pages =	{29--36},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-000-2},
  ISSN =	{2190-6807},
  year =	{2015},
  volume =	{49},
  editor =	{Claudia Schulz and Daniel Liew},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{},
  URN =		{urn:nbn:de:0030-drops-54783},
  doi =		{10.4230/OASIcs.ICCSW.2015.29},
  annote =	{Keywords: Argumentation, Semantics, Extension, Algorithm, Matrix}

Keywords: Argumentation, Semantics, Extension, Algorithm, Matrix
Collection: 2015 Imperial College Computing Student Workshop (ICCSW 2015)
Issue Date: 2015
Date of publication: 23.09.2015

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI