Knowledge Representation and
Automated Reasoning Lab


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.
ConArg website