Design and results of the second international competition on computational models of argumentation
From MaRDI portal
Publication:2287197
DOI10.1016/j.artint.2019.103193zbMath1478.68353arXiv1909.00621OpenAlexW2989062896WikidataQ126830473 ScholiaQ126830473MaRDI QIDQ2287197
Thomas Linsbichler, Marco Maratea, Stefan Woltran, Sarah A. Gaggl
Publication date: 20 January 2020
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1909.00621
Logic in artificial intelligence (68T27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Lattice point of view for argumentation framework, A general approach to extension-based semantics in abstract argumentation, On the preferred extensions of argumentation frameworks: bijections with naive sets, Paracoherent Answer Set Semantics meets 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, Acceptance in incomplete argumentation frameworks, Solving Advanced Argumentation Problems with Answer Set Programming, Omission-Based Abstraction for Answer Set Programs, Graded labellings for abstract argumentation
Uses Software
Cites Work
- Unnamed Item
- Looking-ahead in backtracking algorithms for abstract argumentation
- Complexity-sensitive decision procedures for abstract argumentation
- Complexity of semi-stable and stage semantics in argumentation frameworks
- Graph theoretical structures in logic programs and default theories
- Answer set programming based on propositional satisfiability
- Design and results of the Fifth Answer Set Programming Competition
- Argumentation in artificial intelligence
- Computing ideal sceptical argumentation
- The computational complexity of ideal semantics
- On generating all maximal independent sets
- The first international competition on computational models of argumentation: results and analysis
- On the impact of configuration on abstract argumentation automated reasoning
- Coherence in finite argument systems.
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- Complete extensions in argumentation coincide with 3-valued stable models in logic programming
- Methods for solving reasoning problems in abstract argumentation -- a survey
- On the equivalence between logic programming semantics and argumentation semantics
- Parametric properties of ideal semantics
- From structured to abstract argumentation: assumption-based acceptance via AF reasoning
- Emergence of Scaling in Random Networks
- Semi-stable semantics
- A Comparative Test on the Enumeration of Extensions in Abstract Argumentation*
- Solving Set Optimization Problems by Cardinality Optimization with an Application to Argumentation
- Model enumeration in propositional circumscription via unsatisfiable core analysis
- Improved answer-set programming encodings for abstract argumentation
- Not only size, but also shape counts: abstract argumentation solvers are benchmark-sensitive
- Multi-shot ASP solving with clingo
- Computational Complexity
- Theory and Applications of Satisfiability Testing
- Collective dynamics of ‘small-world’ networks
- The Sixth Answer Set Programming Competition