Labelling on Arg2p Wiki

grounded

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

grounded

Labelling · Kotlin object GroundedModule · library prolog.argumentation.graph.labelling.grounded

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

Called by: bp, scc

Predicate	Description
`locality/1`	Query mode: the label of an argument only depends on the arguments it depends on (directionality)
`argumentLabelling/0`	The grounded labelling, in the active context
`groundedFixpoint/0`	Extends the IN/OUT labelling of the active context to the grounded fixpoint, labelling UND the arguments left

locality/1

locality(-Locality)

Query mode: the label of an argument only depends on the arguments it depends on (directionality)

complete

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

complete

Labelling · Kotlin object CompleteModule · library prolog.argumentation.graph.labelling.complete

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

Calls: scc

Predicate	Description
`locality/1`	Query mode: the label of an argument only depends on the arguments it depends on (directionality)
`argumentLabelling/0`	Each complete labelling in turn, left as the active context

locality/1

locality(-Locality)

Query mode: the label of an argument only depends on the arguments it depends on (directionality)

preferred

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

preferred

Labelling · Kotlin object PreferredModule · library prolog.argumentation.graph.labelling.preferred

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

Calls: scc
Called by: semistable, ideal

Predicate	Description
`locality/1`	Query mode: the label of an argument only depends on the arguments it depends on (directionality)
`argumentLabelling/0`	Preferred labellings are SCC-recursive: built component by component, keeping the admissible local labellings with a maximal set of IN arguments

locality/1

locality(-Locality)

Query mode: the label of an argument only depends on the arguments it depends on (directionality)

semistable

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

semistable

Labelling · Kotlin object SemistableModule · library prolog.argumentation.graph.labelling.semistable

The semi-stable labellings (module semistable, an argumentLabellingMode): the preferred ones with a minimal set of UND arguments.

Calls: conflictfree, graphStore, preferred, utils
Called by: eager

Predicate	Description
`locality/1`	Query mode: not directional, but the labellings of unconnected parts of the graph are independent: the label of an argument depends on the arguments connected to it, in either direction
`argumentLabelling/0`	Semi-stable labellings are the preferred ones with a minimal set of UND arguments (an admissible set with a maximal range is a maximal admissible set)

locality/1

locality(-Locality)

Query mode: not directional, but the labellings of unconnected parts of the graph are independent: the label of an argument depends on the arguments connected to it, in either direction

stable

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

stable

Labelling · Kotlin object StableModule · library prolog.argumentation.graph.labelling.stable

The stable labellings (module stable, an argumentLabellingMode): those leaving no argument UND, built one strongly connected component at a time (see the module scc).

Calls: scc

Predicate	Description
`locality/1`	Query mode: stable labellings depend on the whole graph (an odd cycle anywhere leaves none)
`argumentLabelling/0`	Stable labellings are SCC-recursive: built component by component, leaving no argument UND

locality/1

locality(-Locality)

Query mode: stable labellings depend on the whole graph (an odd cycle anywhere leaves none)

ideal

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

ideal

Labelling · Kotlin object IdealModule · library prolog.argumentation.graph.labelling.ideal

The ideal labelling (module ideal, an argumentLabellingMode): the maximal admissible subset of the arguments IN in every preferred labelling.

Calls: admissible, conflictfree, graphStore, preferred, utils

Predicate	Description
`locality/1`	Query mode: the label of an argument only depends on the arguments it depends on (directionality)
`argumentLabelling/0`	The ideal labelling has IN the maximal admissible subset of the intersection of the preferred extensions

locality/1

locality(-Locality)

Query mode: the label of an argument only depends on the arguments it depends on (directionality)

eager

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

eager

Labelling · Kotlin object EagerModule · library prolog.argumentation.graph.labelling.eager

The eager labelling (module eager, an argumentLabellingMode): the maximal admissible subset of the arguments IN in every semi-stable labelling.

Calls: admissible, conflictfree, graphStore, semistable, utils

Predicate	Description
`locality/1`	Query mode: not directional, but the labellings of unconnected parts of the graph are independent: the label of an argument depends on the arguments connected to it, in either direction
`argumentLabelling/0`	The eager labelling has IN the maximal admissible subset of the intersection of the semi-stable extensions

locality/1

locality(-Locality)

Query mode: not directional, but the labellings of unconnected parts of the graph are independent: the label of an argument depends on the arguments connected to it, in either direction

naive

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

naive

Labelling · Kotlin object NaiveModule · library prolog.argumentation.graph.labelling.naive

The naive labellings (module naive, an argumentLabellingMode): the conflict-free ones with a maximal set of IN arguments.

Calls: conflictfree, graphStore
Called by: stage

Predicate	Description
`locality/1`	Query mode: not directional, but the labellings of unconnected parts of the graph are independent: the label of an argument depends on the arguments connected to it, in either direction
`argumentLabelling/0`	Each naive labelling in turn, left as the active context
`naiveSubset/4`	The maximal conflict-free subsets of Args including Forced, each once: every argument of Args left out either attacks itself or conflicts with an argument of Set or In (already IN)

locality/1

locality(-Locality)

Query mode: not directional, but the labellings of unconnected parts of the graph are independent: the label of an argument depends on the arguments connected to it, in either direction

stage

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

stage

Labelling · Kotlin object StageModule · library prolog.argumentation.graph.labelling.stage

The stage labellings (module stage, an argumentLabellingMode): the naive ones with a minimal set of UND arguments.

Calls: conflictfree, graphStore, naive, utils

Predicate	Description
`locality/1`	Query mode: not directional, but the labellings of unconnected parts of the graph are independent: the label of an argument depends on the arguments connected to it, in either direction
`argumentLabelling/0`	Stage labellings are the naive ones with a minimal set of UND arguments

locality/1

locality(-Locality)

Query mode: not directional, but the labellings of unconnected parts of the graph are independent: the label of an argument depends on the arguments connected to it, in either direction

cf2

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

cf2

Labelling · Kotlin object Cf2Module · library prolog.argumentation.graph.labelling.cf2

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

Calls: graphStore, utils
Called by: stage2

Predicate	Description
`locality/1`	Query mode: the label of an argument only depends on the arguments it depends on (directionality)
`argumentLabelling/0`	Each cf2 labelling in turn, left as the active context
`compute/1`	Each labelling built with the labellings Base (naive or stage) of each component, left as the active context

locality/1

locality(-Locality)

Query mode: the label of an argument only depends on the arguments it depends on (directionality)

stage2

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

stage2

Labelling · Kotlin object Stage2Module · library prolog.argumentation.graph.labelling.stage2

The stage2 labellings (module stage2, an argumentLabellingMode): as cf2, with the stage labellings in each strongly connected component.

Calls: cf2

Predicate	Description
`locality/1`	Query mode: the label of an argument only depends on the arguments it depends on (directionality)
`argumentLabelling/0`	Each stage2 labelling in turn, left as the active context

locality/1

locality(-Locality)

Query mode: the label of an argument only depends on the arguments it depends on (directionality)

conflictfree

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

conflictfree

Labelling · Kotlin object ConflictFreeModule · library prolog.argumentation.graph.labelling.conflictfree

The conflict-free labellings (module conflictfree, an argumentLabellingMode): a set of arguments IN, none attacking another one, those they attack OUT and the rest UND. The other semantics take from it the arguments to label and the labelling of a set.

Calls: graphStore
Called by: semistable, ideal, eager, naive, stage, admissible

Predicate	Description
`locality/1`	Query mode: the label of an argument only depends on the arguments it depends on (directionality)
`argumentLabelling/0`	Each conflict-free labelling in turn, left as the active context
`candidates/2`	The arguments to label, and those among them already IN (kept IN)
`labelSet/2`	In a new branch of Branch, Set IN, the arguments it attacks OUT, the rest UND; the branch is released on backtracking
`conflictFreeSubset/3`	The subsets of Args including Forced where no argument attacks another one (itself included), each once
`newLabelling/2`	In a new branch of Branch (left active), the arguments of Ids IN, the unlabelled arguments attacked by an IN one OUT, and the other unlabelled ones UND, asserted with a single context_assert_all

locality/1

locality(-Locality)

Query mode: the label of an argument only depends on the arguments it depends on (directionality)

admissible

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

admissible

Labelling · Kotlin object AdmissibleModule · library prolog.argumentation.graph.labelling.admissible

The admissible labellings (module admissible, an argumentLabellingMode): the conflict-free ones in which every attacker of an IN argument is attacked by an IN argument.

Calls: conflictfree
Called by: ideal, eager, stronglyadmissible, scc

Predicate	Description
`locality/1`	Query mode: the label of an argument only depends on the arguments it depends on (directionality)
`argumentLabelling/0`	Each admissible labelling in turn, left as the active context
`admissibleSet/0`	Every attacker of an IN argument is attacked by an IN argument other than itself
`admissibleSet/1`	Every attacker of an IN argument, or of an argument in Ids, is attacked by one of them other than itself (the arguments in Ids taken as IN)
`maximalAdmissibleSubset/2`	The largest admissible subset of the conflict-free set Ids, removing the arguments with an attacker not attacked by the remaining ones until none is left (a greatest fixpoint, polynomial)

locality/1

locality(-Locality)

Query mode: the label of an argument only depends on the arguments it depends on (directionality)

stronglyadmissible

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

stronglyadmissible

Labelling · Kotlin object StronglyAdmissibleModule · library prolog.argumentation.graph.labelling.stronglyadmissible

The strongly admissible labellings (module stronglyadmissible, an argumentLabellingMode): the admissible ones whose IN arguments are defended, step by step, starting from the unattacked ones.

Calls: admissible

Predicate	Description
`locality/1`	Query mode: the label of an argument only depends on the arguments it depends on (directionality)
`argumentLabelling/0`	Each strongly admissible labelling in turn, left as the active context
`stronglyAdmissibleSet/0`	Every IN argument is reachable from the unattacked ones, iteratively adding the IN arguments whose attackers are all attacked by those added so far

locality/1

locality(-Locality)

Query mode: the label of an argument only depends on the arguments it depends on (directionality)

scc

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

scc

Labelling · Kotlin object SccModule · library prolog.argumentation.graph.labelling.scc

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

Calls: admissible, graphStore, grounded, utils
Called by: complete, preferred, stable

Predicate	Description
`label/2`	Labellings built one strongly connected component at a time, in topological order
`undecidedCandidates/3`	The UND arguments of Scc in Branch that can be forced IN, those not attacked by an UND argument of a previous component (nothing left could defend them)
`selection/4`	The branches of the local labellings in Explored (a list of Branch-Ok) kept by Select: all the accepted ones, or the accepted ones whose IN arguments in Scc are maximal

label/2

label(+Accept, +Select)

Labellings built one strongly connected component at a time, in topological order. The labels of a component only depend on the components before it, and are final once it is left. Within a component the search forces IN its undecided arguments (grounded propagation labels the rest), then keeps the local labellings that pass Accept and Select: Accept admissible - the IN arguments are defended decided - admissible, and no argument of the component left UND Select all - every accepted local labelling maximal - the accepted ones with a maximal set of IN arguments in the component Each solution leaves its labelling as the active context, released when the next one is computed.

bp_grounded

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

bp_grounded

Labelling · Kotlin object BpGroundedModule · library prolog.argumentation.graph.labelling.bpgrounded

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

Calls: argument, graphStore, superiority, utils
Called by: bp, bp_grounded_partial, bp_grounded_complete

Predicate	Description
`locality/1`	Query mode: not known to be directional (the burdens of proof order the arguments along the attacks), the label of an argument is taken to depend on the arguments connected to it, in either direction
`argumentLabelling/0`	The labelling, in the active context, the burdens of persuasion (abstractBp/1) reified first
`groundedLabelling/1`	The grounded labelling of Arguments, the arguments not labelled yet, on the labels of the others (the complete labelling with burdens of persuasion labels so the UND arguments of the partial one)
`allAttacksOUT/1`	Every attacker of Argument is OUT
`oneAttackIN/1`	An attacker of Argument is IN, or Argument attacks an IN argument
`isInBurdenOfProof/1`	A burden of persuasion is on Conclusion
`isArgumentInBurdenOfProof/1`	A burden of persuasion is on the conclusion of Argument
`argumentChain/2`	B is A or an argument reached from A through attacks; the arguments are visited breadth first, each once (attack cycles are common: rebuttals are mutual)
`reifyBurdenOfProofs/0`	The burdens of persuasion of the theory (abstractBp/1) on the conclusions of the saved arguments, as reifiedBp/1 in the context

locality/1

locality(-Locality)

Query mode: not known to be directional (the burdens of proof order the arguments along the attacks), the label of an argument is taken to depend on the arguments connected to it, in either direction

bp_grounded_partial

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

bp_grounded_partial

Labelling · Kotlin object BpGroundedPartialModule · library prolog.argumentation.graph.labelling.bpgroundedpartial

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

Calls: argument, bp_grounded, conflict, debug, graphStore, superiority, utils
Called by: bp_grounded_complete

Predicate	Description
`locality/1`	Query mode: not known to be directional (the burdens of proof order the arguments along the attacks), the label of an argument is taken to depend on the arguments connected to it, in either direction
`argumentLabelling/0`	The labelling, in the active context
`partialBpLabelling/1`	The labels of Arguments, the most grounded first, deciding first the arguments the label of each depends on

locality/1

locality(-Locality)

Query mode: not known to be directional (the burdens of proof order the arguments along the attacks), the label of an argument is taken to depend on the arguments connected to it, in either direction

bp_grounded_complete

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

bp_grounded_complete

Labelling · Kotlin object BpGroundedCompleteModule · library prolog.argumentation.graph.labelling.bpgroundedcomplete

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

Calls: bp_grounded, bp_grounded_partial, graphStore, utils

Predicate	Description
`locality/1`	Query mode: not known to be directional (the burdens of proof order the arguments along the attacks), the label of an argument is taken to depend on the arguments connected to it, in either direction
`argumentLabelling/0`	The labelling, in the active context

locality/1

locality(-Locality)

Query mode: not known to be directional (the burdens of proof order the arguments along the attacks), the label of an argument is taken to depend on the arguments connected to it, in either direction

statement

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

statement

Labelling · Kotlin object StatementModule · library prolog.argumentation.graph.labelling.statement

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

Calls: argument, graphStore

Predicate	Description
`statementLabelling/0`	The labels of the statements (see graphStore::labelStatement/2): IN those with an argument IN, then OUT those with an argument OUT, then UND those with an argument UND

statementLabelling/0

statementLabelling

The labels of the statements (see graphStore::labelStatement/2): IN those with an argument IN, then OUT those with an argument OUT, then UND those with an argument UND.

statement_pass_through

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

statement_pass_through

Labelling · Kotlin object StatementPassThroughModule · library prolog.argumentation.graph.labelling.statement.pt

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

Calls: argument, graphStore

Predicate	Description
`statementLabelling/0`	The labels of the statements (see graphStore::labelStatement/2), one for each argument

statementLabelling/0

statementLabelling

The labels of the statements (see graphStore::labelStatement/2), one for each argument.

statement_binary

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

statement_binary

Labelling · Kotlin object StatementBinaryModule · library prolog.argumentation.graph.labelling.statement.binary

Two labels for the statements (module statement_binary, a statementLabellingMode): IN if an argument for the statement is IN, OUT otherwise.

Calls: argument, graphStore

Predicate	Description
`statementLabelling/0`	The labels of the statements (see graphStore::labelStatement/2): IN those with an argument IN, OUT the others (their arguments are OUT or UND)

statementLabelling/0

statementLabelling

The labels of the statements (see graphStore::labelStatement/2): IN those with an argument IN, OUT the others (their arguments are OUT or UND).