Within the last decade, abstract argumentation has emerged as a central field in Artificial Intelligence. Besides providing a core formalism for many advanced argumentation systems …
A Niskanen, M Järvisalo - International Conference on …, 2020 - researchportal.helsinki.fi
We describe the µ–toksia argumentation reasoning system. The system supports a range of different reasoning tasks over both standard and dynamic abstract argumentation …
Boolean Satisfiability (SAT) is arguably the archetypical NP-complete decision problem. Progress in SAT solving algorithms has motivated an ever increasing number of practical …
This paper presents a novel SAT-based approach for the computation of extensions in abstract argumentation, with focus on preferred semantics, and an empirical evaluation of its …
P Besnard, C Cayrol… - Argument & …, 2020 - content.iospress.com
In 1995, in his seminal paper introducing the abstract argumentation framework, Dung has also established the first relationship between this framework and a logical framework (in …
In this paper we illustrate the design choices that led to the development of ArgSemSAT, the winner of the preferred semantics track at the 2017 International Competition on …
D Doder, S Woltran - International Conference on Scalable Uncertainty …, 2014 - Springer
Abstract argumentation is nowadays a vivid field within artificial intelligence and has seen different developments recently. In particular, enrichments of the standard Dung frameworks …
C Cayrol, MC Lagasquie-Schiex - International Journal on Artificial …, 2020 - World Scientific
We propose a logical encoding of argumentation frameworks with higher-order interactions (ie. attacks/supports whose targets are arguments or other attacks/supports) with an …
Abstract Minimal Unsatisfiable Subsets (MUSes) and Minimal Correction Subsets (MCSes) are essential tools for the analysis of unsatisfiable formulas. MUSes and MCSes find a …