BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//University of Liverpool Computer Science Seminar System//v2//EN
BEGIN:VEVENT
DTSTAMP:20260922T022148Z
UID:Seminar-dept-349@lxserverM.csc.liv.ac.uk
ORGANIZER:CN=Lutz Oettershagen:MAILTO:Lutz.Oettershagen@liverpool.ac.uk
DTSTART:20140401T160000
DTEND:20140401T170000
SUMMARY:School Seminar Series
DESCRIPTION:Prof Gerhard Brewka: A Semantical Framework for Graph-Based Argument Processing\n\nGraphical models are widely used in argumentation to\n\nvisualize relationships among propositions or arguments. The intuitive\n\nmeaning of the links in the graphs is typically expressed using\n\nlabels of various kinds. In this paper we introduce a general semantical\n\nframework for assigning a precise meaning to labelled argument\n\ngraphs which makes them suitable for automatic evaluation. Our approach\n\nrests on the notion of explicit acceptance conditions, as first\n\nstudied in Abstract Dialectical Frameworks (ADFs). The acceptance\n\nconditions used here are functions from multisets of labels to truth\n\nvalues. We define various Dung style semantics for argument graphs.\n\nWe also introduce a pattern language for specifying acceptance functions.\n\nMoreover, we show how argument graphs can be compiled to\n\nADFs, thus providing an automatic evaluation tool via existing ADF\n\nimplementations. Finally, we also discuss complexity issues.\n\n\n\njoint work with Stefan Woltran\n\nhttps://www.csc.liv.ac.uk/research/seminars/abstract.php?id=349
LOCATION:Ashton Lecture Theater
END:VEVENT
END:VCALENDAR