SimpleN3RulesReasoner Class |
Namespace: VDS.RDF.Query.Inference
The SimpleN3RulesReasoner type exposes the following members.
| Name | Description | |
|---|---|---|
| SimpleN3RulesReasoner | Initializes a new instance of the SimpleN3RulesReasoner class |
| Name | Description | |
|---|---|---|
| Apply(IGraph) |
Applies reasoning to the given Graph materialising the generated Triples in the same Graph.
| |
| Apply(IGraph, IGraph) |
Applies reasoning on the Input Graph materialising the generated Triples in the Output Graph.
| |
| Equals | Determines whether the specified object is equal to the current object. (Inherited from Object.) | |
| Finalize | Allows an object to try to free resources and perform other cleanup operations before it is reclaimed by garbage collection. (Inherited from Object.) | |
| GetHashCode | Serves as the default hash function. (Inherited from Object.) | |
| GetType | Gets the Type of the current instance. (Inherited from Object.) | |
| Initialise |
Initialises the Reasoner.
| |
| MemberwiseClone | Creates a shallow copy of the current Object. (Inherited from Object.) | |
| ToString | Returns a string that represents the current object. (Inherited from Object.) |
This reasoner should be initialised with a Graph that contains simple N3 rules such as the following:
{ ?x a ?type } => { ?type a rdfs:Class }.When initialised the reasoner takes account of variables declared with @forAll and @forSome directives though no guarantees that scoping will be correct if you've got multiple @forAll and @forSome directives.
When the reasoner is applied to a Graph rules are implemented by generating a SPARQL Update INSERT command like the following and executing it on the given Graph.
INSERT
{
?type a rdfs:Class .
}
WHERE
{
?x a ?type .
}