@conference{
	11391_313897,
	author = {Bistarelli, Stefano and Santini, Francesco},
	title = {Modeling and Solving AFs with a Constraint-Based Tool: ConArg},
	year = {2012},
	publisher = {Springer-Verlag},
	volume = {7132},
	booktitle = {Theorie and Applications of Formal Argumentation - First International Workshop, TAFA 2011},
	abstract = {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.},
	doi = {10.1007/978-3-642-29184-5_7},	
	pages = {99--116}
}

{"_id":"2w2Zr7skigZojyoyg","bibbaseid":"bistarelli-santini-modelingandsolvingafswithaconstraintbasedtoolconarg-2012","author_short":["Bistarelli, S.","Santini, F."],"bibdata":{"bibtype":"conference","type":"conference","author":[{"propositions":[],"lastnames":["Bistarelli"],"firstnames":["Stefano"],"suffixes":[]},{"propositions":[],"lastnames":["Santini"],"firstnames":["Francesco"],"suffixes":[]}],"title":"Modeling and Solving AFs with a Constraint-Based Tool: ConArg","year":"2012","publisher":"Springer-Verlag","volume":"7132","booktitle":"Theorie and Applications of Formal Argumentation - First International Workshop, TAFA 2011","abstract":"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.","doi":"10.1007/978-3-642-29184-5_7","pages":"99–116","bibtex":"@conference{\n\t11391_313897,\n\tauthor = {Bistarelli, Stefano and Santini, Francesco},\n\ttitle = {Modeling and Solving AFs with a Constraint-Based Tool: ConArg},\n\tyear = {2012},\n\tpublisher = {Springer-Verlag},\n\tvolume = {7132},\n\tbooktitle = {Theorie and Applications of Formal Argumentation - First International Workshop, TAFA 2011},\n\tabstract = {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.},\n\tdoi = {10.1007/978-3-642-29184-5_7},\t\n\tpages = {99--116}\n}\n","author_short":["Bistarelli, S.","Santini, F."],"key":"11391_313897","id":"11391_313897","bibbaseid":"bistarelli-santini-modelingandsolvingafswithaconstraintbasedtoolconarg-2012","role":"author","urls":{},"metadata":{"authorlinks":{}},"downloads":0,"html":""},"bibtype":"conference","biburl":"http://www.dmi.unipg.it/~bista/papers/pubblicazioni.bib","dataSources":["GhB5rb8JzW6az3exo"],"keywords":[],"search_terms":["modeling","solving","afs","constraint","based","tool","conarg","bistarelli","santini"],"title":"Modeling and Solving AFs with a Constraint-Based Tool: ConArg","year":2012}