On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics

DOI10.1613/jair.1.11348zbMath1476.68251OpenAlexW3120930077MaRDI QIDQ5145833

Sarah A. Gaggl, Sebastian Rudolph, Hannes Strass

Publication date: 22 January 2021

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.1.11348

zbMATH Keywords

decision theoryautomated reasoninginformation agentsdiscourse modelling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in artificial intelligence (68T27)

Related Items (4)

Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving ⋮ Admissibility in Probabilistic Argumentation ⋮ Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory ⋮ Representing abstract dialectical frameworks with binary decision diagrams

Uses Software

• DIAMOND
• Carneades

Cites Work

• Unnamed Item
• Unnamed Item
• Toward incremental computation of argumentation semantics: a decomposition-based approach
• Approximating operators and semantics for abstract dialectical frameworks
• Weighted argument systems: basic definitions, algorithms, and complexity results
• Complexity of semi-stable and stage semantics in argumentation frameworks
• Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
• The complexity of facets (and some facets of complexity)
• A reasoning model based on the production of acceptable arguments
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Empirical study on human evaluation of complex argumentation frameworks
• SCC-recursiveness: a general schema for argumentation semantics
• The cf2 argumentation semantics revisited
• Probabilistic Abstract Dialectical Frameworks
• Stage semantics and the SCC-recursive schema for argumentation semantics
• Argumentation and Answer Set Programming
• Splitting an Argumentation Framework
• On the Intertranslatability of Argumentation Semantics
• Expressiveness of Two-Valued Semantics for Abstract Dialectical Frameworks
• On bipolarity in argumentation frameworks
• Persuasion in Practical Argument Using Value-based Argumentation Frameworks
• Instantiating rule-based defeasible theories in abstract dialectical frameworks and beyond
• The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection

This page was built for publication: On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics