ConArg2: A Constraint-based Tool for Abstract Argumentation. ConArg2 is a Constraint-programming tool oriented to the solution of problems related to extension-based semantics in Abstract Argumentation. It exploits Gecode, an efficient C++ toolkit for developing constraint-based systems and applications. The properties required by semantics are encoded into constraints, and arguments are assigned to 1 (i.e.,true ) if belonging to a valid extension for that semantics. Searching for solutions of problems (as enumerating extensions or checking argument-acceptance) takes advantage of well-known techniques as local consistency, different heuristics for trying to assign values to variables, and complete search-tree with branch-and-bound.
Keywords for this software
References in zbMATH (referenced in 6 articles )
Showing results 1 to 6 of 6.
- Bistarelli, Stefano; Taticchi, Carlo: Introducing a tool for concurrent argumentation (2021)
- Mantadelis, Theofrastos; Bistarelli, Stefano: Probabilistic abstract argumentation frameworks, a possible world view (2020)
- Bistarelli, Stefano; Santini, Francesco; Taticchi, Carlo: Local expansion invariant operators in argumentation semantics (2019)
- Thimm, Matthias; Villata, Serena: The first international competition on computational models of argumentation: results and analysis (2017)
- Charwat, Günther; Dvořák, Wolfgang; Gaggl, Sarah A.; Wallner, Johannes P.; Woltran, Stefan: Methods for solving reasoning problems in abstract argumentation -- a survey (2015)
- Bistarelli, Stefano; Rossi, Fabio; Santini, Francesco: Enumerating extensions on random abstract-AFs with ArgTools, ASPARTIX, ConArg2, and Dung-O-Matic (2014)