Computing argumentation with matrices

Evgenios Hadjisoteriou

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 languageEnglish
Title of host publication2015 Imperial College Computing Student Workshop, ICCSW 2015
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages29-36
Number of pages8
Volume49
ISBN (Electronic)9783959770002
DOIs
Publication statusPublished - 1 Sept 2015
Event5th Imperial College Computing Student Workshop, ICCSW 2015 - London, United Kingdom
Duration: 24 Sept 201525 Sept 2015

Other

Other5th Imperial College Computing Student Workshop, ICCSW 2015
Country/TerritoryUnited Kingdom
CityLondon
Period24/09/1525/09/15

Keywords

  • Algorithm
  • Argumentation
  • Extension
  • Matrix
  • Semantics

Fingerprint

Dive into the research topics of 'Computing argumentation with matrices'. Together they form a unique fingerprint.

Cite this