structuredPartial
Evaluation · Kotlin object StructuredPartialModule · library prolog.argumentation.structured.partial
Query mode (module structuredPartial): the labels of the statements for a goal, computed on the part of the argumentation
graph they depend on (see the modules queryExploration and argumentSearch), or on the whole graph.
- Calls: attackCandidates, attackRelation, graphStore, queryExploration, structuredWhole, utils
- Called by: arg2p
- Flags:
queryMode(see Flags)
| Predicate | Description |
|---|---|
computeStatementAcceptance/2 | The labels of the statements for Goal: in(S), out(S) and und(S) terms |
computeStatementAcceptance/4 | The statements for Goal labelled IN, OUT and UND |
computeStatementAcceptance/1 | The labels of the statements for Goal, in the context: with queryMode only the part of the graph they depend on is built, otherwise the whole graph |
locality/1 | The part of the graph the labels of the arguments for the query depend on, as the semantics declares it (locality/1): the arguments they depend on (directional), those connected to them in either direction (connected), or the whole graph (whole_graph, also for a semantics that does not declare it) |
buildArgument/3 | Argument is each argument for Query, saved with those its label may depend on, and SubArguments are its sub-arguments: the solvers that do not know its rules look for their attackers as well |
findAttacker/6 | Attacker attacks Target, directly or on one of its SubArguments, and the attacks are saved; each attacker is given once, with its own sub-arguments |
computeStatementAcceptance/2
computeStatementAcceptance(+Goal, -Result)The labels of the statements for Goal: in(S), out(S) and und(S) terms.
computeStatementAcceptance/4
computeStatementAcceptance(+Goal, -In, -Out, -Und)The statements for Goal labelled IN, OUT and UND.
computeStatementAcceptance/1
computeStatementAcceptance(+Goal)The labels of the statements for Goal, in the context: with queryMode only the part of the graph they depend on is built, otherwise the whole graph.
locality/1
locality(-Locality)The part of the graph the labels of the arguments for the query depend on, as the semantics declares it (locality/1): the arguments they depend on (directional), those connected to them in either direction (connected), or the whole graph (whole_graph, also for a semantics that does not declare it)
buildArgument/3
buildArgument(+Query, -Argument, -SubArguments)Argument is each argument for Query, saved with those its label may depend on, and SubArguments are its sub-arguments: the solvers that do not know its rules look for their attackers as well.
findAttacker/6
findAttacker(+Target, +SubArguments, +QueryChain, -Attacker, -AttackerSubArguments, -IsValid)Attacker attacks Target, directly or on one of its SubArguments, and the attacks are saved; each attacker is given once, with its own sub-arguments. IsValid is no when Attacker is in QueryChain (the arguments the evaluation of Target comes from: a cycle), yes otherwise. Target may have been built by another solver, with rules this one does not know: its sub-arguments come with it.