[Dung-O-Matic will be available shortly]
Dung-O-Matic interprets Dung Argumentation Frameworks. Given a Dung framework, it can identify several extensions -
It can also say whether any set of arguments in the framework is an admissible set and, if so, whether it is a preferred extension.
Of course it can also answer corresponding questions about any argument arg in the framework -
We hope to extend Dung-O-Matic to handle more semantics. The original aim was for something that handled the admissibility-based unique-extension semantics — the grounded, eager and ideal — and Dung-O-Matic’s current functionality reflects that aim.
Anyone interested in the automatic interpretation of Dung frameworks should also see Matt South’s Dungine, a module of his ArgKit library.
Acknowledgments. Dung-O-Matic’s core functionality is based on existing algorithms. Original work is almost entirely limited to short-cuts. The sources of the algorithms are as follows.
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
Ideal Semantics -
Dung, P.M., Mancarella, P. and Toni, F. (2007) Computing Ideal Sceptical Argumentation Artificial Intelligence 171 : 642-74
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
Semi-Stable Semantics -
Caminada, M.W.A. (2007) An Algorithm for Computing Semi-Stable Semantics Proceedings of ECSQARU 2007 : 222-234