queryExploration

Evaluation · Kotlin object QueryExplorationModule · library prolog.argumentation.structured.exploration

The part of the argumentation graph a query depends on (module queryExploration, for query mode): the arguments for the query, and, recursively, those their labels may depend on, saved as they are built (see the module argumentSearch).

Calls: argument, argumentSearch, attackCandidates, graphStore, parser, utils
Called by: structuredPartial, argumentSearch

Predicate	Description
`explore/1`	The arguments for Query and those their labels may depend on (see exploreStatement/2)
`resume/1`	The exploration carried on once arguments for Statements are saved: the statements explored whose rules use them as premises, directly or through other statements, explored again, the others left as they are
`restart/0`	The exploration forgotten, not the arguments it built: exploring again finds all that the arguments saved since support or make possible attackers (with metaConflicts, those for conflicts)
`explored/1`	Statement is explored (with the statements it generalises)
`premiseOfExplored/1`	Premise is one of the premises, to be supported by an argument, of a rule concluding a statement explored, and the statement makes it ground
`exploreAll/1`	Each of Queries explored (see explore/1)
`buildSubGraph/2`	Argument is each argument for Query, a premise, once explored
`expand/1`	For the connected locality, the arguments whose labels may depend on the ones built (see dependant/2), with those they depend on in turn, until none is new
`groundVars/2`	Term with each of its variables replaced by an atom of its own (`$var_0`, …): a term (with none of these atoms) unifies with Grounded if and only if it generalises Term

explore/1

explore(+Query)

The arguments for Query and those their labels may depend on (see exploreStatement/2). With cycles among the rules, a statement needed as a premise while its arguments are being built only gets those built so far: the exploration is then repeated, from scratch, until it builds no new argument (the arguments are finitely many, as none uses a rule twice).

resume/1

resume(+Statements)

The exploration carried on once arguments for Statements are saved: the statements explored whose rules use them as premises, directly or through other statements, explored again, the others left as they are.

restart/0

restart

The exploration forgotten, not the arguments it built: exploring again finds all that the arguments saved since support or make possible attackers (with metaConflicts, those for conflicts).

explored/1

explored(?Statement)

Statement is explored (with the statements it generalises).

premiseOfExplored/1

premiseOfExplored(?Premise)

Premise is one of the premises, to be supported by an argument, of a rule concluding a statement explored, and the statement makes it ground. The exploration supports the premises one at a time, the next once the one before is, with its bindings: a solver whose arguments for them are built elsewhere asks for the ground ones all at once, so that they are built side by side (the bindings of the others leave them as they are).

exploreAll/1

exploreAll(+Queries)

Each of Queries explored (see explore/1).

buildSubGraph/2

buildSubGraph(+Query, ?Argument)

Argument is each argument for Query, a premise, once explored.

expand/1

expand(+Locality)

For the connected locality, the arguments whose labels may depend on the ones built (see dependant/2), with those they depend on in turn, until none is new.

groundVars/2

groundVars(+Term, ?Grounded)

Native primitive.

Term with each of its variables replaced by an atom of its own ($var_0, …): a term (with none of these atoms) unifies with Grounded if and only if it generalises Term