Computing credulous acceptance and rejection in argumentationI have developed software that computes credulous acceptance and rejection for Dung-style argumentation frameworks. The program can be downloaded as an executable or as a zipped file. The program has been built using Delphi 7 under Windows XP and contains a set of test examples most of which were collected by Gerard Vreeswijk.The program computes minimal admissible sets containing and attacking the arguments in a theory. It also produces the grounded extension and all preferred extensions (which include the stable extensions and also the semi-stable extensions; see the notes). Here are some brief notes about the tool. The algorithm is described in a paper presented at IJCAI 2007. Version history
Bart Verheij's home page - research - publications |