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)
argumentLabelling/0
argumentLabellingEach admissible labelling in turn, left as the active context.
admissibleSet/0
admissibleSetNative primitive.
Every attacker of an IN argument is attacked by an IN argument other than itself.
admissibleSet/1
admissibleSet(+Ids)Native primitive.
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
maximalAdmissibleSubset(+Ids, -Subset)Native primitive.
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)