Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
From MaRDI portal
Publication:898737
DOI10.1016/J.ARTINT.2015.05.003zbMATH Open1346.68188OpenAlexW1503237869MaRDI QIDQ898737FDOQ898737
Authors: Hannes Strass, Johannes 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
Recommendations
- On the decomposition of abstract dialectical frameworks and the complexity of naive-based semantics
- Approximating operators and semantics for abstract dialectical frameworks
- scientific article; zbMATH DE number 7166765
- Complexity of abstract argumentation under a claim-centric view
- On the computational complexity of assumption-based argumentation for default reasoning.
Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30) Logic in artificial intelligence (68T27)
Cites Work
- Argumentation in artificial intelligence
- Computing ideal sceptical argumentation
- The computational complexity of ideal semantics
- On the computational complexity of assumption-based argumentation for default reasoning.
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the evaluation of argumentation formalisms
- Semi-stable semantics
- On principle-based evaluation of extension-based argumentation semantics
- Coherence in finite argument systems.
- Splitting an Argumentation Framework
- Answer-set programming encodings for argumentation frameworks
- Complexity-sensitive decision procedures for abstract argumentation
- Title not available (Why is that?)
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Graph theoretical structures in logic programs and default theories
- Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
- Splitting an operator: algebraic modularity results for logics with fixpoint semantics
- Ultimate approximation and its application in nonmonotonic knowledge representation systems
- Sur le théorème de Zorn
- The carneades model of argument and burden of proof
- Augmenting tractable fragments of abstract argumentation
- Uniform semantic treatment of default and autoepistemic logics
- On the instantiation of knowledge bases in abstract argumentation frameworks
- Instantiating knowledge bases in abstract dialectical frameworks
- Approximating operators and semantics for abstract dialectical frameworks
- Grounded fixpoints and their applications in knowledge representation
- Supportedly stable answer sets for logic programs with generalized atoms
- Admissibility in the abstract dialectical framework
- Probabilistic abstract dialectical frameworks
- Expressiveness of two-valued semantics for abstract dialectical frameworks
- On the decomposition of abstract dialectical frameworks and the complexity of naive-based semantics
Cited In (15)
- A glimpse on Gerhard Brewka's contributions to artificial intelligence
- Admissibility in Probabilistic Argumentation
- Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming
- Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving
- On well-founded set-inductions and locally monotone operators
- Approximating operators and semantics for abstract dialectical frameworks
- On acceptance conditions in abstract argumentation frameworks
- Solving Advanced Argumentation Problems with Answer Set Programming
- Probabilistic abstract dialectical frameworks
- On the decomposition of abstract dialectical frameworks and the complexity of naive-based semantics
- Representing abstract dialectical frameworks with binary decision diagrams
- Epistemic graphs for representing and reasoning with positive and negative influences of arguments
- Title not available (Why is that?)
- Categorical approximation fixpoint theory
- Understanding the abstract dialectical framework
Uses Software
This page was built for publication: Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q898737)
