Methods for solving reasoning problems in abstract argumentation -- a survey
From MaRDI portal
Publication:2341832
DOI10.1016/j.artint.2014.11.008zbMath1328.68212OpenAlexW1970198086WikidataQ28083532 ScholiaQ28083532MaRDI QIDQ2341832
Sarah A. Gaggl, Wolfgang Dvořák, Günther Charwat, Stefan Woltran, Johannes Peter Wallner
Publication date: 6 May 2015
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2014.11.008
Related Items (28)
Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving ⋮ Optimization of dialectical outcomes in dialogical argumentation ⋮ Looking-ahead in backtracking algorithms for abstract argumentation ⋮ Labellings for assumption-based and abstract argumentation ⋮ The first international competition on computational models of argumentation: results and analysis ⋮ RAFDivider : a distributed algorithm for computing semantics in higher-order abstract argumentation frameworks ⋮ On the impact of configuration on abstract argumentation automated reasoning ⋮ Lattice point of view for argumentation framework ⋮ On checking skeptical and ideal admissibility in abstract argumentation frameworks ⋮ Improved answer-set programming encodings for abstract argumentation ⋮ Range-based argumentation semantics as two-valued models ⋮ Taking account of the actions of others in value-based reasoning ⋮ The complexity landscape of claim-augmented argumentation frameworks ⋮ On the preferred extensions of argumentation frameworks: bijections with naive sets ⋮ On efficiently estimating the probability of extensions in abstract argumentation frameworks ⋮ An argumentative dialogue system for COVID-19 vaccine information ⋮ On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation ⋮ New stochastic local search approaches for computing preferred extensions of abstract argumentation ⋮ Abstract Argumentation in Dynamic Logic: Representation, Reasoning and Change ⋮ Unnamed Item ⋮ Design and results of the second international competition on computational models of argumentation ⋮ How we designed winning algorithms for abstract argumentation and which insight we attained ⋮ Solving Advanced Argumentation Problems with Answer Set Programming ⋮ Encoding Argument Graphs in Logic ⋮ Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks ⋮ Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence ⋮ Graded labellings for abstract argumentation ⋮ Indepth combinatorial analysis of admissible sets for abstract argumentation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Normal and strong expansion equivalence for argumentation frameworks
- Characterizing strong equivalence for argumentation frameworks
- On the input/output behavior of argumentation frameworks
- Complexity-sensitive decision procedures for abstract argumentation
- Algorithms for decision problems in argument systems under preferred semantics
- Weighted argument systems: basic definitions, algorithms, and complexity results
- On the resolution-based family of abstract argumentation semantics and its grounded instance
- AFRA: argumentation framework with recursive attacks
- Instantiating abstract argumentation with classical logic arguments: postulates and properties
- Algorithms for generating arguments and counterarguments in propositional logic
- Dynamics of argumentation systems: a division-based method
- Complexity of semi-stable and stage semantics in argumentation frameworks
- Graph theoretical structures in logic programs and default theories
- Graph minors. III. Planar tree-width
- Reasoning about preferences in argumentation frameworks
- Treewidth computations. I: Upper bounds
- On the evaluation of argumentation formalisms
- Argumentation in artificial intelligence
- Computing ideal sceptical argumentation
- On principle-based evaluation of extension-based argumentation semantics
- Computational properties of argument systems satisfying graph-theoretic constraints
- The carneades model of argument and burden of proof
- The computational complexity of ideal semantics
- Treewidth. Computations and approximations
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Augmenting tractable fragments of abstract argumentation
- Coherence in finite argument systems.
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- On the computational cost of disjunctive logic programming: Propositional case
- Dung's argumentation is essentially equivalent to classical propositional logic with the Peirce-Quine dagger
- Logic programs with stable model semantics as a constraint programming paradigm
- Fibring argumentation frames
- A logical account of formal argumentation
- A QBF-based formalization of abstract argumentation semantics
- Dialectic proof procedures for assumption-based, admissible argumentation
- SCC-recursiveness: a general schema for argumentation semantics
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Advanced SAT Techniques for Abstract Argumentation
- The cf2 argumentation semantics revisited
- Parameterized Splitting: A Simple Modification-Based Approach
- Enumerating Extensions on Random Abstract-AFs with ArgTools, Aspartix, ConArg2, and Dung-O-Matic
- Stage semantics and the SCC-recursive schema for argumentation semantics
- Preferred semantics as socratic discussion
- A Common Computational Framework for Semiring-based Argumentation Systems
- Argumentation and Answer Set Programming
- Splitting an Argumentation Framework
- Solving Weighted Argumentation Frameworks with Soft Constraints
- Complex optimization in answer set programming
- On the Intertranslatability of Argumentation Semantics
- Preferred extensions as stable models
- An Algorithm for Computing Semi-stable Semantics
- Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
- Change in Abstract Argumentation Frameworks: Adding an Argument
- Argumentation Context Systems: A Framework for Abstract Group Argumentation
- Towards a Common Framework for Dialectical Proof Procedures in Abstract Argumentation
- Complexity of Finding Embeddings in a k-Tree
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Persuasion in Practical Argument Using Value-based Argumentation Frameworks
- GRASP: a search algorithm for propositional satisfiability
- Defeasible logic programming: an argumentative approach
- D-FLAT: Declarative problem solving using tree decompositions and answer-set programming
- Nonmonotonic Tools for Argumentation
- Evaluation of an MSO-Solver
- The DLV system for knowledge representation and reasoning
- Partial semantics of argumentation: basic properties and empirical
- Theory and Applications of Satisfiability Testing
- Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach
- Algorithms for Argumentation Semantics: Labeling Attacks as a Generalization of Labeling Arguments
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A logic-based theory of deductive arguments
This page was built for publication: Methods for solving reasoning problems in abstract argumentation -- a survey
