Methods for solving reasoning problems in abstract argumentation -- a survey
From MaRDI portal
Publication:2341832
Recommendations
Cites work
- A Common Computational Framework for Semiring-based Argumentation Systems
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- A logic-based theory of deductive arguments
- A logical account of formal argumentation
- A QBF-based formalization of abstract argumentation semantics
- Advanced SAT techniques for abstract argumentation
- AFRA: argumentation framework with recursive attacks
- Algorithms for argumentation semantics: labeling attacks as a generalization of labeling arguments
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Algorithms for decision problems in argument systems under preferred semantics
- Algorithms for generating arguments and counterarguments in propositional logic
- An Algorithm for Computing Semi-stable Semantics
- Argumentation and answer set programming
- Argumentation Context Systems: A Framework for Abstract Group Argumentation
- Argumentation in artificial intelligence
- Augmenting tractable fragments of abstract argumentation
- Change in abstract argumentation frameworks: adding an argument
- Characterizing strong equivalence for argumentation frameworks
- Coherence in finite argument systems.
- Complex optimization in answer set programming
- Complexity of Finding Embeddings in a k-Tree
- Complexity of semi-stable and stage semantics in argumentation frameworks
- Complexity-sensitive decision procedures for abstract argumentation
- Computational Complexity of Semi-stable Semantics in Abstract Argumentation Frameworks
- Computational models of argument (COMMA 2010). Proceedings of 3rd conference, Desanzano del Garda, Italy, September 2010.
- Computational properties of argument systems satisfying graph-theoretic constraints
- Computing ideal sceptical argumentation
- Computing preferred extensions in abstract argumentation: a SAT-based approach
- D-FLAT: declarative problem solving using tree decompositions and answer-set programming
- Defeasible logic programming: an argumentative approach
- Dialectic proof procedures for assumption-based, admissible argumentation
- Dung's argumentation is essentially equivalent to classical propositional logic with the Peirce-Quine dagger
- Dynamics of argumentation systems: a division-based method
- Enumerating extensions on random abstract-AFs with ArgTools, ASPARTIX, ConArg2, and Dung-O-Matic
- Evaluation of an MSO-Solver
- Fibring argumentation frames
- Graph minors. III. Planar tree-width
- Graph theoretical structures in logic programs and default theories
- GRASP: a search algorithm for propositional satisfiability
- Handbook of constraint programming.
- scientific article; zbMATH DE number 5914356 (Why is no real title available?)
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 2080324 (Why is no real title available?)
- scientific article; zbMATH DE number 1769206 (Why is no real title available?)
- scientific article; zbMATH DE number 1368933 (Why is no real title available?)
- scientific article; zbMATH DE number 1926645 (Why is no real title available?)
- scientific article; zbMATH DE number 5493266 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Instantiating abstract argumentation with classical logic arguments: postulates and properties
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Logic programs with stable model semantics as a constraint programming paradigm
- Nonmonotonic tools for argumentation
- Normal and strong expansion equivalence for argumentation 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 cost of disjunctive logic programming: Propositional case
- On the evaluation of argumentation formalisms
- On the input/output behavior of argumentation frameworks
- On the intertranslatability of argumentation semantics
- On the resolution-based family of abstract argumentation semantics and its grounded instance
- Parameterized splitting: a simple modification-based approach
- Partial semantics of argumentation: basic properties and empirical
- Persuasion in Practical Argument Using Value-based Argumentation Frameworks
- Preferred extensions as stable models
- Preferred semantics as Socratic discussion
- Reasoning about preferences in argumentation frameworks
- SCC-recursiveness: a general schema for argumentation semantics
- Solving weighted argumentation frameworks with soft constraints
- Splitting an Argumentation Framework
- Stage semantics and the SCC-recursive schema for argumentation semantics
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- The cf2 argumentation semantics revisited
- The carneades model of argument and burden of proof
- The computational complexity of ideal semantics
- The DLV system for knowledge representation and reasoning
- Theory and Applications of Satisfiability Testing
- Towards a common framework for dialectical proof procedures in abstract argumentation
- Towards fixed-parameter tractable algorithms for abstract argumentation
- Treewidth computations. I: Upper bounds
- Treewidth. Computations and approximations
- Weighted argument systems: basic definitions, algorithms, and complexity results
Cited in
(36)- Argumentation in artificial intelligence
- The first international competition on computational models of argumentation: results and analysis
- On the impact of configuration on abstract argumentation automated reasoning
- Taking account of the actions of others in value-based reasoning
- On the responsibility for undecisiveness in preferred and stable labellings in abstract argumentation
- Graded labellings for abstract argumentation
- Indepth combinatorial analysis of admissible sets for abstract argumentation
- Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving
- 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
- Complexity of fundamental problems in probabilistic abstract argumentation: beyond independence
- Labellings for assumption-based and abstract argumentation
- On checking skeptical and ideal admissibility in abstract argumentation frameworks
- On the preferred extensions of argumentation frameworks: bijections with naive sets
- An argumentative dialogue system for COVID-19 vaccine information
- Abstract solvers for Dung's argumentation frameworks
- Incremental computation of deterministic extensions for dynamic argumentation frameworks
- Optimization of dialectical outcomes in dialogical argumentation
- Looking-ahead in backtracking algorithms for abstract argumentation
- Abstract Argumentation in Dynamic Logic: Representation, Reasoning and Change
- Combining Modes of Reasoning: An Application of Abstract Argumentation
- Improved answer-set programming encodings for abstract argumentation
- Range-based argumentation semantics as two-valued models
- Solving Advanced Argumentation Problems with Answer Set Programming
- Enumeration of preferred extensions in almost oriented digraphs
- New stochastic local search approaches for computing preferred extensions of abstract argumentation
- Open problems in abstract argumentation
- Encoding argument graphs in logic
- RAFDivider : a distributed algorithm for computing semantics in higher-order abstract argumentation frameworks
- Lattice point of view for argumentation framework
- The complexity landscape of claim-augmented argumentation frameworks
- Reasoning in assumption-based argumentation using tree-decompositions
- Credulous acceptance in high-order argumentation frameworks with necessities: an incremental approach
- Algorithms for computing the set of acceptable arguments
- Approximating problems in abstract argumentation with graph convolutional networks
- On efficiently estimating the probability of extensions in abstract argumentation frameworks
This page was built for publication: Methods for solving reasoning problems in abstract argumentation -- a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2341832)
