A C D E G H I L M N O P R S T U V X 

A

activateProfiler() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.CompletionRuleChainSelector
Activates a profiler for the completion rule chains.
add(Integer) - Method in class de.tudresden.inf.lat.jcel.core.graph.ArraySet
 
add(Integer) - Method in class de.tudresden.inf.lat.jcel.core.graph.HashArraySet
 
add(int) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerBinaryRelationImpl
Adds an element to this binary relation.
add(int, int) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerBinaryRelationImpl
Adds a pair to this binary relation.
add(int) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerRelationMapImpl
Adds an empty binary relation.
add(int, int, int) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerRelationMapImpl
Adds a pair to a binary relation.
add(int) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerBidirectionalGraphImpl
Adds a new vertex to the invGraph.
add(int) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerGraphImpl
Adds a new vertex to the graph.
addAll(Collection<? extends Integer>) - Method in class de.tudresden.inf.lat.jcel.core.graph.ArraySet
 
addAll(Collection<? extends Integer>) - Method in class de.tudresden.inf.lat.jcel.core.graph.HashArraySet
 
addAncestor(int, int) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerBidirectionalGraphImpl
Defines that one vertex is a subsumee of another vertex.
addAncestor(int, int) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerGraphImpl
Defines that one vertex is a subsumee of another vertex.
addAxioms(Set<NormalizedIntegerAxiom>) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleBasedProcessor
 
addExistential(int, int) - Method in class de.tudresden.inf.lat.jcel.core.graph.VNodeImpl
Adds an existential pair to this node.
addExistentialsOf(VNode) - Method in class de.tudresden.inf.lat.jcel.core.graph.VNodeImpl
Adds the existential pairs of another node.
addNewREntry(int, int, int) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
 
addNewREntry(int, int, int) - Method in interface de.tudresden.inf.lat.jcel.core.completion.common.ClassifierStatus
Adds a new R-entry to the set of entries to be processed.
addNewSEntry(int, int) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
 
addNewSEntry(int, int) - Method in interface de.tudresden.inf.lat.jcel.core.completion.common.ClassifierStatus
Adds a new S-entry to the set of entries to be processed.
addToR(int, int, int) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
Adds a new triplet to the set R.
addToS(int, int) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
Adds a new pair to the set S.
apply(ClassifierStatus, int, int, int) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RChain
 
apply(ClassifierStatus, int, int) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleProfiler
 
apply(ClassifierStatus, int, int, int) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleProfiler
 
apply(ClassifierStatus, int, int) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.SChain
 
apply(ClassifierStatus, int, int) - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR1SRule
 
apply(ClassifierStatus, int, int) - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR2SRule
 
apply(ClassifierStatus, int, int) - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR3SRule
 
apply(ClassifierStatus, int, int, int) - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR4RRule
 
apply(ClassifierStatus, int, int) - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR4SRule
 
apply(ClassifierStatus, int, int, int) - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR5RRule
 
apply(ClassifierStatus, int, int, int) - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR6RRule
 
apply(ClassifierStatus, int, int, int) - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR6RTrRule
 
apply(ClassifierStatus, int, int, int) - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR7RRule
 
apply(ClassifierStatus, int, int) - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR7SRule
 
apply(ClassifierStatus, int, int, int) - Method in interface de.tudresden.inf.lat.jcel.core.completion.common.RObserverRule
Applies the completion rule considering the specified relation entry.
apply(ClassifierStatus, int, int) - Method in interface de.tudresden.inf.lat.jcel.core.completion.common.SObserverRule
Applies the completion rule considering the specified subsumption entry.
apply(ClassifierStatus, int, int) - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR3SExtRule
 
apply(ClassifierStatus, int, int, int) - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR4RExtRule
 
apply(ClassifierStatus, int, int) - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR4SExtRule
 
apply(ClassifierStatus, int, int, int) - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR5RExtRule
 
apply(ClassifierStatus, int, int, int) - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR6RExtRule
 
apply(ClassifierStatus, int, int) - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR6SExtRule
 
apply(ClassifierStatus, int, int, int) - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR7RExtRule
 
apply(ClassifierStatus, int, int, int) - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR8RExtRule
 
apply(ClassifierStatus, int, int) - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR8SExtRule
 
apply(ClassifierStatus, int, int, int) - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR9RExtOptRule
 
apply(ClassifierStatus, int, int, int) - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR9RExtRule
 
apply(Set<NormalizedIntegerAxiom>) - Method in interface de.tudresden.inf.lat.jcel.core.saturation.SaturationRule
Applies the saturation rule to a specified set of normalized axioms.
apply(Set<NormalizedIntegerAxiom>) - Method in class de.tudresden.inf.lat.jcel.core.saturation.SR0Rule
 
apply(Set<NormalizedIntegerAxiom>) - Method in class de.tudresden.inf.lat.jcel.core.saturation.SR1AndSR2Rules
 
apply(Set<NormalizedIntegerAxiom>) - Method in class de.tudresden.inf.lat.jcel.core.saturation.SR3Rule
 
apply(Set<NormalizedIntegerAxiom>) - Method in class de.tudresden.inf.lat.jcel.core.saturation.SR4Rule
 
apply(Set<NormalizedIntegerAxiom>) - Method in class de.tudresden.inf.lat.jcel.core.saturation.SubPropertyNormalizer
Saturates a set of normalized axioms by applying rules SR-1, SR-2, SR-3, SR-4 and SR-5.
ArraySet - Class in de.tudresden.inf.lat.jcel.core.graph
This class implements a set of integers using a sorted array of int with exponential growth.
ArraySet() - Constructor for class de.tudresden.inf.lat.jcel.core.graph.ArraySet
Constructs an empty array set.
ArraySetIterator - Class in de.tudresden.inf.lat.jcel.core.graph
This class implements an iterator for an array set.
ArraySetIterator(int[], int) - Constructor for class de.tudresden.inf.lat.jcel.core.graph.ArraySetIterator
Constructs an iterator for an array set.
asExistential() - Method in interface de.tudresden.inf.lat.jcel.core.algorithm.cel.ExtensionEntry
Returns this entry as an existential entry.
asImplication() - Method in interface de.tudresden.inf.lat.jcel.core.algorithm.cel.ExtensionEntry
Returns this entry as an implication entry.

C

CelExtendedOntology - Class in de.tudresden.inf.lat.jcel.core.algorithm.cel
This class models an extended ontology.
CelExtendedOntology() - Constructor for class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelExtendedOntology
Constructs a new CEL extended ontology.
CelProcessor - Class in de.tudresden.inf.lat.jcel.core.algorithm.cel
Classifies an ontology using the CEL algorithm.
CelProcessor(Set<Integer>, Set<Integer>, Set<NormalizedIntegerAxiom>, NormalizedIntegerAxiomFactory, IntegerEntityManager) - Constructor for class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelProcessor
Constructs a new CEL processor.
ClassifierStatus - Interface in de.tudresden.inf.lat.jcel.core.completion.common
An class implementing this interface contains the axioms of the ontology and the main sets used in the classification process.
ClassifierStatusImpl - Class in de.tudresden.inf.lat.jcel.core.algorithm.rulebased
An object of this class keeps the status of the classifier.
ClassifierStatusImpl(IntegerEntityManager, ExtendedOntology) - Constructor for class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
Constructs a new classifier status.
clear() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelExtendedOntology
Clears all the internal sets.
clear() - Method in class de.tudresden.inf.lat.jcel.core.graph.ArraySet
 
clear() - Method in class de.tudresden.inf.lat.jcel.core.graph.HashArraySet
 
compareTo(REntry) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.REntryImpl
 
compareTo(SEntry) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.SEntryImpl
 
CompletionRuleChainSelector - Class in de.tudresden.inf.lat.jcel.core.algorithm.rulebased
An object of this class creates appropriate completion rule chains to process the ontology.
CompletionRuleChainSelector(OntologyExpressivity) - Constructor for class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.CompletionRuleChainSelector
Constructs a new ontology preprocessor.
contains(VNode) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
 
contains(VNode) - Method in interface de.tudresden.inf.lat.jcel.core.completion.common.ClassifierStatus
Returns whether a particular node belongs to the set V.
contains(Object) - Method in class de.tudresden.inf.lat.jcel.core.graph.ArraySet
 
contains(Object) - Method in class de.tudresden.inf.lat.jcel.core.graph.HashArraySet
 
contains(int, int) - Method in interface de.tudresden.inf.lat.jcel.core.graph.IntegerBinaryRelation
Tells whether a pair belongs to this binary relation.
contains(int, int) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerBinaryRelationImpl
 
contains(int) - Method in interface de.tudresden.inf.lat.jcel.core.graph.IntegerRelationMap
Tells whether a binary relation belongs to this map.
contains(int, int, int) - Method in interface de.tudresden.inf.lat.jcel.core.graph.IntegerRelationMap
Tells whether a binary relation contains a give pair.
contains(int) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerRelationMapImpl
 
contains(int, int, int) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerRelationMapImpl
 
containsAll(Collection<?>) - Method in class de.tudresden.inf.lat.jcel.core.graph.ArraySet
 
containsAll(Collection<?>) - Method in class de.tudresden.inf.lat.jcel.core.graph.HashArraySet
 
containsExistential(int, int) - Method in interface de.tudresden.inf.lat.jcel.core.graph.VNode
Tells whether this node contains the given existential expression.
containsExistential(int, int) - Method in class de.tudresden.inf.lat.jcel.core.graph.VNodeImpl
 
containsPair(int, int) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerBidirectionalGraphImpl
 
containsPair(int, int) - Method in interface de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerGraph
Tells whether this subsumer graph contains the given pair.
containsPair(int, int) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerGraphImpl
 
CR1SRule - Class in de.tudresden.inf.lat.jcel.core.completion.basic
CR-1 : if A ⊑ B ∈ T, (x, A) ∈ S
then S := S ∪ {(x, B)}
Previous form: CR0 : if A ∈ S(X) and A ⊑ B ∈ O
then S(X) := S(X) ∪ {B} This rule was not present in the original CEL algorithm.
CR1SRule() - Constructor for class de.tudresden.inf.lat.jcel.core.completion.basic.CR1SRule
Constructs a new completion rule CR-1.
CR2SRule - Class in de.tudresden.inf.lat.jcel.core.completion.basic
CR-2 : if A1 ⊓ A2 ⊑ B ∈ T, (x, A1) ∈ S, (x, A2) ∈ S
then S := S ∪ {(x, B)}
Previous forms: CR-2 : if A1 ⊓ … ⊓ Ai ⊓ … ⊓ An ⊑ B ∈ T, (x, A1) ∈ S, … (x, Ai) ∈ S, … , (x, An) ∈ S
then S := S ∪ {(x, B)} CR1 : if A1, … , An ∈ S(X) and A1 ⊓ … ⊓ An ⊑ B ∈ O and B ∉ S(X)
then S(X) := S(X) ∪ {B}
CR2SRule() - Constructor for class de.tudresden.inf.lat.jcel.core.completion.basic.CR2SRule
Constructs a new completion rule CR-2.
CR3SExtRule - Class in de.tudresden.inf.lat.jcel.core.completion.ext
CR-3 : if A ⊑ ∃ r . B ∈ T , (x, A) ∈ S
then if f(r)
     then v := (⊤ , {∃ r- . A})
          if v ∉ V then V := V ∪ {v}
          S := S ∪ {(v, B)} ∪ {(v, ⊤)}
          R := R ∪ {(r, x, v)}
     else y := (B, ∅)
          R := R ∪ {(r, x, y)}
CR3SExtRule() - Constructor for class de.tudresden.inf.lat.jcel.core.completion.ext.CR3SExtRule
Constructs a new completion rule CR-3.
CR3SRule - Class in de.tudresden.inf.lat.jcel.core.completion.basic
CR-3 : if A ⊑ ∃ r . B ∈ T, (x, A) ∈ S
then R := R ∪{(r, x, B)}
Previous form: CR2 : if A ∈ S(X) and A ⊑ ∃ r . B ∈ O and (X, B) ∉ R(r)
then R(r) := R(r) ∪{(X, B)}
CR3SRule() - Constructor for class de.tudresden.inf.lat.jcel.core.completion.basic.CR3SRule
Constructs a new completion rule CR-3.
CR4RExtRule - Class in de.tudresden.inf.lat.jcel.core.completion.ext
CR-4 : if ∃ s . A ⊑ B ∈ T, (r, x, y) ∈ R, (y, A) ∈ S, r ⊑T s
then S := S ∪ {(x, B)}
Previous form: CR3 : if (X, Y) ∈ R(r) and A ∈ S(Y) and ∃ r . A ⊑ B ∈ O and B ∉ S(X)
then S(X) := S(X) ∪ {B}
CR4RExtRule() - Constructor for class de.tudresden.inf.lat.jcel.core.completion.ext.CR4RExtRule
Constructs a new completion rule CR-4 (R).
CR4RRule - Class in de.tudresden.inf.lat.jcel.core.completion.basic
CR-4 : if ∃ r . A ⊑ B ∈ T, (r, x, y) ∈ R, (y, A) ∈ S
then S := S ∪ {(x, B)}
Previous form: CR3 : if (X, Y) ∈ R(r) and A ∈ S(Y) and ∃ r . A ⊑ B ∈ O and B ∉ S(X)
then S(X) := S(X) ∪ {B}
CR4RRule() - Constructor for class de.tudresden.inf.lat.jcel.core.completion.basic.CR4RRule
Constructs a new completion rule CR-4 (R).
CR4SExtRule - Class in de.tudresden.inf.lat.jcel.core.completion.ext
CR-4 : if ∃ s . A ⊑ B ∈ T, (r, x, y) ∈ R, (y, A) ∈ S, r ⊑T s
then S := S ∪ {(x, B)}
Previous form: CR3 : if (X, Y) ∈ R(r) and A ∈ S(Y) and ∃ r . A ⊑ B ∈ O and B ∉ S(X)
then S(X) := S(X) ∪ {B}
CR4SExtRule() - Constructor for class de.tudresden.inf.lat.jcel.core.completion.ext.CR4SExtRule
Constructs a new completion rule CR-4 (S).
CR4SRule - Class in de.tudresden.inf.lat.jcel.core.completion.basic
CR-4 : if ∃ r . A ⊑ B ∈ T, (r, x, y) ∈ R, (y, A) ∈ S
then S := S ∪ {(x, B)}
Previous form: CR3 : if (X, Y) ∈ R(r) and A ∈ S(Y) and ∃ r . A ⊑ B ∈ O and B ∉ S(X)
then S(X) := S(X) ∪ {B}
CR4SRule() - Constructor for class de.tudresden.inf.lat.jcel.core.completion.basic.CR4SRule
Constructs a new completion rule CR-4 (S).
CR5RExtRule - Class in de.tudresden.inf.lat.jcel.core.completion.ext
CR-5 : if s ∘ s ⊑ s ∈ T , (r1, x, y) ∈ R, (r2, y, z) ∈ R, r1T s, r2T s
then R := R ∪ {(s, x, z)}
CR5RExtRule() - Constructor for class de.tudresden.inf.lat.jcel.core.completion.ext.CR5RExtRule
Constructs a new completion rule CR-5.
CR5RRule - Class in de.tudresden.inf.lat.jcel.core.completion.basic
CR-5 : if r ⊑ s ∈ T, (r, x, y) ∈ R
then R := R ∪ {(s, x, y)}
Previous form: CR5 : if (X, Y) ∈ R(r) and r ⊑ s ∈ O and (X, Y) ∉ R(s)
then R(s) := R(s) ∪ {(X, Y)}
CR5RRule() - Constructor for class de.tudresden.inf.lat.jcel.core.completion.basic.CR5RRule
Constructs a new completion rule CR-5.
CR6RExtRule - Class in de.tudresden.inf.lat.jcel.core.completion.ext
CR-6 : if ∃ s- . A ⊑ B ∈ T, r ⊑T s, (r, x, y) ∈ R, (x, A) ∈ S , (y, B) ∉ S, y = (B', ψ)
then v := (B', ψ ∪ {∃ r - . A})
     if v ∉ V then V := V ∪ {v} , S := S ∪ {(v, k) | (y, k) ∈ S}
     S := S ∪ {(v, B)}
     R := R ∪ {(r, x, v)}
CR6RExtRule() - Constructor for class de.tudresden.inf.lat.jcel.core.completion.ext.CR6RExtRule
Constructs a new completion rule CR-6 (R).
CR6RRule - Class in de.tudresden.inf.lat.jcel.core.completion.basic
CR-6 : if r ∘ s ⊑ t ∈ T, (r, x, y) ∈ R, (s, y, z) ∈ R
then R := R ∪ {(t, x, z)}
Previous form: CR6 : if (X, Y) ∈ R(r) and (Y,Z) ∈ R(s) and r ∘ s ⊑ t ∈ O and (X,Z) ∉ R(t)
then R(t) := R(t) ∪ {(X, Z)}
CR6RRule() - Constructor for class de.tudresden.inf.lat.jcel.core.completion.basic.CR6RRule
Constructs a new completion rule CR-6.
CR6RTrRule - Class in de.tudresden.inf.lat.jcel.core.completion.basic
CR-6 : if r ∘ r ⊑ r ∈ T, (r, x, y) ∈ R, (r, y, z) ∈ R
then R := R ∪ {(r, x, z)}
This is a particular case of role composition.
CR6RTrRule() - Constructor for class de.tudresden.inf.lat.jcel.core.completion.basic.CR6RTrRule
Constructs a new completion rule CR-6 transitive.
CR6SExtRule - Class in de.tudresden.inf.lat.jcel.core.completion.ext
CR-6 : if ∃ s- . A ⊑ B ∈ T, r ⊑T s, (r, x, y) ∈ R, (x, A) ∈ S , (y, B) ∉ S, y = (B', ψ)
then v := (B', ψ ∪ {∃ r - . A})
     if v ∉ V then V := V ∪ {v} , S := S ∪ {(v, k) | (y, k) ∈ S}
     S := S ∪ {(v, B)}
     R := R ∪ {(r, x, v)}
CR6SExtRule() - Constructor for class de.tudresden.inf.lat.jcel.core.completion.ext.CR6SExtRule
Constructs a new completion rule CR-6 (S).
CR7RExtRule - Class in de.tudresden.inf.lat.jcel.core.completion.ext
CR-7 : if ∃ s- . A ⊑ B ∈ T , (r2, x, y) ∈ R, x = (A', φ) , y = (B', ψ),
r ∘ r ⊑ r ∈ T, r1T r, r2T r, ∃ r1- . A ∈ φ, r ⊑T s
then v := (B', ψ ∪ {∃ r- . A})
     if v ∉ V then V := V ∪ {v} , S := S ∪ {(v, k) | (y, k) ∈ S}
     S := S ∪ {(v, B)}
     R := R ∪ {(r2, x, v)}
CR7RExtRule() - Constructor for class de.tudresden.inf.lat.jcel.core.completion.ext.CR7RExtRule
Constructs a new completion rule CR-7.
CR7RRule - Class in de.tudresden.inf.lat.jcel.core.completion.basic
CR-7 : if (r, x, y) ∈ R, (y, ⊥) ∈ S
then S := S ∪ {(x, ⊥)}
Previous form: CR4 : if (X, Y) ∈ R(r) and ⊥ ∈ S(Y) and ⊥ ∉ S(X)
then S(X) := S(X) ∪ {⊥}
CR7RRule() - Constructor for class de.tudresden.inf.lat.jcel.core.completion.basic.CR7RRule
Constructs a new completion rule CR bottom (R).
CR7SRule - Class in de.tudresden.inf.lat.jcel.core.completion.basic
CR-7 : if (r, x, y) ∈ R, (y, ⊥) ∈ S
then S := S ∪ {(x, ⊥)}
Previous form: CR4 : if (X, Y) ∈ R(r) and ⊥ ∈ S(Y) and ⊥ ∉ S(X)
then S(X) := S(X) ∪ {⊥}
CR7SRule() - Constructor for class de.tudresden.inf.lat.jcel.core.completion.basic.CR7SRule
Constructs a new completion rule CR bottom (S).
CR8RExtRule - Class in de.tudresden.inf.lat.jcel.core.completion.ext
CR-8 : if A ⊑ ∃ r2- . B ∈ T , (r1, x, y) ∈ R, (y, A) ∈ S, r1T s, r2T s, f(s-)
then S := S ∪ {(x, B)}
CR8RExtRule() - Constructor for class de.tudresden.inf.lat.jcel.core.completion.ext.CR8RExtRule
Constructs a new completion rule CR-8 (R).
CR8SExtRule - Class in de.tudresden.inf.lat.jcel.core.completion.ext
CR-8 : if A ⊑ ∃ r2- . B ∈ T , (r1, x, y) ∈ R, (y, A) ∈ S, r1T s, r2T s, f(s-)
then S := S ∪ {(x, B)}
CR8SExtRule() - Constructor for class de.tudresden.inf.lat.jcel.core.completion.ext.CR8SExtRule
Constructs a new completion rule CR-8 (S).
CR9RExtOptRule - Class in de.tudresden.inf.lat.jcel.core.completion.ext
CR-9 (optimized) : if (r1, x, y1) ∈ R, (r2, x, y2) ∈ R, …, (rn, x, yn) ∈ R,
r1T s, r2T s, …, rnT s, yi = (⊤ , ψi) for 1 ≤ i ≤ n, yi ≠ yj for 1 ≤ i < j ≤ n, f(s)
then v := (⊤ , ψ1 ∪ … ∪ ψn)
     if v ∉ V then V := V ∪ {v}
     S := S ∪ {(v, k) | (y1, k) ∈ S} ∪ … ∪ {(v, k) | (yn, k) ∈ S}
     R := R ∪ {(r1, x, v)}
CR9RExtOptRule() - Constructor for class de.tudresden.inf.lat.jcel.core.completion.ext.CR9RExtOptRule
Constructs a new completion rule CR-9.
CR9RExtRule - Class in de.tudresden.inf.lat.jcel.core.completion.ext
CR-9 : if (r1, x, y) ∈ R, (r2, x, z) ∈ R, r1T s, r2T s, y = (⊤ , ψ), z = (⊤ , φ), y ≠ z, f(s)
then v := (⊤ , ψ ∪ φ)
     if v ∉ V then V := V ∪ {v}
     S := S ∪ {(v, k) | (y, k) ∈ S} ∪ {(v, k) | (z, k) ∈ S}
     R := R ∪ {(r1, x, v)}
CR9RExtRule() - Constructor for class de.tudresden.inf.lat.jcel.core.completion.ext.CR9RExtRule
Constructs a new completion rule CR-9.
createOrGetNodeId(VNode) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
 
createOrGetNodeId(VNode) - Method in interface de.tudresden.inf.lat.jcel.core.completion.common.ClassifierStatus
Gets the identifier of a node, or creates a new one.

D

de.tudresden.inf.lat.jcel.core.algorithm - package de.tudresden.inf.lat.jcel.core.algorithm
Provides interfaces and classes to run the classification algorithm.
de.tudresden.inf.lat.jcel.core.algorithm.cel - package de.tudresden.inf.lat.jcel.core.algorithm.cel
Provides interfaces and classes to run the classification algorithm of CEL.
de.tudresden.inf.lat.jcel.core.algorithm.common - package de.tudresden.inf.lat.jcel.core.algorithm.common
Provides common interfaces and classes to run the classification algorithm.
de.tudresden.inf.lat.jcel.core.algorithm.module - package de.tudresden.inf.lat.jcel.core.algorithm.module
Provides interfaces and classes to extract modules.
de.tudresden.inf.lat.jcel.core.algorithm.rulebased - package de.tudresden.inf.lat.jcel.core.algorithm.rulebased
Provides interfaces and classes to run a classification algorithm based on completion rules.
de.tudresden.inf.lat.jcel.core.completion - package de.tudresden.inf.lat.jcel.core.completion
Provides interfaces and classes of the completion rules for the classification algorithm.
de.tudresden.inf.lat.jcel.core.completion.basic - package de.tudresden.inf.lat.jcel.core.completion.basic
Provides interfaces and classes of the basic rules for the classification algorithm.
de.tudresden.inf.lat.jcel.core.completion.common - package de.tudresden.inf.lat.jcel.core.completion.common
Provides common interfaces and classes for the rules of the classification algorithm.
de.tudresden.inf.lat.jcel.core.completion.ext - package de.tudresden.inf.lat.jcel.core.completion.ext
Provides interfaces and classes of the extended set of rules for the classification algorithm.
de.tudresden.inf.lat.jcel.core.graph - package de.tudresden.inf.lat.jcel.core.graph
Provides interfaces and classes used to represent the data during the classification process.
de.tudresden.inf.lat.jcel.core.saturation - package de.tudresden.inf.lat.jcel.core.saturation
Provides interfaces and classes needed to perform the saturation.
deleteClassGraph() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
Deletes the class graph.
deleteObjectPropertyGraph() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
Deletes the object property graph.
disjointUnion(IntegerHierarchicalGraph) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerHierarchicalGraphImpl
Makes a disjoint union with another graph.

E

EMPTY - Static variable in class de.tudresden.inf.lat.jcel.core.graph.HashArraySet
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.REntryImpl
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.SEntryImpl
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR1SRule
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR2SRule
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR3SRule
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR4RRule
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR4SRule
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR5RRule
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR6RRule
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR6RTrRule
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR7RRule
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR7SRule
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR3SExtRule
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR4RExtRule
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR4SExtRule
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR5RExtRule
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR6RExtRule
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR6SExtRule
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR7RExtRule
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR8RExtRule
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR8SExtRule
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR9RExtOptRule
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR9RExtRule
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.graph.ArraySet
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.graph.ArraySetIterator
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.graph.HashArraySet
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.graph.HashArraySetIterator
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerBinaryRelationImpl
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerHierarchicalGraphImpl
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerRelationMapImpl
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerBidirectionalGraphImpl
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerGraphImpl
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.graph.VNodeImpl
 
equals(Object) - Method in class de.tudresden.inf.lat.jcel.core.graph.VNodeObjectSomeValuesFromImpl
 
ExtensionEntry - Interface in de.tudresden.inf.lat.jcel.core.algorithm.cel
This class models an entry for the queues.
extractModule(Collection<NormalizedIntegerAxiom>, Set<Integer>, Set<Integer>) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.module.ModuleExtractor
Returns a module, i.e.

G

get(int) - Method in interface de.tudresden.inf.lat.jcel.core.graph.IntegerRelationMap
 
get(int) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerRelationMapImpl
 
getAncestors(Integer) - Method in interface de.tudresden.inf.lat.jcel.core.graph.IntegerHierarchicalGraph
Returns all predecessors of a particular given vertex.
getAncestors(Integer) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerHierarchicalGraphImpl
 
getBottomElement() - Method in interface de.tudresden.inf.lat.jcel.core.graph.IntegerHierarchicalGraph
Returns the bottom element.
getBottomElement() - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerHierarchicalGraphImpl
 
getBottomElement() - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerBidirectionalGraphImpl
 
getBottomElement() - Method in interface de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerGraph
Returns the bottom element.
getBottomElement() - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerGraphImpl
 
getByFirst(int) - Method in interface de.tudresden.inf.lat.jcel.core.graph.IntegerBinaryRelation
Returns the elements connecting from a particular element in the first component.
getByFirst(int) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerBinaryRelationImpl
 
getByFirst(int, int) - Method in interface de.tudresden.inf.lat.jcel.core.graph.IntegerRelationMap
Returns the elements connecting from a particular element in the first component.
getByFirst(int, int) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerRelationMapImpl
 
getBySecond(int) - Method in interface de.tudresden.inf.lat.jcel.core.graph.IntegerBinaryRelation
Returns the elements connecting to a particular element in the second component.
getBySecond(int) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerBinaryRelationImpl
 
getBySecond(int, int) - Method in interface de.tudresden.inf.lat.jcel.core.graph.IntegerRelationMap
Returns the elements connecting to a particular element in the second component.
getBySecond(int, int) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerRelationMapImpl
 
getChildren(Integer) - Method in interface de.tudresden.inf.lat.jcel.core.graph.IntegerHierarchicalGraph
Returns all direct successors of a particular given vertex.
getChildren(Integer) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerHierarchicalGraphImpl
 
getClassEntries(Integer) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelExtendedOntology
Returns the class entries related to the specified class.
getClassGraph() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelProcessor
Returns the class graph.
getClassGraph() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
Returns the class graph.
getClassGraph() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleBasedProcessor
Returns the class graph.
getClassGraphMonitor() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
 
getClassGraphMonitor() - Method in interface de.tudresden.inf.lat.jcel.core.completion.common.ClassifierStatus
Returns the monitor of set S.
getClassHierarchy() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelProcessor
 
getClassHierarchy() - Method in interface de.tudresden.inf.lat.jcel.core.algorithm.common.Processor
Returns the class hierarchy after the classification has finished.
getClassHierarchy() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleBasedProcessor
 
getClassId() - Method in interface de.tudresden.inf.lat.jcel.core.graph.VNode
Returns the class identifier for this node.
getClassId() - Method in class de.tudresden.inf.lat.jcel.core.graph.VNodeImpl
 
getClassId() - Method in interface de.tudresden.inf.lat.jcel.core.graph.VNodeObjectSomeValuesFrom
Returns the class identifier.
getClassId() - Method in class de.tudresden.inf.lat.jcel.core.graph.VNodeObjectSomeValuesFromImpl
 
getClassSet() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelExtendedOntology
Returns the set of classes.
getConfigurationInfo() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleBasedProcessor
Returns information about how the processor configuration.
getDataPropertyHierarchy() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelProcessor
 
getDataPropertyHierarchy() - Method in interface de.tudresden.inf.lat.jcel.core.algorithm.common.Processor
Returns the data property hierarchy after the classification has finished.
getDataPropertyHierarchy() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleBasedProcessor
 
getDeepSize() - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerBinaryRelationImpl
Returns the number of elements in the internal maps that are referred by the keys, without counting the keys themselves.
getDeepSize() - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerRelationMapImpl
Returns the number of elements in the internal maps that are referred by the keys, without counting the keys themselves.
getDeepSize() - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerGraphImpl
Returns the number of elements in the internal maps that are referred by the keys, without counting the keys themselves.
getDeepSize() - Method in class de.tudresden.inf.lat.jcel.core.graph.VNodeImpl
Returns the number of elements in the set of entries.
getDeepSizeOfR() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
Returns the number of nodes in the relation set.
getDeepSizeOfS() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
Returns the number of nodes in the subsumer set.
getDeepSizeOfV() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
Returns the number of elements in the node set.
getDescendants(Integer) - Method in interface de.tudresden.inf.lat.jcel.core.graph.IntegerHierarchicalGraph
Returns all successors of a particular given vertex.
getDescendants(Integer) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerHierarchicalGraphImpl
 
getDirectTypes() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelProcessor
 
getDirectTypes() - Method in interface de.tudresden.inf.lat.jcel.core.algorithm.common.Processor
Returns the map of direct types for every individual.
getDirectTypes() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleBasedProcessor
 
getElements() - Method in interface de.tudresden.inf.lat.jcel.core.graph.IntegerBinaryRelation
 
getElements() - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerBinaryRelationImpl
 
getElements() - Method in interface de.tudresden.inf.lat.jcel.core.graph.IntegerHierarchicalGraph
Returns all the vertices in the graph.
getElements() - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerHierarchicalGraphImpl
 
getElements() - Method in interface de.tudresden.inf.lat.jcel.core.graph.IntegerRelationMap
 
getElements() - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerRelationMapImpl
 
getElements() - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerBidirectionalGraphImpl
 
getElements() - Method in interface de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerGraph
Returns the collection of vertices in the graph.
getElements() - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerGraphImpl
 
getEntityManager() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelProcessor
Returns the id generator.
getEquivalents(Integer) - Method in interface de.tudresden.inf.lat.jcel.core.graph.IntegerHierarchicalGraph
Returns all vertices that are in a cycle for a given vertex and the vertex itself.
getEquivalents(Integer) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerHierarchicalGraphImpl
 
getExistentialEntries(Integer, Integer) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelExtendedOntology
Returns the existential entries related to the specified object property and class.
getExistentialEntries() - Method in interface de.tudresden.inf.lat.jcel.core.graph.VNode
Returns a collection containing the existential expressions.
getExistentialEntries() - Method in class de.tudresden.inf.lat.jcel.core.graph.VNodeImpl
 
getExtendedOntology() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
 
getExtendedOntology() - Method in interface de.tudresden.inf.lat.jcel.core.completion.common.ClassifierStatus
Return an ontology with convenience methods to get its axioms.
getFirstBySecond(int, int) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
 
getFirstBySecond(int, int) - Method in interface de.tudresden.inf.lat.jcel.core.completion.common.ClassifierStatus
Returns all the classes that are related to a certain class using a certain object property
getIdGenerator() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
Returns the identifier generator.
getInverseObjectPropertyOf(int) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
 
getInverseObjectPropertyOf(int) - Method in interface de.tudresden.inf.lat.jcel.core.completion.common.ClassifierStatus
Returns the inverse object property of a particular object property.
getLeftClass() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.REntryImpl
 
getLeftClass() - Method in interface de.tudresden.inf.lat.jcel.core.completion.common.REntry
Returns the class in the left part of this entry.
getList() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RChain
Returns the list of relation observers.
getList() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.SChain
Returns the list of subsumption observers.
getNode(int) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
 
getNode(int) - Method in interface de.tudresden.inf.lat.jcel.core.completion.common.ClassifierStatus
Returns the node for a given node identifier.
getNonEquivalentElements() - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerHierarchicalGraphImpl
Returns one vertex for each equivalence class of vertices in the graph.
getNumberOfREntries() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
Returns the number of R-entries to be processed.
getNumberOfSEntries() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
Returns the number of S-entries to be processed.
getObjectPropertiesByFirst(int) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
 
getObjectPropertiesByFirst(int) - Method in interface de.tudresden.inf.lat.jcel.core.completion.common.ClassifierStatus
Returns the set of object properties related with a certain class as a first component.
getObjectPropertiesBySecond(int) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
 
getObjectPropertiesBySecond(int) - Method in interface de.tudresden.inf.lat.jcel.core.completion.common.ClassifierStatus
Returns the set of object properties related with a certain class as a second component.
getObjectPropertiesWithFunctionalAncestor(int) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
 
getObjectPropertiesWithFunctionalAncestor(int) - Method in interface de.tudresden.inf.lat.jcel.core.completion.common.ClassifierStatus
Returns all the functional object properties that have a common functional object property ancestor of the specified object property.
getObjectPropertyGraph() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
Returns the object property graph.
getObjectPropertyHierarchy() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelProcessor
 
getObjectPropertyHierarchy() - Method in interface de.tudresden.inf.lat.jcel.core.algorithm.common.Processor
Returns the object property hierarchy after the classification has finished.
getObjectPropertyHierarchy() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleBasedProcessor
 
getObjectPropertyId() - Method in interface de.tudresden.inf.lat.jcel.core.graph.VNodeObjectSomeValuesFrom
Returns the object property identifier.
getObjectPropertyId() - Method in class de.tudresden.inf.lat.jcel.core.graph.VNodeObjectSomeValuesFromImpl
 
getOntologyExpressivity() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.CompletionRuleChainSelector
Returns the ontology expressivity.
getOntologyObjectFactory() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelProcessor
 
getOntologyObjectFactory() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleBasedProcessor
Returns the ontology object factory.
getParents(Integer) - Method in interface de.tudresden.inf.lat.jcel.core.graph.IntegerHierarchicalGraph
Returns all direct predecessors of a particular given vertex.
getParents(Integer) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerHierarchicalGraphImpl
 
getProperty() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.REntryImpl
 
getProperty() - Method in interface de.tudresden.inf.lat.jcel.core.completion.common.REntry
Returns the class in the left part of this entry.
getRChain() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.CompletionRuleChainSelector
Returns the completion rule chain for the set of relations.
getRelation(Integer) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelProcessor
Returns the binary relation for a given id, or and empty relation if the id is unknown.
getRelation(Integer) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleBasedProcessor
Returns the binary relation for a given id, or and empty relation if the id is unknown.
getRelationIdSet() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelProcessor
Returns a set containing all relation ids.
getRelationIdSet() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleBasedProcessor
Returns a set containing all relation ids.
getRelationsByFirst(int) - Method in interface de.tudresden.inf.lat.jcel.core.graph.IntegerRelationMap
Returns the relations which use a particular element in the first component.
getRelationsByFirst(int) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerRelationMapImpl
 
getRelationsBySecond(int) - Method in interface de.tudresden.inf.lat.jcel.core.graph.IntegerRelationMap
Returns the relations which use a particular element in the second component.
getRelationsBySecond(int) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerRelationMapImpl
 
getRelationSet() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
Returns the set of relations.
getRelationSetMonitor() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
 
getRelationSetMonitor() - Method in interface de.tudresden.inf.lat.jcel.core.completion.common.ClassifierStatus
Returns the monitor of set R.
getRightClass() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.REntryImpl
 
getRightClass() - Method in interface de.tudresden.inf.lat.jcel.core.completion.common.REntry
Returns the object property of this entry.
getSameIndividualMap() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelProcessor
 
getSameIndividualMap() - Method in interface de.tudresden.inf.lat.jcel.core.algorithm.common.Processor
Returns the map of same individuals.
getSameIndividualMap() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleBasedProcessor
 
getSChain() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.CompletionRuleChainSelector
Returns the completion rule chain for the set of subsumers.
getSecondByFirst(int, int) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
 
getSecondByFirst(int, int) - Method in interface de.tudresden.inf.lat.jcel.core.completion.common.ClassifierStatus
Returns all the classes that are related from a certain class using a certain object property
getSizeOfV() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
Returns the number of nodes.
getStatusInfo() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleBasedProcessor
Returns information about the processor status.
getSubClass() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.SEntryImpl
 
getSubClass() - Method in interface de.tudresden.inf.lat.jcel.core.completion.common.SEntry
Returns the subclass of this entry.
getSubObjectProperties(int) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
 
getSubObjectProperties(int) - Method in interface de.tudresden.inf.lat.jcel.core.completion.common.ClassifierStatus
Returns all the sub object properties of an object property.
getSubPropertyAxiomSetByLeft(Integer) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelExtendedOntology
Returns the set of sub object property axioms related where the specified object property occurs on the left-hand part of the composition.
getSubPropertyAxiomSetByRight(Integer) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelExtendedOntology
Returns the set of sub object property axioms related where the specified object property occurs on the right-hand part of the composition.
getSubsumees(int) - Method in interface de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerBidirectionalGraph
Returns the collection of subsumees of a given vertex.
getSubsumees(int) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerBidirectionalGraphImpl
 
getSubsumers(int) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
 
getSubsumers(int) - Method in interface de.tudresden.inf.lat.jcel.core.completion.common.ClassifierStatus
Returns all the super classes (subsumers) of a class.
getSubsumers(int) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerBidirectionalGraphImpl
 
getSubsumers(int) - Method in interface de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerGraph
Returns the collection of subsumers of a given vertex.
getSubsumers(int) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerGraphImpl
 
getSuccessful() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleProfiler
Returns the number of successful applications of the completion rule.
getSuperClass() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.SEntryImpl
 
getSuperClass() - Method in interface de.tudresden.inf.lat.jcel.core.completion.common.SEntry
Returns the superclass of this entry.
getSuperObjectProperties(int) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
 
getSuperObjectProperties(int) - Method in interface de.tudresden.inf.lat.jcel.core.completion.common.ClassifierStatus
Returns all the super object properties of an object property.
getTimes() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleProfiler
Returns the number of times that the completion rule was tried to be applied.
getTopElement() - Method in interface de.tudresden.inf.lat.jcel.core.graph.IntegerHierarchicalGraph
Returns the top element.
getTopElement() - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerHierarchicalGraphImpl
 
getTopElement() - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerBidirectionalGraphImpl
 
getTopElement() - Method in interface de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerGraph
Returns the top element.
getTopElement() - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerGraphImpl
 
getTotalTime() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleProfiler
Returns the total time used to process all the entries.

H

HashArraySet - Class in de.tudresden.inf.lat.jcel.core.graph
This class implements a set of integers using an array of int with exponential growth.
HashArraySet() - Constructor for class de.tudresden.inf.lat.jcel.core.graph.HashArraySet
Constructs an empty array set.
HashArraySetIterator - Class in de.tudresden.inf.lat.jcel.core.graph
This class implements an iterator for a hash array set.
HashArraySetIterator(int[], int) - Constructor for class de.tudresden.inf.lat.jcel.core.graph.HashArraySetIterator
Constructs an iterator for an array set.
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.REntryImpl
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.SEntryImpl
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR1SRule
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR2SRule
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR3SRule
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR4RRule
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR4SRule
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR5RRule
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR6RRule
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR6RTrRule
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR7RRule
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR7SRule
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR3SExtRule
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR4RExtRule
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR4SExtRule
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR5RExtRule
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR6RExtRule
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR6SExtRule
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR7RExtRule
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR8RExtRule
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR8SExtRule
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR9RExtOptRule
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR9RExtRule
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.graph.ArraySet
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.graph.ArraySetIterator
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.graph.HashArraySet
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.graph.HashArraySetIterator
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerBinaryRelationImpl
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerHierarchicalGraphImpl
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerRelationMapImpl
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerBidirectionalGraphImpl
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerGraphImpl
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.graph.VNodeImpl
 
hashCode() - Method in class de.tudresden.inf.lat.jcel.core.graph.VNodeObjectSomeValuesFromImpl
 
hasNext() - Method in class de.tudresden.inf.lat.jcel.core.graph.ArraySetIterator
 
hasNext() - Method in class de.tudresden.inf.lat.jcel.core.graph.HashArraySetIterator
 

I

IntegerBinaryRelation - Interface in de.tudresden.inf.lat.jcel.core.graph
This interface models a binary relation.
IntegerBinaryRelationImpl - Class in de.tudresden.inf.lat.jcel.core.graph
This class implements a binary relation.
IntegerBinaryRelationImpl() - Constructor for class de.tudresden.inf.lat.jcel.core.graph.IntegerBinaryRelationImpl
Constructs an empty binary relation.
IntegerHierarchicalGraph - Interface in de.tudresden.inf.lat.jcel.core.graph
This interface is implemented by classes modeling a directed graph considering equivalent classes.
IntegerHierarchicalGraphImpl - Class in de.tudresden.inf.lat.jcel.core.graph
This class implements the algorithm that computes the class hierarchy from the subsumer set.
IntegerHierarchicalGraphImpl(Integer, Integer) - Constructor for class de.tudresden.inf.lat.jcel.core.graph.IntegerHierarchicalGraphImpl
Constructs an empty hierarchical graph.
IntegerHierarchicalGraphImpl(IntegerSubsumerGraph) - Constructor for class de.tudresden.inf.lat.jcel.core.graph.IntegerHierarchicalGraphImpl
Constructs a hierarchical graph using another graph.
IntegerRelationMap - Interface in de.tudresden.inf.lat.jcel.core.graph
This interface models a map of binary relations.
IntegerRelationMapImpl - Class in de.tudresden.inf.lat.jcel.core.graph
This class implements a map of binary relations.
IntegerRelationMapImpl() - Constructor for class de.tudresden.inf.lat.jcel.core.graph.IntegerRelationMapImpl
Constructs an empty map of binary relations.
IntegerSubsumerBidirectionalGraph - Interface in de.tudresden.inf.lat.jcel.core.graph
This interface models a subsumer graph where it is possible to get also the subsumees for a particular vertex.
IntegerSubsumerBidirectionalGraphImpl - Class in de.tudresden.inf.lat.jcel.core.graph
This class implements a subsumer invGraph.
IntegerSubsumerBidirectionalGraphImpl(int, int) - Constructor for class de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerBidirectionalGraphImpl
Constructs an empty subsumer bidirectional graph.
IntegerSubsumerGraph - Interface in de.tudresden.inf.lat.jcel.core.graph
This interface models a subsumer graph.
IntegerSubsumerGraphImpl - Class in de.tudresden.inf.lat.jcel.core.graph
This class implements a subsumer graph.
IntegerSubsumerGraphImpl(int, int) - Constructor for class de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerGraphImpl
Constructs an empty subsumer graph.
isEmpty() - Method in class de.tudresden.inf.lat.jcel.core.graph.ArraySet
 
isEmpty() - Method in class de.tudresden.inf.lat.jcel.core.graph.HashArraySet
 
isEmpty() - Method in interface de.tudresden.inf.lat.jcel.core.graph.VNode
Tell whether a node has an empty set of existential expressions.
isEmpty() - Method in class de.tudresden.inf.lat.jcel.core.graph.VNodeImpl
 
isExistential() - Method in interface de.tudresden.inf.lat.jcel.core.algorithm.cel.ExtensionEntry
Tell whether or not this is an existential entry.
isImplication() - Method in interface de.tudresden.inf.lat.jcel.core.algorithm.cel.ExtensionEntry
Tell whether or not this is an implication entry.
isReady() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelProcessor
 
isReady() - Method in interface de.tudresden.inf.lat.jcel.core.algorithm.common.Processor
Tells whether the processor has classified the class hierarchy and object property hierarchy.
isReady() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleBasedProcessor
 
isREntry() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.REntryImpl
 
isREntry() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.SEntryImpl
 
isREntry() - Method in interface de.tudresden.inf.lat.jcel.core.completion.common.XEntry
Tells whether this entry is a relation entry.
isSEntry() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.REntryImpl
 
isSEntry() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.SEntryImpl
 
isSEntry() - Method in interface de.tudresden.inf.lat.jcel.core.completion.common.XEntry
Tells whether this entry is a subsumer entry.
iterator() - Method in class de.tudresden.inf.lat.jcel.core.graph.ArraySet
 
iterator() - Method in class de.tudresden.inf.lat.jcel.core.graph.HashArraySet
 

L

load(Set<NormalizedIntegerAxiom>) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelExtendedOntology
Loads a set of normalized axioms.
loadPrefixes(Collection<String>) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.TurtleRenderer
Loads a set of names and gets the prefixes from these names.

M

ModuleExtractor - Class in de.tudresden.inf.lat.jcel.core.algorithm.module
An object of this class is a module extractor, i.e.
ModuleExtractor() - Constructor for class de.tudresden.inf.lat.jcel.core.algorithm.module.ModuleExtractor
Constructs a new module extractor.

N

next() - Method in class de.tudresden.inf.lat.jcel.core.graph.ArraySetIterator
 
next() - Method in class de.tudresden.inf.lat.jcel.core.graph.HashArraySetIterator
 

O

outputSetR(Writer) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
 
outputSetR(Writer) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleBasedProcessor
 
outputSetS(Writer) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
 
outputSetS(Writer) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleBasedProcessor
 

P

postProcess() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelProcessor
Post processes the data after the classification phase.
postProcess() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleBasedProcessor
Post processes the data after the classification phase.
preProcess(Set<Integer>, Set<Integer>, Set<NormalizedIntegerAxiom>) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelProcessor
The configuration follows the following steps: normalizes the ontology creating auxiliary entities creates an extended ontonlogy based on the normalized ontology adds the classes creates the property hierarchy prepares all the queues to run the algorithm
preProcess(ExtendedOntology) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleBasedProcessor
The configuration follows the following steps: creates the property hierarchy prepares all the queues to run the algorithm
process() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelProcessor
 
process() - Method in interface de.tudresden.inf.lat.jcel.core.algorithm.common.Processor
Makes one step in the process of classification.
process() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleBasedProcessor
 
Processor - Interface in de.tudresden.inf.lat.jcel.core.algorithm.common
An object implementing this interface can classify a set of axioms.

R

RChain - Class in de.tudresden.inf.lat.jcel.core.algorithm.rulebased
An object implementing this class is a completion rule chain for the set of relations.
RChain(List<RObserverRule>) - Constructor for class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RChain
Constructs a new chain for the set of relations.
remove(Object) - Method in class de.tudresden.inf.lat.jcel.core.graph.ArraySet
 
remove() - Method in class de.tudresden.inf.lat.jcel.core.graph.ArraySetIterator
 
remove(Object) - Method in class de.tudresden.inf.lat.jcel.core.graph.HashArraySet
 
remove() - Method in class de.tudresden.inf.lat.jcel.core.graph.HashArraySetIterator
 
removeAll(Collection<?>) - Method in class de.tudresden.inf.lat.jcel.core.graph.ArraySet
 
removeAll(Collection<?>) - Method in class de.tudresden.inf.lat.jcel.core.graph.HashArraySet
 
removeNextREntry() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
Returns the next R-entry and removes it from the set to be processed.
removeNextSEntry() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.ClassifierStatusImpl
Returns the next S-entry and removes it from the set to be processed.
Renderer - Class in de.tudresden.inf.lat.jcel.core.algorithm.rulebased
An object of this class renders the important data structures used in the classification.
Renderer() - Constructor for class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.Renderer
 
renderPrefixes() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.TurtleRenderer
Renders the prefixes with their abbreviations.
renderTriple(String, String, String) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.TurtleRenderer
Renders a triple trying to replace prefixes by their abbreviations.
renderWithNames(Writer, IntegerEntityManager, IntegerRelationMap) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.Renderer
Renders set R using Turtle syntax.
renderWithNames(Writer, IntegerEntityManager, IntegerSubsumerGraph) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.Renderer
Renders set S using Turtle syntax.
REntry - Interface in de.tudresden.inf.lat.jcel.core.completion.common
This interface models a relation entry and can be used by a relation observer.
REntryImpl - Class in de.tudresden.inf.lat.jcel.core.algorithm.rulebased
An object of this class is a relation entry and can be used by a relation observer.
REntryImpl(int, int, int) - Constructor for class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.REntryImpl
Constructs a new relation entry (R-entry).
retainAll(Collection<?>) - Method in class de.tudresden.inf.lat.jcel.core.graph.ArraySet
 
retainAll(Collection<?>) - Method in class de.tudresden.inf.lat.jcel.core.graph.HashArraySet
 
retainAll(Collection<Integer>) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerBidirectionalGraphImpl
Retains only the elements contained in the collection.
retainAll(Collection<Integer>) - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerGraphImpl
Retains only the elements contained in the collection.
RObserverRule - Interface in de.tudresden.inf.lat.jcel.core.completion.common
This is the interface of a relation observer.
RuleBasedProcessor - Class in de.tudresden.inf.lat.jcel.core.algorithm.rulebased
An object of this class is an implementation of a classification algorithm.
RuleBasedProcessor(Set<Integer>, Set<Integer>, Set<NormalizedIntegerAxiom>, OntologyExpressivity, NormalizedIntegerAxiomFactory, IntegerEntityManager) - Constructor for class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleBasedProcessor
Constructs a new rule-based processor.
RuleProfiler - Class in de.tudresden.inf.lat.jcel.core.algorithm.rulebased
An object implementing this class is a profiler for completion rules.
RuleProfiler(RObserverRule) - Constructor for class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleProfiler
Constructs a new profiler for an R-rule.
RuleProfiler(SObserverRule) - Constructor for class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleProfiler
Constructs a new profiler for an S-rule.

S

SaturationRule - Interface in de.tudresden.inf.lat.jcel.core.saturation
This interface is implemented by saturation rules.
SChain - Class in de.tudresden.inf.lat.jcel.core.algorithm.rulebased
An object implementing this class is a completion rule chain for the set of subsumers.
SChain(List<SObserverRule>) - Constructor for class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.SChain
Constructs a new chain for the set of subsumers.
SEntry - Interface in de.tudresden.inf.lat.jcel.core.completion.common
This interface models a subsumer entry and can be used by a subsumer observer.
SEntryImpl - Class in de.tudresden.inf.lat.jcel.core.algorithm.rulebased
An object of this class is a subsumer entry and can be used by a subsumer observer.
SEntryImpl(int, int) - Constructor for class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.SEntryImpl
Constructs a new subsumer entry (S-entry).
showConfigurationInfo() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleBasedProcessor
 
showStatusInfo() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleBasedProcessor
 
size() - Method in class de.tudresden.inf.lat.jcel.core.graph.ArraySet
 
size() - Method in class de.tudresden.inf.lat.jcel.core.graph.HashArraySet
 
SObserverRule - Interface in de.tudresden.inf.lat.jcel.core.completion.common
This is the interface of a subsumption observer.
SR0Rule - Class in de.tudresden.inf.lat.jcel.core.saturation
For each object property r, this rule adds r ⊑ r.
SR0Rule(NormalizedIntegerAxiomFactory) - Constructor for class de.tudresden.inf.lat.jcel.core.saturation.SR0Rule
Constructs a new SR-0 rule.
SR1AndSR2Rules - Class in de.tudresden.inf.lat.jcel.core.saturation
SR-1 : r ⊑ s ↝ r- ⊑ s- SR-2 : r ⊑ s, s ⊑ t ↝ r ⊑ t
SR1AndSR2Rules(NormalizedIntegerAxiomFactory, IntegerEntityManager) - Constructor for class de.tudresden.inf.lat.jcel.core.saturation.SR1AndSR2Rules
Constructs a new composite rule of SR-1 and SR-2.
SR3Rule - Class in de.tudresden.inf.lat.jcel.core.saturation
SR-3 : r ∘ s ⊑ t ↝ s- ∘ r- ⊑ t-
SR3Rule(NormalizedIntegerAxiomFactory, IntegerEntityManager) - Constructor for class de.tudresden.inf.lat.jcel.core.saturation.SR3Rule
Constructs a new SR-3 rule.
SR4Rule - Class in de.tudresden.inf.lat.jcel.core.saturation
SR-4 : r ⊑ s, f(s) ↝ f(r)
SR4Rule(NormalizedIntegerAxiomFactory) - Constructor for class de.tudresden.inf.lat.jcel.core.saturation.SR4Rule
Constructs a new SR-4 rule.
subClassOf - Static variable in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.Renderer
 
SubPropertyNormalizer - Class in de.tudresden.inf.lat.jcel.core.saturation
This class models a normalizer that saturates an ontology with object property inclusions.
SubPropertyNormalizer(NormalizedIntegerAxiomFactory, IntegerEntityManager) - Constructor for class de.tudresden.inf.lat.jcel.core.saturation.SubPropertyNormalizer
Constructs a new normalizer of sub object properties.

T

toArray() - Method in class de.tudresden.inf.lat.jcel.core.graph.ArraySet
 
toArray(T[]) - Method in class de.tudresden.inf.lat.jcel.core.graph.ArraySet
 
toArray() - Method in class de.tudresden.inf.lat.jcel.core.graph.HashArraySet
 
toArray(T[]) - Method in class de.tudresden.inf.lat.jcel.core.graph.HashArraySet
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelExtendedOntology
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RChain
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.REntryImpl
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.RuleProfiler
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.SChain
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.SEntryImpl
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR1SRule
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR2SRule
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR3SRule
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR4RRule
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR4SRule
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR5RRule
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR6RRule
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR6RTrRule
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR7RRule
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.completion.basic.CR7SRule
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR3SExtRule
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR4RExtRule
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR4SExtRule
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR5RExtRule
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR6RExtRule
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR6SExtRule
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR7RExtRule
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR8RExtRule
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR8SExtRule
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR9RExtOptRule
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.completion.ext.CR9RExtRule
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.graph.ArraySet
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.graph.HashArraySet
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.graph.HashArraySetIterator
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerBinaryRelationImpl
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerHierarchicalGraphImpl
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerRelationMapImpl
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerBidirectionalGraphImpl
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.graph.IntegerSubsumerGraphImpl
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.graph.VNodeImpl
 
toString() - Method in class de.tudresden.inf.lat.jcel.core.graph.VNodeObjectSomeValuesFromImpl
 
TurtleRenderer - Class in de.tudresden.inf.lat.jcel.core.algorithm.rulebased
An object of this class creates a stream in a particular case of Turtle (Terse RDF Triple Language).
TurtleRenderer(Writer) - Constructor for class de.tudresden.inf.lat.jcel.core.algorithm.rulebased.TurtleRenderer
Constructs a Turtle renderer.

U

UnclassifiedOntologyException - Exception in de.tudresden.inf.lat.jcel.core.algorithm.common
This exception is thrown when accessing a data structure given by the processor before classification.
UnclassifiedOntologyException() - Constructor for exception de.tudresden.inf.lat.jcel.core.algorithm.common.UnclassifiedOntologyException
 
UnclassifiedOntologyException(String) - Constructor for exception de.tudresden.inf.lat.jcel.core.algorithm.common.UnclassifiedOntologyException
 
UnclassifiedOntologyException(String, Throwable) - Constructor for exception de.tudresden.inf.lat.jcel.core.algorithm.common.UnclassifiedOntologyException
 
UnclassifiedOntologyException(Throwable) - Constructor for exception de.tudresden.inf.lat.jcel.core.algorithm.common.UnclassifiedOntologyException
 

V

visit(FunctObjectPropAxiom) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelExtendedOntology
 
visit(GCI0Axiom) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelExtendedOntology
 
visit(GCI1Axiom) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelExtendedOntology
 
visit(GCI2Axiom) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelExtendedOntology
 
visit(GCI3Axiom) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelExtendedOntology
 
visit(NominalAxiom) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelExtendedOntology
 
visit(RangeAxiom) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelExtendedOntology
 
visit(RI1Axiom) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelExtendedOntology
 
visit(RI2Axiom) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelExtendedOntology
 
visit(RI3Axiom) - Method in class de.tudresden.inf.lat.jcel.core.algorithm.cel.CelExtendedOntology
 
VNode - Interface in de.tudresden.inf.lat.jcel.core.graph
Represents a pair containing a class and a set of expressions of the form ∃ r . A .
VNodeImpl - Class in de.tudresden.inf.lat.jcel.core.graph
This class implements a node which is a pair of a class and a set of existential expressions.
VNodeImpl(int) - Constructor for class de.tudresden.inf.lat.jcel.core.graph.VNodeImpl
Constructs a new node.
VNodeObjectSomeValuesFrom - Interface in de.tudresden.inf.lat.jcel.core.graph
Represents an existential expression, which is of the form ∃ r . A , where r is an object property and A is a class.
VNodeObjectSomeValuesFromImpl - Class in de.tudresden.inf.lat.jcel.core.graph
This class implements an existential expression.
VNodeObjectSomeValuesFromImpl(int, int) - Constructor for class de.tudresden.inf.lat.jcel.core.graph.VNodeObjectSomeValuesFromImpl
Constructs a new existential expression.

X

XEntry - Interface in de.tudresden.inf.lat.jcel.core.completion.common
This interface models an entry to be processed.
A C D E G H I L M N O P R S T U V X 

Copyright © 2009–2015 Chair of Automata Theory - TU Dresden. All rights reserved.