class ForwardRuleReasonerEL extends TransitiveReasoner
This rule-based forward chaining reasoner implementation is based on the paper
'Pushing the EL envelope' by Baader, Brandt, Lutz. IJCAI. Vol. 5. 2005.
The paper does not cover the whole OWL 2 EL profile and makes some assumptions w.r.t. the allowed axioms. Given the set BC that contains
- owl:Thing - all concept names - all nominals { a } (with just one individual!) - concrete domain descriptions p(f1, ..., fk) (not used here)
The allowed general concept inclusions are the following (with C1, C2 \in BC, D \in BC \cup { owl:Nothin }):
- C1 \sqsubseteq D - C1 \sqcap C2 \sqsubseteq D - C1 \sqsubseteq \exists r.C2 - \exists r.C1 \sqsubseteq D
Role inclusions may be of the form
- r \sqsubseteq s , or - r1 o r2 \sqsubseteq s
We implemented the completion rules that were feasible in our setting.
Naming conventions: - C, C1, C2 --> class names, or nominals (with just one individual), or owl:Thing - D, D1, D2 --> class names, or nominals (with just one individual), owl:Thing, or owl:Nothing
- Alphabetic
- By Inheritance
- ForwardRuleReasonerEL
- TransitiveReasoner
- ForwardRuleReasoner
- Profiler
- Logging
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
-
new
ForwardRuleReasonerEL(sc: SparkContext, parallelism: Int = 2)
- sc
The Spark context
- parallelism
The degreee of parallelism (mainly used to derive the number of partitions for RDD.distinct(parallelism) calls)
Type Members
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
addTransitivePairs[A, B](s: Set[(A, B)]): Set[(A, B)]
- Definition Classes
- TransitiveReasoner
-
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
- ForwardRuleReasonerEL → TransitiveReasoner → ForwardRuleReasoner
-
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
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native() @HotSpotIntrinsicCandidate()
-
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
-
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
-
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
-
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
-
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
computeTransitiveClosurePairs[A, B](s: Set[(A, B)]): Set[(A, B)]
- Definition Classes
- TransitiveReasoner
-
def
computeTransitiveClosureSemiNaive[A](edges: RDD[(A, A)])(implicit arg0: ClassTag[A]): RDD[(A, A)]
Semi-naive computation of the transitive closure
Tfor an RDD of tuplesR=(x,y).Semi-naive computation of the transitive closure
Tfor an RDD of tuplesR=(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
-
val
cr1: Rule
CR1: C1 \sqsubseteq C2, C2 \sqsubseteq D => C1 \sqsubseteq D
-
val
cr10: Rule
CR10: C \sqsubseteq \exists r.D, r \sqsubseteq s => C \sqsubseteq \exists s.D
-
val
cr11: Rule
CR11: C \sqsubseteq \exists r1.D, D \sqsubseteq \exists r2.E, r1 o r2 \sqsubseteq r3 => C \sqsubseteq \exists r3.E
-
val
cr2: Rule
CR2: C \sqsubseteq C1, C \sqsubseteq C2, C1 \sqcap C2 \sqsubseteq D => C \sqsubseteq D
-
val
cr3: Rule
CR3: C1 \sqsubseteq C2, C2 \sqsubseteq \exists r.D => C1 \sqsubseteq \exists r.D
-
val
cr4: Rule
CR4: C \sqsubseteq \exists r.D, D \sqsubseteq D2, \exists r.D2 \sqsubseteq E => C \sqsubseteq E
-
val
cr5: Rule
CR5: C\sqsubseteq \exists r.D, D \sqsubseteq owl:Noting => C \sqsubseteq owl:Nothing
-
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: 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
-
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
-
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
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
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
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
val
parallelism: Int
- Definition Classes
- TransitiveReasoner
-
def
profile[R](block: ⇒ R): R
- Definition Classes
- Profiler
-
val
properties: Seq[Node]
- Definition Classes
- TransitiveReasoner
-
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(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
wait(): 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
Deprecated Value Members
-
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.