Graph extensions on Arg2p Wiki

conflictArguments

Mon, 01 Jan 0001 00:00:00 +0000

conflictArguments

Graph extensions · Kotlin object ConflictArgumentsModule · library prolog.argumentation.graph.conflicts

The arguments attacking through a conflict argument (module conflictArguments), with metaConflicts: conflicts are then conclusions of the theory, and an argument attacks through the conflicts its conclusion has with others only while their arguments stand.

For each argument for a conflict on the conclusion of an argument, a copy of that argument is made, with mc(ConflictId, Conflict) first among its rules: supported by the conflict argument (and by the supports of the original), it is defeated with it, and it attacks through its conflict only (see the module attackRelation). With metaConflicts only the copies attack.

superiority

Mon, 01 Jan 0001 00:00:00 +0000

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).

rebutRestriction

Mon, 01 Jan 0001 00:00:00 +0000

rebutRestriction

Graph extensions · Kotlin object RebutRestrictionModule · library prolog.argumentation.graph.rebutrestriction

The restricted rebut (module rebutRestriction, a graphExtension): a rebut only succeeds on an argument whose top rule is defeasible.

Calls: argument, graphStore

Predicate	Description
`modifyArgumentationGraph/0`	The restricted attacks on an argument whose top rule is strict are removed

modifyArgumentationGraph/0

modifyArgumentationGraph

The restricted attacks on an argument whose top rule is strict are removed.

bp

Mon, 01 Jan 0001 00:00:00 +0000

bp

Graph extensions · Kotlin object BpModule · library prolog.argumentation.graph.meta.bp

The burdens of proof as part of the graph (module bp, a graphExtension): for an argument for bp(Statement) and an argument for Statement, the burdened one, an argument for -burdmet(Conclusion) (top rule artificial) is attacked as the burden of proof is, and rebuts or is rebutted by the burdened argument, depending on whether the grounded labelling labels it IN.

defeasiblePref

Mon, 01 Jan 0001 00:00:00 +0000

defeasiblePref

Graph extensions · Kotlin object DefeasiblePrefModule · library prolog.argumentation.graph.preferences.defeasible

The preferences between rules as conclusions of the theory (module defeasiblePref, a graphExtension): an argument for sup(Rule, Other) makes the attacks that preference invalidates fail, as long as it stands.

Each attack it may invalidate becomes an argument for attack(Type, Attacker, Attacked, On) (top rule attack), supported by the attacker and attacking in its place; the arguments for the preferences invalidating it attack it (attacks of type pref).

defeasibleAllPref

Mon, 01 Jan 0001 00:00:00 +0000

defeasibleAllPref

Graph extensions · Kotlin object DefeasibleAllPrefModule · library prolog.argumentation.graph.preferences.defeasible.generic

The preferences between rules as conclusions of the theory, taken together (module defeasibleAllPref, a graphExtension): as defeasiblePref, but the attack argument is attacked by an argument for all the preferences invalidating it, preference(Preferences), supported by the arguments for each of them.

Calls: argument, defeasiblePref, graphStore, utils

Predicate	Description
`modifyArgumentationGraph/0`	The attacks the preferences may invalidate, as arguments, attacked by the arguments for the preferences
`queryDependencies/2`	Query mode: the same arguments matter as for defeasiblePref
`queryDependants/2`

modifyArgumentationGraph/0

modifyArgumentationGraph

The attacks the preferences may invalidate, as arguments, attacked by the arguments for the preferences.

standardPref

Mon, 01 Jan 0001 00:00:00 +0000

standardPref

Graph extensions · Kotlin object StandardPrefModule · library prolog.argumentation.graph.preferences.strict

The preferences between the rules of the theory, applied to the attacks (module standardPref, a graphExtension): an attack fails when the attacked argument is superior to the attacker (see the module superiority).

Calls: graphStore, superiority

Predicate	Description
`modifyArgumentationGraph/0`	The attacks failing for the preferences are removed

modifyArgumentationGraph/0

modifyArgumentationGraph

The attacks failing for the preferences are removed. Attacks are visited by argument identifiers, and arguments are compared by their info only: the whole arguments are only retrieved to remove an attack.

abaPref

Mon, 01 Jan 0001 00:00:00 +0000

abaPref

Graph extensions · Kotlin object AbaPrefModule · library prolog.argumentation.graph.preferences.aba

The preferences between the assumptions of ABA+ (module abaPref, a graphExtension, of the profile aba_plus; Čyras and Toni 2016): sup(Stronger, Weaker), closed transitively. An attack on an assumption by an argument resting on an assumption weaker than it is reversed: it is removed, and the argument for the stronger assumption attacks every argument whose support (its assumptions, see the module abaLanguage) contains the whole support of the attacker. The reversal hits the arguments resting on the same assumptions as the attacker, not only the attacker: as ABA+ reverses attacks between sets of assumptions, and the arguments do not share a sub-argument for those sets. That holds on the theories satisfying Weak Contraposition (Čyras and Toni 2016, Axiom 4), and those failing it are refused: their semantics are those of sets of assumptions, which the arguments do not capture.