class ForwardRuleReasonerRDFS extends TransitiveReasoner

A forward chaining implementation of the RDFS entailment regime.

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

Instance Constructors

  1. new ForwardRuleReasonerRDFS(spark: SparkSession)
  2. new ForwardRuleReasonerRDFS(sc: SparkContext, parallelism: Int = 2)

    create a new RDFS forward chaining reasoner

    create a new RDFS forward chaining reasoner

    sc

    the Apache Spark context

    parallelism

    the level of parallelism

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##(): Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. def addTransitivePairs[A, B](s: Set[(A, B)]): Set[(A, B)]
    Definition Classes
    TransitiveReasoner
  5. 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

    Definition Classes
    ForwardRuleReasonerRDFS → TransitiveReasoner → ForwardRuleReasoner
  6. 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.

    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.

    triples

    the RDF triples

    returns

    the materialized set of RDF triples

    Definition Classes
    ForwardRuleReasoner
  7. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  8. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native() @HotSpotIntrinsicCandidate()
  9. def computeTransitiveClosure(edges: Dataset[Triple]): Dataset[Triple]

    Computes the transitive closure for a Dataframe of triples

    Computes the transitive closure for a Dataframe of triples

    edges

    the Dataframe of triples

    returns

    a Dataframe containing the transitive closure of the triples

    Definition Classes
    TransitiveReasoner
  10. def computeTransitiveClosure[A](edges: RDD[(A, A)])(implicit arg0: ClassTag[A]): RDD[(A, A)]

    Computes the transitive closure for an RDD of tuples

    Computes the transitive closure for an RDD of tuples

    edges

    the RDD of tuples

    returns

    an RDD containing the transitive closure of the tuples

    Definition Classes
    TransitiveReasoner
  11. def computeTransitiveClosure(triples: RDD[Triple], predicate: Node): RDD[Triple]

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

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

    triples

    the RDD of triples

    predicate

    the predicate

    returns

    an RDD containing the transitive closure of the triples

    Definition Classes
    TransitiveReasoner
  12. def computeTransitiveClosure(triples: RDD[Triple]): RDD[Triple]

    Computes the transitive closure on an RDD of triples.

    Computes the transitive closure on an RDD of triples. Note, that the assumption is that all triples do have the same predicate.

    triples

    the RDD of triples

    returns

    an RDD containing the transitive closure of the triples

    Definition Classes
    TransitiveReasoner
  13. 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
  14. def computeTransitiveClosurePairs[A, B](s: Set[(A, B)]): Set[(A, B)]
    Definition Classes
    TransitiveReasoner
  15. 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).

    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
    edges

    the RDD of tuples (x,y)

    returns

    an RDD containing the transitive closure of the tuples

    Definition Classes
    TransitiveReasoner
  16. def debug(msg: ⇒ String, o: Any, os: Any*): Unit
    Definition Classes
    Logging
  17. def debug(msg: ⇒ String, e: Throwable): Unit
    Definition Classes
    Logging
  18. def debug(msg: ⇒ String): Unit
    Definition Classes
    Logging
  19. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  20. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  21. def error(msg: ⇒ String, o: Any, os: Any*): Unit
    Definition Classes
    Logging
  22. def error(msg: ⇒ String, e: Throwable): Unit
    Definition Classes
    Logging
  23. def error(msg: ⇒ String): Unit
    Definition Classes
    Logging
  24. var extractSchemaTriplesInAdvance: Boolean
  25. 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.

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

    triples

    the RDD of triples

    subject

    the subject

    predicate

    the predicate

    obj

    the object

    returns

    the RDD of triples that match

    Definition Classes
    ForwardRuleReasoner
  26. def extractTriples(triples: RDD[Triple], predicate: Node): RDD[Triple]

    Extracts all triples for the given predicate.

    Extracts all triples for the given predicate.

    triples

    the RDD of triples

    predicate

    the predicate

    returns

    the RDD of triples that contain the predicate

    Definition Classes
    ForwardRuleReasoner
  27. 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

    Definition Classes
    ForwardRuleReasoner
  28. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  29. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  30. def info(msg: ⇒ String, o: Any, os: Any*): Unit
    Definition Classes
    Logging
  31. def info(msg: ⇒ String, e: Throwable): Unit
    Definition Classes
    Logging
  32. def info(msg: ⇒ String): Unit
    Definition Classes
    Logging
  33. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  34. var level: RDFSLevel
  35. def log: Logger
    Attributes
    protected
    Definition Classes
    Logging
  36. def logName: String
    Attributes
    protected
    Definition Classes
    Logging
  37. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  38. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  39. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native() @HotSpotIntrinsicCandidate()
  40. val parallelism: Int
    Definition Classes
    TransitiveReasoner
  41. def profile[R](block: ⇒ R): R
    Definition Classes
    Profiler
  42. val properties: Seq[Node]
    Definition Classes
    TransitiveReasoner
  43. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  44. def toString(): String
    Definition Classes
    AnyRef → Any
  45. def trace(msg: ⇒ String, o: Any, os: Any*): Unit
    Definition Classes
    Logging
  46. def trace(msg: ⇒ String, e: Throwable): Unit
    Definition Classes
    Logging
  47. def trace(msg: ⇒ String): Unit
    Definition Classes
    Logging
  48. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  49. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  50. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  51. def warn(msg: ⇒ String, o: Any, os: Any*): Unit
    Definition Classes
    Logging
  52. def warn(msg: ⇒ String, e: Throwable): Unit
    Definition Classes
    Logging
  53. def warn(msg: ⇒ String): Unit
    Definition Classes
    Logging

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] ) @Deprecated @deprecated
    Deprecated

    (Since version ) see corresponding Javadoc for more information.

Inherited from TransitiveReasoner

Inherited from ForwardRuleReasoner

Inherited from Profiler

Inherited from Logging

Inherited from AnyRef

Inherited from Any

Ungrouped