The first international competition on computational models of argumentation: results and analysis
From MaRDI portal
Publication:1677447
DOI10.1016/j.artint.2017.08.006zbMath1419.68135OpenAlexW2752231188MaRDI QIDQ1677447
Matthias Thimm, Serena Villata
Publication date: 21 November 2017
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2017.08.006
Related Items (14)
Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving ⋮ Looking-ahead in backtracking algorithms for abstract argumentation ⋮ On rejected arguments and implicit conflicts: the hidden power of argumentation semantics ⋮ The first international competition on computational models of argumentation: results and analysis ⋮ On checking skeptical and ideal admissibility in abstract argumentation frameworks ⋮ A logical encoding for \(k\)-\(m\)-realization of extensions in abstract argumentation ⋮ Using Graph Convolutional Networks for Approximate Reasoning with Abstract Argumentation Frameworks: A Feasibility Study ⋮ New stochastic local search approaches for computing preferred extensions of abstract argumentation ⋮ Verification in incomplete argumentation frameworks ⋮ Incremental computation for structured argumentation over dynamic DeLP knowledge bases ⋮ 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 ⋮ Evaluation of argument strength in attack graphs: foundations and semantics ⋮ A general notion of equivalence for abstract argumentation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Looking-ahead in backtracking algorithms for abstract argumentation
- Toward incremental computation of argumentation semantics: a decomposition-based approach
- 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
- Dynamics of argumentation systems: a division-based method
- Characteristics of multiple viewpoints in abstract argumentation
- A mathematical treatment of defeasible reasoning and its implementation.
- Argumentation in artificial intelligence
- The carneades model of argument and burden of proof
- Justification and defeat
- The first international competition on computational models of argumentation: results and analysis
- Coherence in finite argument systems.
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Methods for solving reasoning problems in abstract argumentation -- a survey
- A probabilistic approach to modelling uncertain logical arguments
- A QBF-based formalization of abstract argumentation semantics
- SCC-recursiveness: a general schema for argumentation semantics
- Argumentation and Answer Set Programming
- Emergence of Scaling in Random Networks
- A Comparative Test on the Enumeration of Extensions in Abstract Argumentation*
- Preferred extensions as stable models
- On the Issue of Reinstatement in Argumentation
- Manifold Answer-Set Programs for Meta-reasoning
- Synthesizing Argumentation Frameworks from Examples
- Defeasible logic programming: an argumentative approach
- Theory and Applications of Satisfiability Testing
- Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction
- Collective dynamics of ‘small-world’ networks
- Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
This page was built for publication: The first international competition on computational models of argumentation: results and analysis
