On the decomposition of abstract dialectical frameworks and the complexity of naive-based semantics

DOI10.1613/JAIR.1.11348MaRDI QIDQ5145833zbMATH OpenOpenAlexFDO

Authors Sarah Alice 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

automated reasoningdecision theorydiscourse modellinginformation agents

Mathematics Subject Classification ID

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

Recommendations

• Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
• scientific article; zbMATH DE number 7166765
• scientific article; zbMATH DE number 6928628
• Approximating operators and semantics for abstract dialectical frameworks
• Expressiveness of two-valued semantics for abstract dialectical frameworks

Cites work

• A reasoning model based on the production of acceptable arguments
• Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
• Approximating operators and semantics for abstract dialectical frameworks
• Argumentation and answer set programming
• Complexity of semi-stable and stage semantics in argumentation frameworks
• Empirical study on human evaluation of complex argumentation frameworks
• Expressiveness of two-valued semantics for abstract dialectical frameworks
• scientific article; zbMATH DE number 3888913 (Why is no real title available?)
• scientific article; zbMATH DE number 3930351 (Why is no real title available?)
• Instantiating rule-based defeasible theories in abstract dialectical frameworks and beyond
• On bipolarity in argumentation frameworks
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
• On the intertranslatability of argumentation semantics
• Persuasion in Practical Argument Using Value-based Argumentation Frameworks
• Probabilistic abstract dialectical frameworks
• SCC-recursiveness: a general schema for argumentation semantics
• Splitting an Argumentation Framework
• Stage semantics and the SCC-recursive schema for argumentation semantics
• The cf2 argumentation semantics revisited
• The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection
• The complexity of facets (and some facets of complexity)
• Toward incremental computation of argumentation semantics: a decomposition-based approach
• Weighted argument systems: basic definitions, algorithms, and complexity results

Cited in

(9)

• Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving
• Representing abstract dialectical frameworks with binary decision diagrams
• Expressiveness of two-valued semantics for abstract dialectical frameworks
• scientific article; zbMATH DE number 6928628 (Why is no real title available?)
• Admissibility in Probabilistic Argumentation
• scientific article; zbMATH DE number 7166765 (Why is no real title available?)
• On SCC-recursiveness in quantitative argumentation
• An encoding of abstract dialectical frameworks into higher-order logic
• Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory

Describes a project that uses

Uses Software

• Carneades
• DIAMOND

This page was built for publication: On the decomposition of abstract dialectical frameworks and the complexity of naive-based semantics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5145833)