Get our free extension to see links to code for papers anywhere online!Free add-on: code for papers everywhere!Free add-on: See code for papers anywhere!
Abstract:We show that preferred, stable, complete, and grounded semantics satisfy attack removal monotonicity. This means that if an attack from b to a is removed, the status of a cannot worsen, e.g. if a was skeptically accepted, it cannot become rejected.