Package org.apache.jena.reasoner.rulesys
Class BasicForwardRuleInfGraph
- java.lang.Object
-
- org.apache.jena.graph.impl.GraphBase
-
- org.apache.jena.reasoner.BaseInfGraph
-
- org.apache.jena.reasoner.rulesys.BasicForwardRuleInfGraph
-
- All Implemented Interfaces:
Graph
,GraphWithPerform
,InfGraph
,ForwardRuleInfGraphI
,SilentAddI
- Direct Known Subclasses:
FBRuleInfGraph
,RETERuleInfGraph
public class BasicForwardRuleInfGraph extends BaseInfGraph implements ForwardRuleInfGraphI
An inference graph interface that runs a set of forward chaining rules to conclusion on each added triple and stores the entire result set.This implementation has a horribly inefficient rule chainer built in. Once we have this working generalize this to an interface than can call out to a rule engine and build a real rule engine (e.g. Rete style).
-
-
Nested Class Summary
-
Nested classes/interfaces inherited from class org.apache.jena.reasoner.BaseInfGraph
BaseInfGraph.InfCapabilities, BaseInfGraph.InfFindSafeCapabilities, BaseInfGraph.InfTransactionHandler
-
-
Field Summary
Fields Modifier and Type Field Description boolean
filterFunctors
Flag, if true then find results will be filtered to remove functors and illegal RDF-
Fields inherited from class org.apache.jena.graph.impl.GraphBase
TOSTRING_TRIPLE_BASE, TOSTRING_TRIPLE_LIMIT
-
Fields inherited from interface org.apache.jena.graph.Graph
emptyGraph
-
-
Constructor Summary
Constructors Constructor Description BasicForwardRuleInfGraph(Reasoner reasoner, java.util.List<Rule> rules, Graph schema)
Constructor.BasicForwardRuleInfGraph(Reasoner reasoner, java.util.List<Rule> rules, Graph schema, Graph data)
Constructor.BasicForwardRuleInfGraph(Reasoner reasoner, Graph schema)
Constructor.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description void
addBRule(Rule brule)
Adds a new Backward rule as a rules of a forward rule process.void
addDeduction(Triple t)
Add a new deduction to the deductions graph.void
close()
Free all resources, any further use of this Graph is an error.void
deleteBRule(Rule brule)
Deletes a new Backward rule as a rules of a forward rule process.ExtendedIterator<Triple>
find(TriplePattern pattern)
Basic pattern lookup interface.ExtendedIterator<Triple>
findDataMatches(Node subject, Node predicate, Node object)
Search the combination of data and deductions graphs for the given triple pattern.ExtendedIterator<Triple>
findWithContinuation(TriplePattern pattern, Finder continuation)
Extended find interface used in situations where the implementator may or may not be able to answer the complete query.Graph
getCurrentDeductionsGraph()
Return the Graph containing all the static deductions available so far.Graph
getDeductionsGraph()
Return the Graph containing all the static deductions available so far.java.util.Iterator<Derivation>
getDerivation(Triple t)
Return the derivation of at triple.long
getNRulesFired()
Return the number of rules fired since this rule engine instance was created and initializedGraph
getSchemaGraph()
Return the schema graph, if any, bound into this inference graph.int
graphBaseSize()
Return the number of triples in the inferred graphvoid
logDerivation(Triple t, Derivation derivation)
Log a dervivation record against the given triple.void
performAdd(Triple t)
Add one triple to the data graph, run any rules triggered by the new data item, recursively adding any generated triples.void
performDelete(Triple t)
Removes the triple t (if possible) from the set belonging to this graph.void
prepare()
Perform any initial processing and caching.void
rebind()
Cause the inference graph to reconsult the underlying graph to take into account changes.void
rebind(Graph data)
Replace the underlying data graph for this inference graph and start any inferences over again.void
setDerivationLogging(boolean recordDerivations)
Set to true to enable derivation cachingvoid
setFunctorFiltering(boolean param)
Set to true to cause functor-valued literals to be dropped from rule output.void
setRuleStore(java.lang.Object ruleStore)
Attach a compiled rule set to this inference graph.void
setTraceOn(boolean state)
Set the state of the trace flag.boolean
shouldLogDerivations()
Return true if derivation logging is enabled.boolean
shouldTrace()
Return true if tracing should be acted on - i.e.void
silentAdd(Triple t)
Assert a new triple in the deduction graph, bypassing any processing machinery.-
Methods inherited from class org.apache.jena.reasoner.BaseInfGraph
clear, cloneWithPremises, find, getCapabilities, getGlobalProperty, getPrefixMapping, getRawGraph, getReasoner, getTransactionHandler, getVersion, isEmpty, isPrepared, remove, reset, testGlobalProperty, validate
-
Methods inherited from class org.apache.jena.graph.impl.GraphBase
add, contains, contains, delete, dependsOn, find, find, forTestingOnly_graphBaseFind, getEventManager, isClosed, isIsomorphicWith, notifyAdd, notifyDelete, size, toString, toString
-
Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait
-
Methods inherited from interface org.apache.jena.graph.Graph
add, add, clear, contains, contains, delete, delete, dependsOn, find, find, find, getCapabilities, getEventManager, getPrefixMapping, getTransactionHandler, isClosed, isEmpty, isIsomorphicWith, remove, size, stream, stream
-
Methods inherited from interface org.apache.jena.reasoner.InfGraph
find, getGlobalProperty, getRawGraph, getReasoner, reset, testGlobalProperty, validate
-
-
-
-
Constructor Detail
-
BasicForwardRuleInfGraph
public BasicForwardRuleInfGraph(Reasoner reasoner, Graph schema)
Constructor. Creates a new inference graph to which a (compiled) rule set and a data graph can be attached. This separation of binding is useful to allow any configuration parameters (such as logging) to be set before the data is added. Note that until the data is added usingrebind
then any operations like add, remove, find will result in errors.- Parameters:
reasoner
- the parent reasonerschema
- the (optional) schema data which is being processed
-
BasicForwardRuleInfGraph
public BasicForwardRuleInfGraph(Reasoner reasoner, java.util.List<Rule> rules, Graph schema)
Constructor. Creates a new inference graph based on the given rule set. No data graph is attached at this stage. This is to allow any configuration parameters (such as logging) to be set before the data is added. Note that until the data is added usingrebind
then any operations like add, remove, find will result in errors.- Parameters:
reasoner
- the parent reasonerrules
- the list of rules to use this timeschema
- the (optional) schema or preload data which is being processed
-
BasicForwardRuleInfGraph
public BasicForwardRuleInfGraph(Reasoner reasoner, java.util.List<Rule> rules, Graph schema, Graph data)
Constructor. Creates a new inference graph based on the given rule set then processes the initial data graph. No precomputed deductions are loaded.- Parameters:
reasoner
- the parent reasonerrules
- the list of rules to use this timeschema
- the (optional) schema or preload data which is being processeddata
- the data graph to be processed
-
-
Method Detail
-
setRuleStore
public void setRuleStore(java.lang.Object ruleStore)
Attach a compiled rule set to this inference graph.- Parameters:
ruleStore
- a compiled set of rules (i.e. the result of an FRuleEngine.compile).
-
rebind
public void rebind(Graph data)
Replace the underlying data graph for this inference graph and start any inferences over again. This is primarily using in setting up ontology imports processing to allow an imports multiunion graph to be inserted between the inference graph and the raw data, before processing.- Specified by:
rebind
in interfaceInfGraph
- Overrides:
rebind
in classBaseInfGraph
- Parameters:
data
- the new raw data graph
-
rebind
public void rebind()
Cause the inference graph to reconsult the underlying graph to take into account changes. Normally changes are made through the InfGraph's add and remove calls are will be handled appropriately. However, in some cases changes are made "behind the InfGraph's back" and this forces a full reconsult of the changed data.- Specified by:
rebind
in interfaceInfGraph
- Overrides:
rebind
in classBaseInfGraph
-
getSchemaGraph
public Graph getSchemaGraph()
Return the schema graph, if any, bound into this inference graph.- Specified by:
getSchemaGraph
in classBaseInfGraph
-
prepare
public void prepare()
Perform any initial processing and caching. This call is optional. Most engines either have negligable set up work or will perform an implicit "prepare" if necessary. The call is provided for those occasions where substantial preparation work is possible (e.g. running a forward chaining rule system) and where an application might wish greater control over when this prepration is done.- Specified by:
prepare
in interfaceInfGraph
- Overrides:
prepare
in classBaseInfGraph
-
addDeduction
public void addDeduction(Triple t)
Add a new deduction to the deductions graph.- Specified by:
addDeduction
in interfaceForwardRuleInfGraphI
-
setFunctorFiltering
public void setFunctorFiltering(boolean param)
Set to true to cause functor-valued literals to be dropped from rule output. Default is true.- Specified by:
setFunctorFiltering
in interfaceForwardRuleInfGraphI
-
findWithContinuation
public ExtendedIterator<Triple> findWithContinuation(TriplePattern pattern, Finder continuation)
Extended find interface used in situations where the implementator may or may not be able to answer the complete query. It will attempt to answer the pattern but if its answers are not known to be complete then it will also pass the request on to the nested Finder to append more results.- Specified by:
findWithContinuation
in classBaseInfGraph
- Parameters:
pattern
- a TriplePattern to be matched against the datacontinuation
- either a Finder or a normal Graph which will be asked for additional match results if the implementor may not have completely satisfied the query.
-
find
public ExtendedIterator<Triple> find(TriplePattern pattern)
Basic pattern lookup interface. This implementation assumes that the underlying findWithContinuation will have also consulted the raw data.- Overrides:
find
in classBaseInfGraph
- Parameters:
pattern
- a TriplePattern to be matched against the data- Returns:
- a ExtendedIterator over all Triples in the data set that match the pattern
-
performAdd
public void performAdd(Triple t)
Add one triple to the data graph, run any rules triggered by the new data item, recursively adding any generated triples.- Specified by:
performAdd
in interfaceGraphWithPerform
- Overrides:
performAdd
in classBaseInfGraph
-
graphBaseSize
public int graphBaseSize()
Return the number of triples in the inferred graph- Overrides:
graphBaseSize
in classBaseInfGraph
-
performDelete
public void performDelete(Triple t)
Removes the triple t (if possible) from the set belonging to this graph.- Specified by:
performDelete
in interfaceGraphWithPerform
- Overrides:
performDelete
in classBaseInfGraph
-
close
public void close()
Free all resources, any further use of this Graph is an error.- Specified by:
close
in interfaceGraph
- Overrides:
close
in classBaseInfGraph
-
addBRule
public void addBRule(Rule brule)
Adds a new Backward rule as a rules of a forward rule process. Only some infgraphs support this.- Specified by:
addBRule
in interfaceForwardRuleInfGraphI
-
deleteBRule
public void deleteBRule(Rule brule)
Deletes a new Backward rule as a rules of a forward rule process. Only some infgraphs support this.- Specified by:
deleteBRule
in interfaceForwardRuleInfGraphI
-
getDeductionsGraph
public Graph getDeductionsGraph()
Return the Graph containing all the static deductions available so far. Will force a prepare.- Specified by:
getDeductionsGraph
in interfaceForwardRuleInfGraphI
- Specified by:
getDeductionsGraph
in interfaceInfGraph
- Overrides:
getDeductionsGraph
in classBaseInfGraph
- Returns:
- the deductions graph, if relevant for this class of inference engine or null if not.
-
getCurrentDeductionsGraph
public Graph getCurrentDeductionsGraph()
Return the Graph containing all the static deductions available so far. Does not trigger a prepare action. Returns a SafeWrapper and so can be used for update (thus triggering listeners) but not for access to generalized triples- Specified by:
getCurrentDeductionsGraph
in interfaceForwardRuleInfGraphI
-
findDataMatches
public ExtendedIterator<Triple> findDataMatches(Node subject, Node predicate, Node object)
Search the combination of data and deductions graphs for the given triple pattern. This may different from the normal find operation in the base of hybrid reasoners where we are side-stepping the backward deduction step.- Specified by:
findDataMatches
in interfaceForwardRuleInfGraphI
-
logDerivation
public void logDerivation(Triple t, Derivation derivation)
Log a dervivation record against the given triple.- Specified by:
logDerivation
in interfaceForwardRuleInfGraphI
-
silentAdd
public void silentAdd(Triple t)
Assert a new triple in the deduction graph, bypassing any processing machinery.- Specified by:
silentAdd
in interfaceSilentAddI
-
setDerivationLogging
public void setDerivationLogging(boolean recordDerivations)
Set to true to enable derivation caching- Specified by:
setDerivationLogging
in interfaceInfGraph
- Overrides:
setDerivationLogging
in classBaseInfGraph
-
shouldLogDerivations
public boolean shouldLogDerivations()
Return true if derivation logging is enabled.- Specified by:
shouldLogDerivations
in interfaceForwardRuleInfGraphI
-
getDerivation
public java.util.Iterator<Derivation> getDerivation(Triple t)
Return the derivation of at triple. The derivation is a List of DerivationRecords- Specified by:
getDerivation
in interfaceInfGraph
- Overrides:
getDerivation
in classBaseInfGraph
- Returns:
- an iterator over Derivation records or null if there is no derivation information available for this triple.
-
setTraceOn
public void setTraceOn(boolean state)
Set the state of the trace flag. If set to true then rule firings are logged out to the Log at "INFO" level.
-
shouldTrace
public boolean shouldTrace()
Return true if tracing should be acted on - i.e. if traceOn is true and we are past the bootstrap phase.- Specified by:
shouldTrace
in interfaceForwardRuleInfGraphI
-
getNRulesFired
public long getNRulesFired()
Return the number of rules fired since this rule engine instance was created and initialized
-
-