Inferring from Inconsistency in Preference-Based Argumentation Frameworks
Journal of Automated Reasoning
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Possibilistic-Based Argumentation: An Answer Set Programming Approach
ENC '08 Proceedings of the 2008 Mexican International Conference on Computer Science
ASPARTIX: Implementing Argumentation Frameworks Using Answer-Set Programming
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Reasoning about preferences in argumentation frameworks
Artificial Intelligence
Inconsistency tolerance in weighted argument systems
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Proceedings of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006
An anytime algorithm for optimal coalition structure generation
Journal of Artificial Intelligence Research
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
A Common Computational Framework for Semiring-based Argumentation Systems
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Finding partitions of arguments with Dung's properties via SCSPs
Proceedings of the 2011 ACM Symposium on Applied Computing
Solving weighted argumentation frameworks with soft constraints
CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
Argumentation frameworks as constraint satisfaction problems
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
ConArg: A Constraint-Based Computational Framework for Argumentation Systems
ICTAI '11 Proceedings of the 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence
Coalitions of Arguments: An Approach with Constraint Programming
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
| Hi-index | 0.00 |
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.