This is about argumentation.
It includes an implementation of backtracking algorithms [1] that operate on Dung's argumentation framework [2] model of the acceptability of arguments.
I want to reason about argument maps expressed as Argument Interchange Format (AIF) [3], so I need a way to translate an AIF argument map to a Dung argumentation framework (DAF) first in order to evaluate it. I use the presumptive arguments method [4].
Argument maps and frameworks are graphs. I use Dover [5] for modelling and manipulating graphs.
I want to order arguments and extensions to support preferences and explanation, so I've implemented a Formal Concept Analysis algorithm [6]. This is general purpose, and can be used independently of the argumentation code.
-
Samer Nofal, Katie Atkinson, Paul E. Dunne. "Looking-ahead in backtracking algorithms for abstract argumentation", International Journal of Approximate Reasoning, Volume 78, 2016. Pages 265-282, ISSN 0888-613X, DOI: 10.1016/j.ijar.2016.07.013.
-
Dung, Phan Minh. "On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games." Artificial intelligence 77.2 (1995): 321-357. DOI: 10.1016/0004-3702(94)00041-X
-
See: Contributing to the Argument Interchange Format, ARG-tech
-
Knox, A. "Explaining presumptive arguments", Dstl Technical Memo (2022), https://dstl.github.io/eleatics/argumentation/explain-framework.pdf
-
Baker, Rob, Alena Frankel, and Peter Rodgers. "Dover: Scalable Algorithms for Graph Mining in Java." (2017). See: https://www.cs.kent.ac.uk/projects/dover/
-
Davey, B. A., Priestley, H. A. "Introduction to Lattices and Order." Cambridge University Press (2002).