English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We study the complexity of reasoning in abstracts argumentation frameworksclose to graph classes that allow for efficient reasoning methods, i.e.\ to oneof the classes of acyclic, noeven, biparite and symmetric AFs. In this work weshow that certain reasoning problems on the second level of the polynomialhierarchy still maintain their full complexity when restricted to instances offixed distance to one of the above graph classes.

Technical Note: Exploring \Sigma^P_2 / \Pi^P_2-hardness for Argumentation Problems with fixed distance to tractable classes