Advertisement
Published in:
2012 | OriginalPaper | Chapter
Modeling and Solving AFs with a Constraint-Based Tool: ConArg
Authors : Stefano Bistarelli, Francesco Santini
Published in: Theorie and Applications of Formal Argumentation
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
ConArg
is a tool based on
Constraint Programming
which is able to model and solve different problems related to Argumentation Frameworks (AFs). To practically implement the tool, we have used
JaCoP
, a Java library which provides the user with a
Finite Domain Constraint Programming
paradigm.
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 and stable extensions in AFs. Moreover, we can use the tool to solve some of the preference-based problems presented in literature. ConArg is able to randomly generate networks with small-world properties in order to find Dung’s extensions on such interaction graphs. We present the main features of ConArg and we report the performance in time.