ForwardRuleReasoner

Abstract Value Members

abstract 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.
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.
graph
the RDF graph
returns
the materialized RDF graph

Concrete Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def addTransitive(triples: Set[Triple]): Set[Triple]

Definition Classes
TransitiveReasoner
def apply(triples: DataSet[Triple]): DataSet[Triple]

Applies forward chaining to the given set of RDF triples and returns a new set of RDF triples that contains all additional triples based on the underlying set of rules.
Applies forward chaining to the given set of RDF triples and returns a new set of RDF triples that contains all additional triples based on the underlying set of rules.
triples
the RDF triples
returns
the materialized RDF triples
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def computeTransitiveClosure[A](edges: DataSet[(A, A)])(implicit arg0: ClassTag[A], arg1: TypeInformation[A]): DataSet[(A, A)]

Computes the transitive closure for a DataSet of tuples
Computes the transitive closure for a DataSet of tuples
edges
the DataSet of tuples
returns
a tuples containing the transitive closure of the tuples

Definition Classes
TransitiveReasoner
def computeTransitiveClosure(triples: DataSet[Triple]): DataSet[Triple]

Computes the transitive closure on a DataSet of triples.
Computes the transitive closure on a DataSet of triples. Note, that the assumption is that all triples do have the same predicate.
triples
the DataSet of triples
returns
a DataSet containing the transitive closure of the triples

Definition Classes
TransitiveReasoner
def computeTransitiveClosure(triples: Set[Triple]): Set[Triple]

Computes the transitive closure on a set of triples, i.e.
Computes the transitive closure on a set of triples, i.e. it is computed in-memory by the driver. Note, that the assumption is that all triples do have the same predicate.
triples
the set of triples
returns
a set containing the transitive closure of the triples

Definition Classes
TransitiveReasoner
def computeTransitiveClosureOpt(triples: DataSet[Triple]): DataSet[Triple]

Computes the transitive closure on a DataSet of triples.
Computes the transitive closure on a DataSet of triples. Note, that the assumption is that all triples do have the same predicate. This implementation uses the Flink iterate operator (see https://ci.apache.org/projects/flink/flink-docs-master/dev/batch/iterations.html")
triples
the DataSet of triples
returns
a DataSet containing the transitive closure of the triples

Definition Classes
TransitiveReasoner
def computeTransitiveClosureOptSemiNaive(triples: DataSet[Triple], predicate: Node = null): DataSet[Triple]

Computes the transitive closure on a DataSet of triples.
Computes the transitive closure on a DataSet of triples. Note, that the assumption is that all triples do have the same predicate. If no predicate is given, we take any triple from the dataset and use its predicate. We highly recommend to provide the predicate in order to avoid unnecessary operations.
This implementation uses the Flink iterate operator (see https://ci.apache.org/projects/flink/flink-docs-master/dev/batch/iterations.html")
triples
the DataSet of triples
predicate
the optional predicate
returns
a DataSet containing the transitive closure of the triples

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

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

Definition Classes
Logging
def debug(msg: ⇒ String): Unit

Definition Classes
Logging
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def error(msg: ⇒ String, o: Any, os: Any*): Unit

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

Definition Classes
Logging
def error(msg: ⇒ String): Unit

Definition Classes
Logging
def extractTriples(triples: DataSet[Triple], subject: Option[Node], predicate: Option[Node], obj: Option[Node]): DataSet[Triple]

Extracts all triples that match the given subject, predicate and object if defined.
Extracts all triples that match the given subject, predicate and object if defined.
triples
the DataSet of triples
subject
the subject
predicate
the predicate
obj
the object
returns
the DataSet of triples that match
def extractTriples(triples: DataSet[Triple], predicate: Node): DataSet[Triple]

Extracts all triples for the given predicate.
Extracts all triples for the given predicate.
triples
the DataSet of triples
predicate
the predicate
returns
the DataSet of triples that contain the predicate
def extractTriples(triples: Set[Triple], predicate: Node): Set[Triple]

Extracts all triples for the given predicate.
Extracts all triples for the given predicate.
triples
the triples
predicate
the predicate
returns
the set of triples that contain the predicate
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
def info(msg: ⇒ String, o: Any, os: Any*): Unit

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

Definition Classes
Logging
def info(msg: ⇒ String): Unit

Definition Classes
Logging
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def log: Logger

Attributes
protected
Definition Classes
Logging
def logName: String

Attributes
protected
Definition Classes
Logging
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
val nodeKeyFct: (Node) ⇒ Int

Definition Classes
TransitiveReasoner
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def profile[R](block: ⇒ R): R

Definition Classes
Profiler
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
def trace(msg: ⇒ String, o: Any, os: Any*): Unit

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

Definition Classes
Logging
def trace(msg: ⇒ String): Unit

Definition Classes
Logging
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
def warn(msg: ⇒ String, o: Any, os: Any*): Unit

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

Definition Classes
Logging
def warn(msg: ⇒ String): Unit

Definition Classes
Logging

Related Doc: package forwardchaining

trait ForwardRuleReasoner extends TransitiveReasoner

Abstract Value Members

abstract def apply(graph: RDFGraph): RDFGraph

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

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

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

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def computeTransitiveClosure[A](edges: DataSet[(A, A)])(implicit arg0: ClassTag[A], arg1: TypeInformation[A]): DataSet[(A, A)]

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

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

def computeTransitiveClosureOpt(triples: DataSet[Triple]): DataSet[Triple]

def computeTransitiveClosureOptSemiNaive(triples: DataSet[Triple], predicate: Node = null): DataSet[Triple]

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: DataSet[Triple], subject: Option[Node], predicate: Option[Node], obj: Option[Node]): DataSet[Triple]

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

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

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

def log: Logger

def logName: String

final def ne(arg0: AnyRef): Boolean

val nodeKeyFct: (Node) ⇒ Int

final def notify(): Unit

final def notifyAll(): Unit

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

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

Inherited from TransitiveReasoner

Inherited from Profiler

Inherited from Logging

Inherited from AnyRef

Inherited from Any

Ungrouped