Dung's semantics satisfy attack removal monotonicity

07/08/2020
by   Leila Amgoud, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/01/2019

On the supersingular GPST attack

We explain why the first Galbraith-Petit-Shani-Ti attack on the Supersin...
research
07/17/2022

Watermark Vaccine: Adversarial Attacks to Prevent Watermark Removal

As a common security tool, visible watermarking has been widely applied ...
research
07/02/2019

A Local Perspective on the Edge Removal Problem

The edge removal problem studies the loss in network coding rates that r...
research
09/17/2021

Hard to Forget: Poisoning Attacks on Certified Machine Unlearning

The right to erasure requires removal of a user's information from data ...
research
09/21/2022

Adversarial Formal Semantics of Attack Trees and Related Problems

Security is a subject of increasing attention in our actual society in o...
research
11/10/2021

On the efficiency of a general attack against the MOBS cryptosystem

All instances of the semidirect key exchange protocol, a generalisation ...
research
05/31/2019

Taming Combinatorial Challenges in Optimal Clutter Removal Tasks

We examine an important combinatorial challenge in clearing clutter usin...

Please sign up or login with your details

Forgot password? Click here to reset