Gerhard Brewka

Comparing Weak Admissibility Semantics to their Dung-style Counterparts (Extended Abstract)

Semantics based on weak admissibility were recently introduced to overcome a problem with self-defeating arguments that has not been solved for more than 25 years. The recursive definition of weak admissibility mainly relies on the notion of a reduct regarding a set E which only contains arguments w…