Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
From MaRDI portal
(Redirected from Publication:898737)
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.
Cites work
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1946853 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 6747868 (Why is no real title available?)
- Admissibility in the abstract dialectical framework
- Answer-set programming encodings for argumentation frameworks
- Approximating operators and semantics for abstract dialectical frameworks
- Approximations, stable operators, well-founded fixpoints and applications in nonmonotonic reasoning
- Argumentation in artificial intelligence
- Augmenting tractable fragments of abstract argumentation
- Coherence in finite argument systems.
- Complexity-sensitive decision procedures for abstract argumentation
- Computing ideal sceptical argumentation
- Expressiveness of two-valued semantics for abstract dialectical frameworks
- Graph theoretical structures in logic programs and default theories
- Grounded fixpoints and their applications in knowledge representation
- Instantiating knowledge bases in abstract dialectical frameworks
- On principle-based evaluation of extension-based argumentation semantics
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- On the computational complexity of assumption-based argumentation for default reasoning.
- On the decomposition of abstract dialectical frameworks and the complexity of naive-based semantics
- On the evaluation of argumentation formalisms
- On the instantiation of knowledge bases in abstract argumentation frameworks
- Probabilistic abstract dialectical frameworks
- Semi-stable semantics
- Splitting an Argumentation Framework
- Splitting an operator: algebraic modularity results for logics with fixpoint semantics
- Supportedly stable answer sets for logic programs with generalized atoms
- Sur le théorème de Zorn
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- The carneades model of argument and burden of proof
- The computational complexity of ideal semantics
- Ultimate approximation and its application in nonmonotonic knowledge representation systems
- Uniform semantic treatment of default and autoepistemic logics
Cited in
(15)- Epistemic graphs for representing and reasoning with positive and negative influences of arguments
- Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving
- On acceptance conditions in abstract argumentation frameworks
- Categorical approximation fixpoint theory
- A glimpse on Gerhard Brewka's contributions to artificial intelligence
- On well-founded set-inductions and locally monotone operators
- On the decomposition of abstract dialectical frameworks and the complexity of naive-based semantics
- Solving Advanced Argumentation Problems with Answer Set Programming
- Probabilistic abstract dialectical frameworks
- Approximating operators and semantics for abstract dialectical frameworks
- Non-deterministic approximation fixpoint theory and its application in disjunctive logic programming
- Understanding the abstract dialectical framework
- scientific article; zbMATH DE number 7166765 (Why is no real title available?)
- Representing abstract dialectical frameworks with binary decision diagrams
- Admissibility in Probabilistic Argumentation
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)
