Conarg website updated.
Support added for probabilistic AFs
Grid snap now available (ctrl+R).
updated to Gecode 6.0.1
Updated to conform ICCMA19 output requisites
for Windows published
New release of Conarg
for Windows published
updated to Gecode
Acceptance support for semiring Weighted and Fuzzy implemented. Grounded for
other semirings than Dung corrected.
Published ConargLibrary (download page
Eager implemented. Added suuport for cred/scept to Eager and Ideal
Publications list updated
Many improving and bug fixing updates
Improved w-defense support for alpha semantics available in the download version.
Benchmark networks donwload available.
Version update: version 0.9b (Build 8) released.
Support for credulous/skeptical
acceptance on admissible, complete and stable semantics inserted.
Version update: support for alpha-complete, alpha-admissible and alpha-stable extensions inserted (experimental).
Conarg is a suite of tools that help argumentation scientists to
- compute semantics,
- visualize Argumentation Frameworks (AF) and computed extensions,
- program user application using a predefined AF library,
- study property of Semantics and AFs.
ConArg is a tool, based on Constraint Programming
(built on Gecode), that is able to solve various problems
related to the (Weighted) Abstract Argumentation Frameworks (AFs).
Constraint Satisfaction Problems (CSPs) offer a wide number of efficient techniques
(as inference and search algorithms) that can tackle the complexity in finding all the
possible Dung’s conflict-free, admissible, complete, stable, preferred, grounded, semi-stable,
eager, stage, ideal
extensions in AFs.
Moreover, we can use the tool to solve some computationally hard problems.
ConArgLibrary is a C++ library that
provides an API for Abstract Argumentation
problems solving (enumeration, existence, acceptance, verification, non-emptyness).
The web interface allows to represent AFs and to compute sets of extensions for the implemented semantics. It is possible to draw an AF by adding arguments and attacks step by step directly on the interface. The obtained solutions are displayed in the output panel and it is possible to copy or download them.
Rob is a tool alble to display a lattice of AFs with chosen characteristics, as number of arguments and attack types. Every AF can be studied according to its set of extensions w.r.t. different semantics and in comparison with other AFs.