attackCandidates

Graph · Kotlin object AttackCandidatesModule · library prolog.argumentation.attack.candidates

The statements whose arguments may attack an argument, or be attacked by it (module attackCandidates): the graph builders only check the attacks (see the module attackRelation) between an argument and the arguments for these statements, and query mode explores them.

• Calls: argument, conflict, parser
• Called by: attackBuilder, structuredPartial, queryExploration

possibleAttackers/3

possibleAttackers(+Id, +Argument, -Statement)

findPossibleAttackers/2 for the argument with identifier Id, looked for once: query mode looks for them to build the graph, and again to build the attacks.

forgetPossibleAttackers/0

forgetPossibleAttackers

The possible attackers looked for forgotten: with arguments for conflicts built since (metaConflicts), they may be more.

findPossibleAttackers/2

findPossibleAttackers(+Argument, -Statement)

The arguments for Statement may attack Argument: Statement conflicts with its conclusion or its top rule, it is the contrary of a premise of its top rule, or it undercuts its top rule.

possiblyAttacked/2

possiblyAttacked(+Argument, -Statement)

Argument may attack the arguments for Statement (the converse of findPossibleAttackers/2): those in conflict with its conclusion, the conclusions of the rules it undercuts and of the rules with its conclusion as a contrary premise.

attackDependency/2

attackDependency(+Argument, -Statement)

With metaConflicts the conflicts are themselves conclusions: Argument depends on the arguments for Statement, which make others conflict with it.

attackDependant/2

attackDependant(+Argument, -Statement)

With metaConflicts, the arguments for Statement depend on Argument: those its conclusion makes conflict with others, and, for an argument for a conflict, those it makes conflict.