The first international competition on computational models of argumentation: results and analysis
From MaRDI portal
Publication:1677447
DOI10.1016/J.ARTINT.2017.08.006zbMATH Open1419.68135OpenAlexW2752231188MaRDI QIDQ1677447FDOQ1677447
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
Cites Work
- Theory and Applications of Satisfiability Testing
- A note on two problems in connexion with graphs
- Emergence of Scaling in Random Networks
- Title not available (Why is that?)
- Collective dynamics of ‘small-world’ networks
- Argumentation in artificial intelligence
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Title not available (Why is that?)
- Defeasible logic programming: an argumentative approach
- Title not available (Why is that?)
- Title not available (Why is that?)
- A probabilistic approach to modelling uncertain logical arguments
- Title not available (Why is that?)
- Dynamics of argumentation systems: a division-based method
- A mathematical treatment of defeasible reasoning and its implementation.
- The first international competition on computational models of argumentation: results and analysis
- Methods for solving reasoning problems in abstract argumentation -- a survey
- Looking-ahead in backtracking algorithms for abstract argumentation
- On the Issue of Reinstatement in Argumentation
- Algorithms for decision problems in argument systems under preferred semantics
- Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach
- Coherence in finite argument systems.
- Complexity-sensitive decision procedures for abstract argumentation
- Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- Characteristics of multiple viewpoints in abstract argumentation
- SCC-recursiveness: a general schema for argumentation semantics
- Preferred extensions as stable models
- Toward incremental computation of argumentation semantics: a decomposition-based approach
- Weighted argument systems: basic definitions, algorithms, and complexity results
- The carneades model of argument and burden of proof
- A QBF-based formalization of abstract argumentation semantics
- Argumentation and Answer Set Programming
- Justification and defeat
- Title not available (Why is that?)
- A Comparative Test on the Enumeration of Extensions in Abstract Argumentation*
- Manifold Answer-Set Programs for Meta-reasoning
- Synthesizing Argumentation Frameworks from Examples
- Title not available (Why is that?)
Cited In (18)
- 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
- On checking skeptical and ideal admissibility in abstract argumentation frameworks
- A general notion of equivalence for abstract argumentation
- Title not available (Why is that?)
- Credulous acceptance in high-order argumentation frameworks with necessities: an incremental approach
- Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving
- A logical encoding for \(k\)-\(m\)-realization of extensions in abstract argumentation
- Looking-ahead in backtracking algorithms for abstract argumentation
- Title not available (Why is that?)
- New stochastic local search approaches for computing preferred extensions of abstract argumentation
- On rejected arguments and implicit conflicts: the hidden power of argumentation semantics
- Evaluation of argument strength in attack graphs: foundations and semantics
- The first international competition on computational models of argumentation: results and analysis
- Using Graph Convolutional Networks for Approximate Reasoning with Abstract Argumentation Frameworks: A Feasibility Study
- Incremental computation for structured argumentation over dynamic DeLP knowledge bases
- Verification in incomplete argumentation frameworks
- Reasoning in assumption-based argumentation using tree-decompositions
Uses Software
This page was built for publication: The first international competition on computational models of argumentation: results and analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1677447)
