Dung-O-Matic

Dung-O-Matic is an abstract argument comptation engine implemented by the javaDungAF class. javaDungAF supports Dung Argumentation Frameworks and several of their semantics  –

• admissible
• complete
• eager
• grounded
• ideal
• preferred
• semi-stable
• stable
  

javaDungAF is currently just a couple of java classes. Source and documentation are available to download, and the documentation can be also be viewed online.

Anyone interested in the automatic interpretation of Dung frameworks should also see Matt South’s Dungine, a module of his ArgKit library.

You can see javaDungAF in action by using OVAgen, which allows you to doodle an abstract framework and then submit it to a web-service version of javaDungAF and ArgKit and visualize the results.

Acknowledgments. javaDungAF’s functionality draws on or implements existing algorithms –

Admissible semantics –

Vreeswijk, G. A. W. (2006) An algorithm to compute minimally grounded and admissible defence sets in argument systems Proceedings of COMMA06 : 109-120

Grounded semantics –

Dung, P. M. (1995) On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games Artificial Intelligence 77 : 321-357

The development of javaDungAF was also facilitated by other existing work –

Ideal Semantics –

Dung, P.M., Mancarella, P. and Toni, F. (2007) Computing Ideal Sceptical Argumentation Artificial Intelligence 171 : 642-74

Semi-Stable Semantics & Eager Semantics –

Dung, P.M., Mancarella, P. and Toni, F. (2007) Computing Ideal Sceptical Argumentation Artificial Intelligence 171 : 642-74

Caminada, M.W.A. (2007) Comparing Two Unique Extension Semantics for Formal Argumentation: Ideal and Eager Proceedings of BNAIC 2007 : 81-87

Caminada, M.W.A. (2007) An Algorithm for Computing Semi-Stable Semantics Proceedings of ECSQARU 2007 : 222-234