The Equational Approach to CF2 Semantics
This work addresses a specific challenge in computational argumentation for AI researchers, offering incremental improvements in semantics for handling loops.
The paper tackles the problem of handling odd and even loops in argumentation networks by introducing a family of new equational semantics, with one version equivalent to CF2 semantics and another that matches traditional Dung semantics for even loops while still managing odd loops.
We introduce a family of new equational semantics for argumentation networks which can handle odd and even loops in a uniform manner. We offer one version of equational semantics which is equivalent to CF2 semantics, and a better version which gives the same results as traditional Dung semantics for even loops but can still handle odd loops.