Computing credulous acceptance and rejection in argumentation

I 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
  • Version 0.94 (or zipped) : available online May 28, 2009
    • Added example showing that all listed extension types are different.
  • Version 0.93 : available online May 27, 2009
    • Added listing of stable and semi-stable extensions. Refined gluing of proofs and refutations.
  • Version 0.92 : available online May 19, 2006
    • Stop condition cleaned up.
  • Version 0.9 : available online May 18, 2006
Publication
  • Go to a paper about the algorithm presented at IJCAI 2007
Bart Verheij's home page - research - publications