| Modifier and Type | Method and Description |
|---|---|
Iterator<Individual> |
IncrementalChangeTracker.newIndividuals()
Iterate over all individuals added (see
IncrementalChangeTracker.addNewIndividual(Individual)) since the previous
IncrementalChangeTracker.clear() |
Iterator<Individual> |
IncrementalChangeTracker.updatedIndividuals()
Iterate over all individuals updated (see
IncrementalChangeTracker.addUpdatedIndividual(Individual)) since the previous
IncrementalChangeTracker.clear() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
IncrementalChangeTracker.addNewIndividual(Individual i)
Record that a new individual has been added to the ABox
|
boolean |
IncrementalChangeTracker.addUpdatedIndividual(Individual i)
Record that an individual has been updated
|
| Modifier and Type | Method and Description |
|---|---|
Iterator<Individual> |
SimpleIncrementalChangeTracker.newIndividuals() |
Iterator<Individual> |
SimpleIncrementalChangeTracker.updatedIndividuals() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
SimpleIncrementalChangeTracker.addNewIndividual(Individual i) |
boolean |
SimpleIncrementalChangeTracker.addUpdatedIndividual(Individual i) |
| Modifier and Type | Method and Description |
|---|---|
Individual |
VariableBinding.get(AtomIObject key)
If the key is a variable, return the individual associated with it in
the map.
|
Individual |
AllNamedIndividualsIterator.next() |
Individual |
VariableBinding.set(AtomIObject key,
Individual value)
If the key is an instance variable, set the value.
|
Individual |
VariableBinding.set(AtomIVariable key,
aterm.ATermAppl value) |
| Modifier and Type | Method and Description |
|---|---|
Edge |
ContinuousRulesStrategy.addEdge(Individual subj,
Role pred,
Node obj,
DependencySet ds) |
protected boolean |
ContinuousRulesStrategy.mergeIndividuals(Individual y,
Individual x,
DependencySet ds) |
void |
ContinuousRulesStrategy.restoreLocal(Individual ind,
Branch branch) |
Individual |
VariableBinding.set(AtomIObject key,
Individual value)
If the key is an instance variable, set the value.
|
| Modifier and Type | Method and Description |
|---|---|
protected Individual |
AlphaTypeNode.initNode() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
AlphaTypeNode.activate(Individual ind,
aterm.ATermAppl type,
DependencySet ds) |
boolean |
AlphaDiffFromNode.activate(Individual s,
Individual o,
DependencySet ds) |
void |
AlphaNetwork.activateDifferent(Individual ind,
Individual diff,
DependencySet ds) |
void |
AlphaNetwork.activateDifferents(Individual ind) |
boolean |
AlphaNetwork.activateIndividual(Individual ind) |
void |
AlphaNetwork.activateType(Individual ind,
aterm.ATermAppl type,
DependencySet ds) |
static WME.DiffFrom |
WME.createDiffFrom(Individual subject,
Individual object,
DependencySet depends) |
static WME.TypeWME |
WME.createType(Individual arg,
aterm.ATermAppl type,
DependencySet depends) |
protected Iterator<WME> |
AlphaEdgeNode.getMatches(Individual s,
Role r,
Node o) |
| Constructor and Description |
|---|
DiffFrom(Individual subject,
Individual object,
DependencySet depends) |
SameAs(Individual subject,
Individual object,
DependencySet depends) |
TypeWME(Individual subject,
aterm.ATermAppl type,
DependencySet depends) |
| Modifier and Type | Method and Description |
|---|---|
Individual |
ABox.addFreshIndividual(Individual parent,
DependencySet ds) |
Individual |
KnowledgeBase.addIndividual(aterm.ATermAppl i) |
Individual |
ABox.addIndividual(aterm.ATermAppl x,
DependencySet ds) |
Individual |
DefaultEdge.getFrom() |
Individual |
Edge.getFrom() |
Individual |
ABox.getIndividual(aterm.ATerm x) |
Individual |
Individual.getParent() |
Individual |
Individual.getSame() |
Individual |
IndividualIterator.next() |
| Modifier and Type | Method and Description |
|---|---|
Individual |
ABox.addFreshIndividual(Individual parent,
DependencySet ds) |
EdgeList |
EdgeList.getEdgesFrom(Individual from) |
EdgeList |
EdgeList.getEdgesFrom(Individual from,
Role r) |
EdgeList |
EdgeList.getEdgesFromTo(Individual from,
Node to) |
Edge |
EdgeList.getExactEdge(Individual from,
Role role,
Node to) |
Set<Node> |
EdgeList.getFilteredNeighbors(Individual node,
aterm.ATermAppl c)
Find the neighbors of a node that has a certain type.
|
void |
ABox.getSames(Individual ind,
Set<aterm.ATermAppl> knowns,
Set<aterm.ATermAppl> unknowns) |
boolean |
EdgeList.hasEdge(Individual from,
Role role,
Node to)
Checks if this list contains an edge matching the given subject,
predicate and object.
|
boolean |
EdgeList.hasEdgeFrom(Individual from) |
boolean |
EdgeList.hasEdgeFrom(Individual from,
Role role) |
boolean |
EdgeList.hasExactEdge(Individual from,
Role role,
Node to)
Similar to
EdgeList.hasEdge(Individual, Role, Node) but does not
consider subproperty hierarchy for matching so only exact predicate
matches are considered. |
Bool |
ABox.isKnownType(Individual pNode,
aterm.ATermAppl concept,
Collection<aterm.ATermAppl> subs) |
| Constructor and Description |
|---|
DefaultEdge(Role name,
Individual from,
Node to) |
DefaultEdge(Role name,
Individual from,
Node to,
DependencySet d) |
| Modifier and Type | Method and Description |
|---|---|
protected static Set<Role> |
BlockingContext.getIncomingRoles(Individual ind)
Returns the roles that points to the given individual from its parent.
|
boolean |
Blocking.isBlocked(Individual blocked) |
boolean |
Blocking.isDirectlyBlocked(Individual blocked) |
protected boolean |
Blocking.isDirectlyBlockedInt(Individual blocked) |
boolean |
Blocking.isIndirectlyBlocked(Individual blocked) |
| Constructor and Description |
|---|
BlockingContext(Individual blocked) |
| Modifier and Type | Field and Description |
|---|---|
protected Individual |
IndividualBranch.ind |
| Constructor and Description |
|---|
GuessBranch(ABox abox,
CompletionStrategy strategy,
Individual x,
Role r,
int minGuess,
int maxGuess,
aterm.ATermAppl q,
DependencySet ds) |
IndividualBranch(ABox abox,
CompletionStrategy strategy,
Individual x,
DependencySet ds,
int n) |
MaxBranch(ABox abox,
CompletionStrategy strategy,
Individual x,
Role r,
int n,
aterm.ATermAppl qualification,
List<NodeMerge> mergePairs,
DependencySet ds) |
| Modifier and Type | Method and Description |
|---|---|
Individual |
CachedEdge.getFrom() |
| Modifier and Type | Method and Description |
|---|---|
static CachedNode |
CachedNodeFactory.createNode(aterm.ATermAppl name,
Individual node) |
protected Edge |
CacheSafetyDynamic.getParentEdge(Individual ind) |
boolean |
CacheSafetyNeverSafe.isSafe(aterm.ATermAppl c,
Individual ind)
Returns if a previously cached satisfiability result is safe to reuse for a given
concept and node in the completion graph.
|
boolean |
CacheSafetyDynamic.isSafe(aterm.ATermAppl c,
Individual ind)
Returns if a previously cached satisfiability result is safe to reuse for a given
concept and node in the completion graph.
|
boolean |
CacheSafetyAlwaysSafe.isSafe(aterm.ATermAppl c,
Individual ind)
Returns if a previously cached satisfiability result is safe to reuse for a given
concept and node in the completion graph.
|
boolean |
CacheSafety.isSafe(aterm.ATermAppl c,
Individual ind)
Returns if a previously cached satisfiability result is safe to reuse for a given
concept and node in the completion graph.
|
| Constructor and Description |
|---|
CachedConceptNode(aterm.ATermAppl name,
Individual node) |
| Modifier and Type | Method and Description |
|---|---|
Individual |
CompletionStrategy.createFreshIndividual(Individual parent,
DependencySet ds) |
| Modifier and Type | Method and Description |
|---|---|
Iterator<Individual> |
CompletionStrategy.getInitializeIterator()
Return individuals to which we need to apply the initialization rules
|
Iterator<Individual> |
SROIQIncStrategy.getInitializeIterator()
Return individuals to which we need to apply the initialization rules
|
Iterator<Individual> |
SROIQIncStrategy.getNewIterator()
Return individuals that were newly added
|
| Modifier and Type | Method and Description |
|---|---|
Edge |
CompletionStrategy.addEdge(Individual subj,
Role pred,
Node obj,
DependencySet ds) |
Individual |
CompletionStrategy.createFreshIndividual(Individual parent,
DependencySet ds) |
protected EdgeList |
SROIQIncStrategy.findAllValues(Node node,
Individual neighbor,
Set<aterm.ATermAppl> removedTypes,
Edge edge)
Method to find the edges which an all values could be applied to
|
protected boolean |
CompletionStrategy.mergeIndividuals(Individual y,
Individual x,
DependencySet ds)
Merge individual y into x.
|
protected void |
SROIQIncStrategy.readdConjunctions(Individual ind)
Readd conjunction labels
|
void |
EmptySRIQStrategy.restoreLocal(Individual ind,
Branch br) |
void |
CompletionStrategy.restoreLocal(Individual ind,
Branch br) |
protected void |
CompletionStrategy.updateQueueAddEdge(Individual subj,
Role pred,
Node obj)
This method updates the queue in the event that there is an edge added between two nodes.
|
| Modifier and Type | Method and Description |
|---|---|
Individual |
OptimizedBasicCompletionQueue.next()
Get the next element of a queue of a given type
|
Individual |
BasicCompletionQueue.next()
Get the next element of a queue of a given type
|
| Modifier and Type | Method and Description |
|---|---|
void |
DisjunctionRule.apply(Individual node) |
void |
DataSatisfiabilityRule.apply(Individual ind) |
void |
AllValuesRule.apply(Individual x) |
void |
MinRule.apply(Individual x) |
void |
UnfoldingRule.apply(Individual node) |
void |
GuessRule.apply(Individual x) |
void |
DataCardinalityRule.apply(Individual x) |
void |
TableauRule.apply(Individual ind) |
void |
MaxRule.apply(Individual x)
Apply max rule to the individual.
|
void |
ChooseRule.apply(Individual x) |
void |
NominalRule.apply(Individual y) |
void |
SomeValuesRule.apply(Individual x) |
void |
SelfRule.apply(Individual node) |
protected void |
MinRule.apply(Individual x,
aterm.ATermAppl mc) |
protected void |
ChooseRule.apply(Individual x,
aterm.ATermAppl maxCard) |
void |
AllValuesRule.applyAllValues(Individual x,
aterm.ATermAppl av,
DependencySet ds)
Apply the allValues rule for the given type with the given dependency.
|
void |
SimpleAllValuesRule.applyAllValues(Individual x,
aterm.ATermAppl av,
DependencySet ds) |
protected void |
AllValuesRule.applyAllValues(Individual subj,
Role pred,
Node obj,
aterm.ATermAppl c,
DependencySet ds) |
void |
AllValuesRule.applyAllValues(Individual subj,
Role pred,
Node obj,
DependencySet ds) |
void |
SimpleAllValuesRule.applyAllValues(Individual subj,
Role pred,
Node obj,
DependencySet ds) |
protected boolean |
AllValuesRule.applyAllValuesPropertyChain(Individual x,
aterm.ATermList chain,
aterm.ATermAppl c,
DependencySet ds) |
protected void |
DisjunctionRule.applyDisjunctionRule(Individual node,
aterm.ATermAppl disjunction)
Apply the disjunction rule to an specific label for an individual
|
void |
MaxRule.applyFunctionalMaxRule(Individual x,
Role s,
aterm.ATermAppl c,
DependencySet ds) |
protected void |
MaxRule.applyMaxRule(Individual x,
aterm.ATermAppl mc) |
protected boolean |
MaxRule.applyMaxRule(Individual x,
Role r,
aterm.ATermAppl c,
int k,
DependencySet ds)
applyMaxRule
|
protected void |
SomeValuesRule.applySomeValuesRule(Individual x,
aterm.ATermAppl sv) |
protected void |
UnfoldingRule.applyUnfoldingRule(Individual node,
aterm.ATermAppl c) |
protected boolean |
AbstractTableauRule.isBlocked(Individual node) |
Copyright © 2019. All rights reserved.