ArgTools: a backtracking-based solver for abstract argumentation
نویسندگان
چکیده
We present ArgTools, a system for reasoning with abstract argumentation frameworks. The system solves a number of argumentation problems under preferred, stable, complete and grounded semantics. ArgTools is a C++ implementation of a backtracking algorithm.
منابع مشابه
Enumerating Extensions on Random Abstract-AFs with ArgTools, Aspartix, ConArg2, and Dung-O-Matic
We compare four different implementations of reasoning tools dedicated to Abstract Argumentation Frameworks. These systems are ArgTools, ASPARTIX, ConArg2, and Dung-O-Matic. They have been tested over three different models of randomly-generated graph models, corresponding to the Erdős-Rényi model, the Kleinberg small-world model, and the scale-free Barabasi-Albert model. This first comparison ...
متن کاملHeuristic Search Algorithms for Abstract Argumentation Masterarbeit
This thesis aims at exploring the potential of heuristic search algorithms for Abstract Argumentation. Therefore specific backtracking search algorithms are presented, which support the use of heuristics. Thereafter several heuristics are defined which have been implemented as part of this thesis. These will then be experimentally compared among each other and with other approaches to Abstract ...
متن کاملTowards a Common Framework for Dialectical Proof Procedures in Abstract Argumentation
We present a common framework for dialectical proof procedures for computing credulous, grounded, ideal and sceptical preferred semantics of abstract argumentation. The framework is based on the notions of dispute derivation and base derivation. Dispute derivation is a dialectical notion first introduced for computing credulous semantics in assumption-based argumentation, and adapted here for c...
متن کاملOn the impact of configuration on abstract argumentation automated reasoning
In this paper we consider the impact of configuration of abstract argumentation reasoners both when using a single solver and choosing combinations of framework representation–solver options; and also when composing portfolios of algorithms. To exemplify the impact of the framework–solver configuration we consider one of the most configurable solvers, namely ArgSemSAT—runner-up of the last comp...
متن کاملIngredients of the Argumentation Reasoner pyglaf: Python, Circumscription, and Glucose to Taste
The fundamental mechanism that humans use in argumentation can be formalized in abstract argumentation frameworks. Many semantics are associated with abstract argumentation frameworks, each one consisting of a set of extensions, that is, a set of sets of arguments. Some of these semantics are based on preference relations that essentially impose to maximize or minimize some property. This paper...
متن کامل