Design and results of the second international competition on computational models of argumentation
type: Item
instance of: scholarly article
title: Design and results of the second international competition on computational models of argumentation
zbMATH Open document ID: 1478.68353
author: Sarah Alice Gaggl
author: Thomas Linsbichler
author: Marco Maratea
author: Stefan Woltran
published in: Artificial Intelligence
publication date: 2020-01-20T00:00:00Z
full work available at URL: https://arxiv.org/abs/1909.00621
Mathematics Subject Classification ID: 68T27
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 7153710
zbMATH Keywords: abstract argumentation
zbMATH Keywords: solver competition
zbMATH Keywords: computational logic
describes a project that uses: DIAMOND
describes a project that uses: CoQuiAAS
describes a project that uses: MiniSat
describes a project that uses: Clingo
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2989062896
arXiv ID: 1909.00621
cites work: Model enumeration in propositional circumscription via unsatisfiable core analysis
cites work: Computational Complexity
cites work: Emergence of Scaling in Random Networks
cites work: Argumentation in artificial intelligence
cites work: A Comparative Test on the Enumeration of Extensions in Abstract Argumentation*
cites work: Not only size, but also shape counts: abstract argumentation solvers are benchmark-sensitive
cites work: Design and results of the Fifth Answer Set Programming Competition
cites work: Semi-stable semantics
cites work: On the equivalence between logic programming semantics and argumentation semantics
cites work: On the impact of configuration on abstract argumentation automated reasoning
cites work: Methods for solving reasoning problems in abstract argumentation -- a survey
cites work: Graph theoretical structures in logic programs and default theories
cites work: On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
cites work: Computing ideal sceptical argumentation
cites work: The computational complexity of ideal semantics
cites work: Coherence in finite argument systems.
cites work: Parametric properties of ideal semantics
cites work: Complexity-sensitive decision procedures for abstract argumentation
cites work: Complexity of semi-stable and stage semantics in argumentation frameworks
cites work: Theory and Applications of Satisfiability Testing
cites work: Q3267900
cites work: Solving Set Optimization Problems by Cardinality Optimization with an Application to Argumentation
cites work: Improved answer-set programming encodings for abstract argumentation
cites work: Multi-shot ASP solving with clingo
cites work: The Sixth Answer Set Programming Competition
cites work: Answer set programming based on propositional satisfiability
cites work: On generating all maximal independent sets
cites work: From structured to abstract argumentation: assumption-based acceptance via AF reasoning
cites work: Looking-ahead in backtracking algorithms for abstract argumentation
cites work: The first international competition on computational models of argumentation: results and analysis
cites work: Collective dynamics of ‘small-world’ networks
cites work: Complete extensions in argumentation coincide with 3-valued stable models in logic programming
Wikidata QID: Q126830473
DOI: 10.1016/J.ARTINT.2019.103193
description: scientific article