Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory

DOI10.1016/j.artint.2015.05.003zbMath1346.68188OpenAlexW1503237869MaRDI QIDQ898737

Hannes Strass, Johannes Peter Wallner

Publication date: 18 December 2015

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

Full work available at URL: https://doi.org/10.1016/j.artint.2015.05.003

zbMATH Keywords

computational complexityabstract dialectical frameworksapproximation fixpoint theory

Mathematics Subject Classification ID

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

Related Items

On Well-Founded Set-Inductions and Locally Monotone Operators ⋮ Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving ⋮ Probabilistic Abstract Dialectical Frameworks ⋮ Admissibility in Probabilistic Argumentation ⋮ Representing abstract dialectical frameworks with binary decision diagrams ⋮ On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics ⋮ A Glimpse on Gerhard Brewka’s Contributions to Artificial Intelligence ⋮ Solving Advanced Argumentation Problems with Answer Set Programming ⋮ Epistemic graphs for representing and reasoning with positive and negative influences of arguments ⋮ Understanding the Abstract Dialectical Framework

Uses Software

• DIAMOND
• Carneades

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating operators and semantics for abstract dialectical frameworks
• Complexity-sensitive decision procedures for abstract argumentation
• Ultimate approximation and its application in nonmonotonic knowledge representation systems
• Graph theoretical structures in logic programs and default theories
• Grounded fixpoints and their applications in knowledge representation
• On the evaluation of argumentation formalisms
• Argumentation in artificial intelligence
• Computing ideal sceptical argumentation
• On principle-based evaluation of extension-based argumentation semantics
• The carneades model of argument and burden of proof
• The computational complexity of ideal semantics
• Augmenting tractable fragments of abstract argumentation
• Coherence in finite argument systems.
• On the computational complexity of assumption-based argumentation for default reasoning.
• Uniform semantic treatment of default and autoepistemic logics
• On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
• Supportedly stable answer sets for logic programs with generalized atoms
• Sur le théorème de Zorn
• On the Instantiation of Knowledge Bases in Abstract Argumentation Frameworks
• Instantiating Knowledge Bases in Abstract Dialectical Frameworks
• Admissibility in the Abstract Dialectical Framework
• Probabilistic Abstract Dialectical Frameworks
• Splitting an Argumentation Framework
• Semi-stable semantics
• Expressiveness of Two-Valued Semantics for Abstract Dialectical Frameworks
• On the Decomposition of Abstract Dialectical Frameworks and the Complexity of Naive-based Semantics
• Splitting an operator
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty

This page was built for publication: Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory