Packages

•  package root

  Definition Classes

  root

•  package net

  Definition Classes

  root

•  package sansa_stack

  Definition Classes

  net

•  package inference

  Definition Classes

  sansa_stack

•  package spark

  Definition Classes

  inference

•  package forwardchaining

  Definition Classes

  spark

•  package triples

  Definition Classes

  forwardchaining

•  class ForwardRuleReasonerEL extends TransitiveReasoner

  This rule-based forward chaining reasoner implementation is based on the paper

  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

  Definition Classes

  triples

• Rule

net.sansa_stack.inference.spark.forwardchaining.triples.ForwardRuleReasonerEL

Rule 