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)
argumentLabelling/0
argumentLabellingEach strongly admissible labelling in turn, left as the active context.
stronglyAdmissibleSet/0
stronglyAdmissibleSetNative primitive.
Every IN argument is reachable from the unattacked ones, iteratively adding the IN arguments whose attackers are all attacked by those added so far