Stage semantics and the SCC-recursive schema for argumentation semantics

DOI10.1093/LOGCOM/EXU006zbMath1354.68252OpenAlexW2320759892MaRDI QIDQ2957944

Sarah A. Gaggl, Wolfgang Dvořák

Publication date: 31 January 2017

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/d87fb0402b7cd9eb94747dadb60c5cf2f21a5b58

zbMATH Keywords

computational complexitylabellingsabstract argumentationanswer-set programmingstrong equivalencecf2 semanticsodd-length cyclesstage 2 semantics

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (14)

Shedding new light on the foundations of abstract argumentation: modularization and weak admissibility ⋮ Logic Programming, Argumentation and Human Reasoning ⋮ Paracoherent Answer Set Semantics meets Argumentation Frameworks ⋮ The choice-preferred semantics for relevance-oriented acceptance of admissible sets of arguments ⋮ Explanations of non-monotonic inference in admissibility-based abstract argumentation ⋮ The burden of persuasion in abstract argumentation ⋮ On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation ⋮ On the input/output behavior of argumentation frameworks ⋮ On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics ⋮ A Dynamic Approach for Combining Abstract Argumentation Semantics ⋮ Infinite Argumentation Frameworks ⋮ What Is a Reasonable Argumentation Semantics? ⋮ Ensuring reference independence and cautious monotony in abstract argumentation ⋮ Methods for solving reasoning problems in abstract argumentation -- a survey

This page was built for publication: Stage semantics and the SCC-recursive schema for argumentation semantics