One of the real issues with Argumentation is the lack of any canonical theory for defeat. My work has so far started to look at how we construct arguments from information; the much more difficult question is how we decide whether one argument defeats another one.
As a result, since we don't always know how to determine if one argument beats another, we often end up having to to look at the number of arguments involved. We can do this just by counting (not good, but as recommended by Benjamin Franklin) or by doing something more complex, like set defeat (Dung-style, where essentially the biggest group of coherent arguments win*). In this situation, the bugbear of argumentation is symmetry: equal numbers of arguments on both sides, and since we can't determine whether one beats the other, we have deadlock.
Ways round this are to:
* Decide how one argument beats another (e.g. value-based)
* Make sure your system is asymmetric
This is where the use of ontologies becomes interesting: There is an inherent asymmentry in an ontology, in that if we have a class structure with:
a
|
------ b
|
------ c
(where b & c are subclasses of a) then an argument for b is necessarily an argument for a, whereas the opposite is not true**. This then provides us with an in built method of generating asymmetric argument frameworks: If we have an argument for b, and an argument for and against a, we derive an additional argument for a, and hence we are now asymmentric at the level of a.
The other interpretation is to include the level of subject in the argument as some form of value (similar to the idea of specificity in arguments, which has been around for a while). This has some nice properties: It stops us developing endless arguments for the top point of the ontology (such as owl:Thing), which is a fairly vacuous exercise. The problem comes in comparing specificities across different branches of an ontology - the only solution I can come up with at the moment is to normalise the metric not just over the distance from
or , but over some compound such as distance(class, top)/ distance (top, bottom, this tree branch).
Either way, the asymmentry generated by the use of an ontology takes us a little closer to having something useful.
* Although it isn't normally presented like this, it holds if each argument has the same 'valency'; otherwise, the set with the greatest valency will tend to win, assuming arguments' targets for attack are distributed at random.
** This assumes that we are only dealing with class/ subclass (IS-A) relationships; if we include other useful relationships (such as partOf/ hasPart) we might see some other patterns.