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)
argumentLabelling/0
argumentLabellingThe ideal labelling has IN the maximal admissible subset of the intersection of the preferred extensions