Labelling

The semantics labelling the arguments, and the statements from them.

ModulePredicatesDescription
grounded3The grounded labelling (module grounded, an argumentLabellingMode, the default one): the least fixpoint of IN the arguments whose attackers are all OUT and OUT those attacked by an IN one, computed natively (groundedFixpoint)
complete2The complete labellings (module complete, an argumentLabellingMode): the admissible ones labelling IN every argument they defend, built one strongly connected component at a time (see the module scc)
preferred2The preferred labellings (module preferred, an argumentLabellingMode): the admissible ones with a maximal set of IN arguments, built one strongly connected component at a time (see the module scc)
semistable2The semi-stable labellings (module semistable, an argumentLabellingMode): the preferred ones with a minimal set of UND arguments
stable2The stable labellings (module stable, an argumentLabellingMode): those leaving no argument UND, built one strongly connected component at a time (see the module scc)
ideal2The ideal labelling (module ideal, an argumentLabellingMode): the maximal admissible subset of the arguments IN in every preferred labelling
eager2The eager labelling (module eager, an argumentLabellingMode): the maximal admissible subset of the arguments IN in every semi-stable labelling
naive3The naive labellings (module naive, an argumentLabellingMode): the conflict-free ones with a maximal set of IN arguments
stage2The stage labellings (module stage, an argumentLabellingMode): the naive ones with a minimal set of UND arguments
cf23The cf2 labellings (module cf2, an argumentLabellingMode): the naive labellings of each strongly connected component, the components taken in turn once the arguments attacked by the previous ones are suppressed
stage22The stage2 labellings (module stage2, an argumentLabellingMode): as cf2, with the stage labellings in each strongly connected component
conflictfree6The conflict-free labellings (module conflictfree, an argumentLabellingMode): a set of arguments IN, none attacking another one, those they attack OUT and the rest UND
admissible5The admissible labellings (module admissible, an argumentLabellingMode): the conflict-free ones in which every attacker of an IN argument is attacked by an IN argument
stronglyadmissible3The strongly admissible labellings (module stronglyadmissible, an argumentLabellingMode): the admissible ones whose IN arguments are defended, step by step, starting from the unattacked ones
scc3Support module of the SCC-recursive semantics (complete, preferred, stable): their labellings are built one strongly connected component at a time, the semantics only choosing which local labellings to keep
bp_grounded9The grounded labelling with burdens of persuasion (module bp_grounded, an argumentLabellingMode, ICAIL): as the grounded one, but an argument for a statement under a burden of persuasion that is not IN is OUT rather than UND
bp_grounded_partial3The partial labelling with burdens of persuasion (module bp_grounded_partial, an argumentLabellingMode, ICLP): each argument labelled IN*, OUT* or UND* by the conditions of the burdens on its conclusion and its complement
bp_grounded_complete2The complete labelling with burdens of persuasion (module bp_grounded_complete, an argumentLabellingMode, ICLP): the partial labelling, then the grounded labelling of its UND arguments, repeated until nothing changes
statement1The labels of the statements from those of their arguments (module statement, a statementLabellingMode): a statement is IN if an argument for it is IN, otherwise OUT if one is OUT, otherwise UND if one is UND
statement_pass_through1The labels of the statements passed through from those of their arguments (module statement_pass_through, a statementLabellingMode): a statement takes the label of each of its arguments, so it may have several
statement_binary1Two labels for the statements (module statement_binary, a statementLabellingMode): IN if an argument for the statement is IN, OUT otherwise