superiority

Graph extensions · Kotlin object SuperiorityModule · library prolog.argumentation.superiority

When an argument is superior to another one (module superiority), by the preferences between their rules (sup(Rule, Other) in the context). Two arguments are compared on their defeasible rules and premises (their info, see the module argument): the last defeasible rules or all of them (orderingPrinciple last or weakest), compared as sets by orderingComparator (elitist, democrat or normal).

PredicateDescription
superiorArgument/2A is superior to B
superiorArgument/3A is superior to B, by the preferences between rules Preferences (sup/2 terms, a set): each justification of the superiority in turn, [] if it needs no preference
justifications/3The sets of preferences by which the arguments with info InfoA are superior to those with info InfoB, each a set, without duplicates (none if they are not): computed once for each pair (justified/3 in the context)
superiorInfo/3The arguments with info InfoA are superior to those with info InfoB, by the preferences Preferences

superiorArgument/2

superiorArgument(+A, +B)

A is superior to B.

superiorArgument/3

superiorArgument(+A, +B, -Preferences)

A is superior to B, by the preferences between rules Preferences (sup/2 terms, a set): each justification of the superiority in turn, [] if it needs no preference.

justifications/3

justifications(+InfoA, +InfoB, -Justifications)

The sets of preferences by which the arguments with info InfoA are superior to those with info InfoB, each a set, without duplicates (none if they are not): computed once for each pair (justified/3 in the context).

superiorInfo/3

superiorInfo(+InfoA, +InfoB, -Preferences)

The arguments with info InfoA are superior to those with info InfoB, by the preferences Preferences. Superiority only depends on the info of the arguments, much smaller and more often shared than whole arguments: it is computed on them, once for each pair (superior/4 in the context).