| com.hp.hpl.jena.reasoner.rulesys.RuleContext
All known Subclasses: com.hp.hpl.jena.reasoner.rulesys.impl.BFRuleContext, com.hp.hpl.jena.reasoner.rulesys.impl.RETERuleContext, com.hp.hpl.jena.reasoner.rulesys.impl.BBRuleContext,
RuleContext | public interface RuleContext (Code) | | Interface used to convey context information from a rule engine
to the stack of procedural builtins. This gives access
to the triggering rule, the variable bindings and the set of
currently known triples.
author: Dave Reynolds version: $Revision: 1.12 $ on $Date: 2008/01/02 12:07:47 $ |
Method Summary | |
public void | add(Triple t) Assert a new triple in the deduction graph, triggering any consequent processing as appropriate. | public boolean | contains(Triple t) Return true if the triple is already in either the graph or the stack.
I.e. | public boolean | contains(Node s, Node p, Node o) Return true if the triple pattern is already in either the graph or the stack.
I.e. | public ClosableIterator | find(Node s, Node p, Node o) In some formulations the context includes deductions that are not yet
visible to the underlying graph but need to be checked for. | public BindingEnvironment | getEnv() Returns the current variable binding environment for the current rule. | public InfGraph | getGraph() Returns the parent inference graph. | public Rule | getRule() Returns the rule. | public void | remove(Triple t) Remove a triple from the deduction graph (and the original graph if relevant). | public void | setRule(Rule rule) Sets the rule. | public void | silentAdd(Triple t) Assert a new triple in the deduction graph, bypassing any processing machinery. |
add | public void add(Triple t)(Code) | | Assert a new triple in the deduction graph, triggering any consequent processing as appropriate.
|
contains | public boolean contains(Triple t)(Code) | | Return true if the triple is already in either the graph or the stack.
I.e. it has already been deduced.
|
contains | public boolean contains(Node s, Node p, Node o)(Code) | | Return true if the triple pattern is already in either the graph or the stack.
I.e. it has already been deduced.
|
find | public ClosableIterator find(Node s, Node p, Node o)(Code) | | In some formulations the context includes deductions that are not yet
visible to the underlying graph but need to be checked for.
|
getEnv | public BindingEnvironment getEnv()(Code) | | Returns the current variable binding environment for the current rule.
BindingEnvironment |
getGraph | public InfGraph getGraph()(Code) | | Returns the parent inference graph.
InfGraph |
getRule | public Rule getRule()(Code) | | Returns the rule.
Rule |
remove | public void remove(Triple t)(Code) | | Remove a triple from the deduction graph (and the original graph if relevant).
|
setRule | public void setRule(Rule rule)(Code) | | Sets the rule.
Parameters: rule - The rule to set |
silentAdd | public void silentAdd(Triple t)(Code) | | Assert a new triple in the deduction graph, bypassing any processing machinery.
|
|
|