Packages

c

net.sansa_stack.inference.flink.forwardchaining

ForwardRuleReasonerOWLHorst

class ForwardRuleReasonerOWLHorst extends ForwardRuleReasoner

A forward chaining implementation of the OWL Horst entailment regime.

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

Instance Constructors

  1. new ForwardRuleReasonerOWLHorst(env: ExecutionEnvironment)

    create a new OWL Horst forward chaining reasoner

    create a new OWL Horst forward chaining reasoner

    env

    the Apache Flink execution environment

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 addTransitive(triples: Set[Triple]): Set[Triple]
    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
    ForwardRuleReasonerOWLHorstForwardRuleReasoner
  6. 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

    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()
  9. 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
  10. 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
  11. 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
  12. 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
  13. 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
  14. def debug(msg: ⇒ String, o: Any, os: Any*): Unit
    Definition Classes
    Logging
  15. def debug(msg: ⇒ String, e: Throwable): Unit
    Definition Classes
    Logging
  16. def debug(msg: ⇒ String): Unit
    Definition Classes
    Logging
  17. def deduplicate(triples: DataSet[Triple]): DataSet[Triple]
  18. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  19. def equals(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  20. def error(msg: ⇒ String, o: Any, os: Any*): Unit
    Definition Classes
    Logging
  21. def error(msg: ⇒ String, e: Throwable): Unit
    Definition Classes
    Logging
  22. def error(msg: ⇒ String): Unit
    Definition Classes
    Logging
  23. 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

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

    Definition Classes
    ForwardRuleReasoner
  25. 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
  26. val fct1: (((Node, Node), Node), ((Node, Node), Nil.type)) ⇒ (Node, Node)
  27. val fct2: (((Node, Node), Node), ((Node, Node), Node)) ⇒ (Node, Node)
  28. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  29. final def getClass(): Class[_]
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  30. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @native()
  31. def info(msg: ⇒ String, o: Any, os: Any*): Unit
    Definition Classes
    Logging
  32. def info(msg: ⇒ String, e: Throwable): Unit
    Definition Classes
    Logging
  33. def info(msg: ⇒ String): Unit
    Definition Classes
    Logging
  34. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  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. val nodeKeyFct: (Node) ⇒ Int
    Definition Classes
    TransitiveReasoner
  39. val nodePairKVKeyFct: (((Node, Node), Node)) ⇒ Int
  40. val nodePairKVKeyFct2: (((Node, Node), Nil.type)) ⇒ Int
  41. val nodePairKeyFct: ((Node, Node)) ⇒ Int
  42. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  43. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @native()
  44. def profile[R](block: ⇒ R): R
    Definition Classes
    Profiler
  45. final def synchronized[T0](arg0: ⇒ T0): T0
    Definition Classes
    AnyRef
  46. def toString(): String
    Definition Classes
    AnyRef → Any
  47. def trace(msg: ⇒ String, o: Any, os: Any*): Unit
    Definition Classes
    Logging
  48. def trace(msg: ⇒ String, e: Throwable): Unit
    Definition Classes
    Logging
  49. def trace(msg: ⇒ String): Unit
    Definition Classes
    Logging
  50. val tripleKeyFct: (Triple) ⇒ Int
  51. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  52. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  53. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws( ... ) @native()
  54. def warn(msg: ⇒ String, o: Any, os: Any*): Unit
    Definition Classes
    Logging
  55. def warn(msg: ⇒ String, e: Throwable): Unit
    Definition Classes
    Logging
  56. def warn(msg: ⇒ String): Unit
    Definition Classes
    Logging

Inherited from ForwardRuleReasoner

Inherited from TransitiveReasoner

Inherited from Profiler

Inherited from Logging

Inherited from AnyRef

Inherited from Any

Ungrouped