| com.hp.hpl.jena.reasoner.BaseInfGraph
 com.hp.hpl.jena.reasoner.dig.DIGInfGraph
| DIGInfGraph | | public class DIGInfGraph extends BaseInfGraph (Code) | |
An InfGraph that performs reasoning via a DIG interface to an external reasoner.
author:
Ian Dickinson, HP Labs
author:
(email)
version:
CVS $Id: DIGInfGraph.java,v 1.17 2008/01/02 12:07:11 andy_seaborne Exp $ |
| m_adapter | | protected DIGAdapter m_adapter(Code) | | The DIG adapter we will use to communicate with the external reasoner
|
| DIGInfGraph | | public DIGInfGraph(Graph data, DIGReasoner reasoner)(Code) | | Constructor
Parameters:
data - the raw data file to be augmented with entailments
Parameters:
reasoner - the engine, with associated tbox data, whose find interfacecan be used to extract all entailments from the data. |
| find | | public ExtendedIterator find(Node subject, Node property, Node object, Graph param)(Code) | | An extension of the
Graph.find interface which allows the caller to
encode complex expressions in RDF and then refer to those expressions
within the query triple. For example, one might encode a class expression
and then ask if there are any instances of this class expression in the
InfGraph. In the case of the DIGInfGraph, this is exactly the use case we assume.
In particular, we expect that the object node is the subject of
one or more sentences in param which completely define the class
description.
Parameters:
subject - the subject Node of the query triple, may be a Node inthe graph or a node in the parameter micro-graph or null
Parameters:
property - the property to be retrieved or null
Parameters:
object - the object Node of the query triple, may be a Node inthe graph or a node in the parameter micro-graph.
Parameters:
param - a small graph encoding an expression which the subject and/orobject nodes refer. |
| findWithContinuation | | public ExtendedIterator findWithContinuation(TriplePattern pattern, Finder continuation)(Code) | | 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.
DIG implementation note: the default call into this
method from the base inference graph makes the continuation a query
of the base graph. Since
DIGAdapter already queries the base
graph, there is no futher need to query it through the continuation.
Consequently, this implementation does not call the continuation.
Client code that wishes to provide a non-default continuation should
sub-class DIGInfGraph and provide a suitable call to the continuation.find().
Parameters:
pattern - a TriplePattern to be matched against the data
Parameters:
continuation - Not used in this implementation |
| getSchemaGraph | | public Graph getSchemaGraph()(Code) | | Return the schema graph, if any, bound into this inference graph.
|
| performAdd | | public synchronized void performAdd(Triple t)(Code) | | Add one triple to the data graph, mark the graph not-prepared,
but don't run prepare() just yet.
Parameters:
t - A triple to add to the graph |
| performDelete | | public void performDelete(Triple t)(Code) | | Delete one triple from the data graph, mark the graph not-prepared,
but don't run prepare() just yet.
Parameters:
t - A triple to remove from the graph |
| prepare | | public void prepare()(Code) | | 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.
|
| rebind | | public void rebind(Graph data)(Code) | | 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.
Parameters:
data - the new raw data graph |
| setDerivationLogging | | public void setDerivationLogging(boolean logOn)(Code) | | Switch on/off drivation logging - not supported with DIG reasoner
|
| validate | | public ValidityReport validate()(Code) | | Test the consistency of the model. This looks for overall inconsistency,
and for any unsatisfiable classes.
a ValidityReport structure |
|
|