[Date Prev][Date Next][Date Index]

Talk announcement: Tuesday, Oct 1, 2019, 10:00 s.t.: Gerd Brewka "Tree projection width and fixed-parameter tractable queries"



Dear all,
the Institute of Logic and Computation cordially invites you to the following talk:

=============================================================================

Speaker: Prof. Dr. Gerd Brewka

Universität Leipzig

https://www.informatik.uni-leipzig.de/~brewka/

==========================================================================================

DATE:   Tuesday, October 1, 2019

TIME:   10:00 s.t.

VENUE:
Seminarraum FAV 01 A (Seminarraum 183/2), Favoritenstraße 9-11, 1040 Wien, RoomNo.: HE 01 02.

===========================================================================================

TITLE: Admissibility and Completeness Revisited

===========================================================================================

Abstract:
In Dung's approach to abstract argumentation self-defeating arguments have the same power to exclude arguments from extensions as any other argument. This was already observed by Dung in his seminal 1995 paper, and he suggests to investigate semantics where the effects of self-defeating arguments are restricted. We take up this issue and propose variants of some of the original Dung semantics where this potentially unintended phenomenon does not arise.
==========================================================================================

With kind support of the Vienna Center for Logic and Algorithms (VCLA) and the Wolfgang Pauli Institut (WPI).









-- 
TU Wien
Institut für Logic & Computation
Favoritenstr. 9 - 11/ 192-02
A-1040 Wien
TEL.: +43 1 58801 18403

DVR 0005886