Trait

net.sansa_stack.inference.flink.forwardchaining

ForwardRuleReasoner

Related Doc: package forwardchaining

Permalink

trait ForwardRuleReasoner extends TransitiveReasoner

A forward chaining based reasoner.

Linear Supertypes
TransitiveReasoner, Profiler, Logging, AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. ForwardRuleReasoner
  2. TransitiveReasoner
  3. Profiler
  4. Logging
  5. AnyRef
  6. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. All

Abstract Value Members

  1. abstract def apply(graph: RDFGraph): RDFGraph

    Permalink

    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

  1. final def !=(arg0: Any): Boolean

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

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

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

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

    Permalink

    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

  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any
  7. def clone(): AnyRef

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

    Permalink

    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
  9. def computeTransitiveClosure(triples: DataSet[Triple]): DataSet[Triple]

    Permalink

    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
  10. def computeTransitiveClosure(triples: Set[Triple]): Set[Triple]

    Permalink

    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
  11. def computeTransitiveClosureOpt(triples: DataSet[Triple]): DataSet[Triple]

    Permalink

    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
  12. def computeTransitiveClosureOptSemiNaive(triples: DataSet[Triple], predicate: Node = null): DataSet[Triple]

    Permalink

    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
  13. def debug(msg: ⇒ String, o: Any, os: Any*): Unit

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

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

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

    Permalink
    Definition Classes
    AnyRef
  17. def equals(arg0: Any): Boolean

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

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

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

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

    Permalink

    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

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

    Permalink

    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

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

    Permalink

    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

  24. def finalize(): Unit

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

    Permalink
    Definition Classes
    AnyRef → Any
  26. def hashCode(): Int

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

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

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

    Permalink
    Definition Classes
    Logging
  30. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any
  31. def log: Logger

    Permalink
    Attributes
    protected
    Definition Classes
    Logging
  32. def logName: String

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

    Permalink
    Definition Classes
    AnyRef
  34. val nodeKeyFct: (Node) ⇒ Int

    Permalink
    Definition Classes
    TransitiveReasoner
  35. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef
  36. final def notifyAll(): Unit

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

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

    Permalink
    Definition Classes
    AnyRef
  39. def toString(): String

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

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

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

    Permalink
    Definition Classes
    Logging
  43. final def wait(): Unit

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

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

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

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

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

    Permalink
    Definition Classes
    Logging

Inherited from TransitiveReasoner

Inherited from Profiler

Inherited from Logging

Inherited from AnyRef

Inherited from Any

Ungrouped