A forward chaining based reasoner.
A forward chaining implementation of the RDFS entailment regime.
Creates a new RDD by performing bulk iterations using the given step function.
A forward chaining based reasoner.
A naive implementation of the forward chaining based reasoner that does fix-point iteration, i.e.
A naive implementation of the forward chaining based reasoner that does fix-point iteration, i.e. it applies all rules in each iteration until no new data has been generated. .
A forward chaining implementation of the OWL Horst entailment regime.
An optimized implementation of the forward chaining based reasoner.
An optimized implementation of the forward chaining based reasoner using Spark data structures and operations.
An optimized implementation of the forward chaining based reasoner using Spark DataFrames.
A forward chaining implementation of the RDFS entailment regime.
A forward chaining implementation of the RDFS entailment regime.
An engine to compute the transitive closure (TC) for a set of triples given in several datastructures.
Creates a new RDD by performing bulk iterations using the given step function. The first RDD the step function returns is the input for the next iteration, the second RDD is the termination criterion. The iterations terminate when either the termination criterion RDD contains no elements or when
maxIterations
iterations have been performed.