AbstractForwardRuleReasonerRDFS

abstract def postprocess(graph: G): G

abstract def preprocess(graph: G): G

abstract def rule11(graph: G): G

abstract def rule2(graph: G): G

abstract def rule3(graph: G): G

abstract def rule5(graph: G): G

abstract def rule7(graph: G): G

abstract def rule9(graph: G): G

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def addTransitivePairs[A, B](s: Set[(A, B)]): Set[(A, B)]

def apply(graph: G): G

def apply(graph: RDFGraph): RDFGraph

Applies forward chaining to the given RDF graph and returns a new RDF graph that contains all additional triples based on the underlying set of rules.

def apply(triples: RDD[Triple]): RDD[Triple]

Applies forward chaining to the given RDD of RDF triples and returns a new RDD of RDF triples that contains all additional triples based on the underlying set of rules.

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def computeTransitiveClosure(edges: Dataset[Triple]): Dataset[Triple]

Computes the transitive closure for a Dataframe of triples

def computeTransitiveClosure[A](edges: RDD[(A, A)])(implicit arg0: ClassTag[A]): RDD[(A, A)]

Computes the transitive closure for an RDD of tuples

def computeTransitiveClosure(triples: RDD[Triple], predicate: Node): RDD[Triple]

Computes the transitive closure for the given predicate on an RDD of triples.

def computeTransitiveClosure(triples: RDD[Triple]): RDD[Triple]

Computes the transitive closure on an RDD of triples.

def computeTransitiveClosure(triples: Set[Triple]): Set[Triple]

Computes the transitive closure on a set of triples, i.e.

def computeTransitiveClosurePairs[A, B](s: Set[(A, B)]): Set[(A, B)]

def computeTransitiveClosureSemiNaive[A](edges: RDD[(A, A)])(implicit arg0: ClassTag[A]): RDD[(A, A)]

Semi-naive computation of the transitive closure T for an RDD of tuples R=(x,y).

(1) T = R
(2) ∆T = R
(3) while ∆T != ∅ do
(4) ∆T = ∆T ◦ R − T
(5) T = T ∪ ∆T
(6) end

def debug(msg: ⇒ String, o: Any, os: Any*): Unit

def debug(msg: ⇒ String, e: Throwable): Unit

def debug(msg: ⇒ String): Unit

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def error(msg: ⇒ String, o: Any, os: Any*): Unit

def error(msg: ⇒ String, e: Throwable): Unit

def error(msg: ⇒ String): Unit

def extractTriples(triples: RDD[Triple], subject: Option[Node], predicate: Option[Node], obj: Option[Node]): RDD[Triple]

Extracts all triples that match the given subject, predicate and object if defined.

def extractTriples(triples: RDD[Triple], predicate: Node): RDD[Triple]

Extracts all triples for the given predicate.

def extractTriples(triples: Set[Triple], predicate: Node): Set[Triple]

Extracts all triples for the given predicate.

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def info(msg: ⇒ String, o: Any, os: Any*): Unit

def info(msg: ⇒ String, e: Throwable): Unit

def info(msg: ⇒ String): Unit

final def isInstanceOf[T0]: Boolean

var level: RDFSLevel

def log: Logger

def logName: String

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

val parallelism: Int

def profile[R](block: ⇒ R): R

val properties: Seq[Node]

implicit val rdfOps: RDFOps[Rdf]

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

def trace(msg: ⇒ String, o: Any, os: Any*): Unit

def trace(msg: ⇒ String, e: Throwable): Unit

def trace(msg: ⇒ String): Unit

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def warn(msg: ⇒ String, o: Any, os: Any*): Unit

def warn(msg: ⇒ String, e: Throwable): Unit

def warn(msg: ⇒ String): Unit