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
Authors: 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
Recommendations
- Design and results of the second international competition on computational models of argumentation
- Not only size, but also shape counts: abstract argumentation solvers are benchmark-sensitive
- On the impact of configuration on abstract argumentation automated reasoning
- How we designed winning algorithms for abstract argumentation and which insight we attained
- Computational models of argument. Proceedings of COMMA 2008. 2nd international conference on computational models of argument, Toulouse, France, May 28--30, 2008
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
- A probabilistic semantics for abstract argumentation
- 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
- Investigating the relationship between argumentation semantics via signatures
Cited In (21)
- 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
- Not only size, but also shape counts: abstract argumentation solvers are benchmark-sensitive
- A logical encoding for \(k\)-\(m\)-realization of extensions in abstract argumentation
- The OWL reasoner evaluation (ORE) 2015 competition report
- Using graph convolutional networks for approximate reasoning with abstract argumentation frameworks: a feasibility study
- 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
- On the impact of configuration on abstract argumentation automated reasoning
- The first international competition on computational models of argumentation: results and analysis
- 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)
