|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectorg.mindswap.pellet.Node
org.mindswap.pellet.Individual
public class Individual
Field Summary | |
---|---|
int[] |
applyNext
|
Fields inherited from class org.mindswap.pellet.Node |
---|
ALL, ATOM, BLOCKABLE, CHANGED, log, MAX, MIN, NOM, NOMINAL, OR, SOME, TYPES, UNCHANGED |
Method Summary | |
---|---|
Edge |
addEdge(Role r,
Node x,
DependencySet ds)
|
void |
addType(aterm.ATermAppl c,
DependencySet ds)
|
boolean |
canApply(int type)
|
boolean |
checkMaxClash(aterm.ATermAppl normalizedMax,
DependencySet maxDepends)
|
boolean |
checkMinClash(aterm.ATermAppl minCard,
DependencySet minDepends)
|
Node |
copyTo(ABox abox)
|
java.lang.String |
debugString()
|
short |
getDepth()
|
DependencySet |
getDifferenceDependency(Node node)
|
java.util.Set<Node> |
getDifferents()
|
EdgeList |
getEdgesTo(Node x)
|
EdgeList |
getEdgesTo(Node x,
Role r)
|
int |
getMaxCard(Role r)
|
int |
getMinCard(Role r,
aterm.ATermAppl c)
|
DependencySet |
getNodeDepends()
|
int |
getNominalLevel()
|
void |
getObviousTypes(java.util.List<aterm.ATermAppl> types,
java.util.List<aterm.ATermAppl> nonTypes)
Collects atomic concepts such that either that concept or its negation exist in the types list without depending on any non-deterministic branch. |
EdgeList |
getOutEdges()
Returns the outgoing edges of this node. |
Individual |
getParent()
|
EdgeList |
getRNeighborEdges(Role r)
|
EdgeList |
getRNeighborEdges(Role r,
Node node)
Get neighbor edges to a specific node |
java.util.Set<Node> |
getRNeighbors(Role r)
|
EdgeList |
getRPredecessorEdges(Role r)
|
EdgeList |
getRSuccessorEdges(Role r)
|
java.util.Set<Node> |
getRSuccessors(Role r,
aterm.ATermAppl c)
|
Individual |
getSame()
|
aterm.ATermAppl |
getTerm()
|
java.util.List<aterm.ATermAppl> |
getTypes(int type)
|
Bool |
hasDataPropertyValue(Role r,
java.lang.Object value)
Check the property assertions to see if it is possible for this individual to have the value for the given datatype property. |
DependencySet |
hasDistinctRNeighborsForMax(Role r,
int n,
aterm.ATermAppl c)
Checks if this individual has at least n distinct r-neighbors that has a specific type. |
boolean |
hasDistinctRNeighborsForMin(Role r,
int n,
aterm.ATermAppl c)
|
boolean |
hasDistinctRNeighborsForMin(Role r,
int n,
aterm.ATermAppl c,
boolean onlyNominals)
Returns true if this individual has at least n distinct r-neighbors. |
DependencySet |
hasMax1(Role r)
|
boolean |
hasRNeighbor(Role r)
Checks if this node is connected to another node with the given role (or one of its subproperties). |
boolean |
hasRNeighbor(Role r,
Node x)
|
boolean |
hasRSuccessor(Role r)
|
boolean |
hasRSuccessor(Role r,
Node x)
|
boolean |
hasSuccessor(Node x)
|
boolean |
isBlockable()
|
boolean |
isBlocked()
|
boolean |
isBottom()
Returns if this is the cached node for TOP concept. |
boolean |
isComplete()
Returns if this cached node is complete. |
boolean |
isDifferent(Node node)
|
boolean |
isIndependent()
Returns if this node was cached without any dependency to a non-deterministic branch. |
boolean |
isIndividual()
|
boolean |
isLeaf()
|
boolean |
isLiteral()
|
boolean |
isNominal()
|
boolean |
isRedundantMax(aterm.ATermAppl maxCard)
|
boolean |
isRedundantMin(aterm.ATermAppl minCard)
|
boolean |
isTop()
Returns if this is the cached node for BOTTOM concept. |
void |
prune(DependencySet ds)
Prune the given node by removing all links going to nominal nodes and recurse through all successors. |
boolean |
removeEdge(Edge edge)
|
boolean |
removeType(aterm.ATermAppl c)
|
void |
reset(boolean onlyApplyTypes)
Resets this node (types, edges, sames, differents) to contain only asserted information. |
boolean |
restore(int branch)
|
void |
setBlocked(boolean isBlocked)
|
void |
setNominalLevel(int level)
|
void |
unprune(int branch)
|
Methods inherited from class org.mindswap.pellet.Node |
---|
getABox, getAllMerged, getDepends, getDepends, getInEdges, getMerged, getMergeDependency, getMergedTo, getName, getNameStr, getPath, getPruned, getTypes, hasObviousType, hasObviousType, hasType, inheritDifferents, isBnode, isConceptRoot, isMerged, isNamedIndividual, isPruned, isRoot, isRootNominal, isSame, mergedAt, prunedAt, removeInEdge, removeInEdges, removeTypes, restorePruned, setChanged, setConceptRoot, setDifferent, setSame, toString, undoSetSame |
Methods inherited from class java.lang.Object |
---|
equals, getClass, hashCode, notify, notifyAll, wait, wait, wait |
Methods inherited from interface org.mindswap.pellet.tableau.cache.CachedNode |
---|
getDepends, getInEdges, getName, isNamedIndividual |
Field Detail |
---|
public int[] applyNext
Method Detail |
---|
public boolean isBlocked()
public void setBlocked(boolean isBlocked)
public short getDepth()
public DependencySet getNodeDepends()
getNodeDepends
in class Node
public boolean isLiteral()
isLiteral
in class Node
public boolean isIndividual()
isIndividual
in class Node
public boolean isNominal()
isNominal
in class Node
public boolean isBlockable()
isBlockable
in class Node
public boolean isIndependent()
CachedNode
isIndependent
in interface CachedNode
public void setNominalLevel(int level)
public int getNominalLevel()
getNominalLevel
in class Node
public aterm.ATermAppl getTerm()
getTerm
in class Node
public Node copyTo(ABox abox)
copyTo
in class Node
public java.util.List<aterm.ATermAppl> getTypes(int type)
public boolean isDifferent(Node node)
isDifferent
in class Node
public java.util.Set<Node> getDifferents()
getDifferents
in class Node
public DependencySet getDifferenceDependency(Node node)
getDifferenceDependency
in class Node
public void getObviousTypes(java.util.List<aterm.ATermAppl> types, java.util.List<aterm.ATermAppl> nonTypes)
types
- All atomic concepts found in typesnonTypes
- All atomic conceptspublic boolean canApply(int type)
public void addType(aterm.ATermAppl c, DependencySet ds)
addType
in class Node
public boolean checkMinClash(aterm.ATermAppl minCard, DependencySet minDepends)
public boolean checkMaxClash(aterm.ATermAppl normalizedMax, DependencySet maxDepends)
public boolean isRedundantMin(aterm.ATermAppl minCard)
public boolean isRedundantMax(aterm.ATermAppl maxCard)
public DependencySet hasMax1(Role r)
public int getMaxCard(Role r)
public int getMinCard(Role r, aterm.ATermAppl c)
public boolean removeType(aterm.ATermAppl c)
removeType
in class Node
public final boolean isLeaf()
isLeaf
in class Node
public final Individual getSame()
getSame
in class Node
public final java.util.Set<Node> getRSuccessors(Role r, aterm.ATermAppl c)
public final EdgeList getRSuccessorEdges(Role r)
public final EdgeList getRPredecessorEdges(Role r)
public final java.util.Set<Node> getRNeighbors(Role r)
public EdgeList getRNeighborEdges(Role r)
public EdgeList getRNeighborEdges(Role r, Node node)
r
- node
-
public EdgeList getEdgesTo(Node x)
public EdgeList getEdgesTo(Node x, Role r)
public DependencySet hasDistinctRNeighborsForMax(Role r, int n, aterm.ATermAppl c)
r
- Role we use to find neighborsn
- Number of neighborsc
- The type that all neighbors should belong to
public boolean hasDistinctRNeighborsForMin(Role r, int n, aterm.ATermAppl c)
public boolean hasDistinctRNeighborsForMin(Role r, int n, aterm.ATermAppl c, boolean onlyNominals)
r
- n
- onlyNominals
-
public final boolean hasRNeighbor(Role r)
CachedNode
hasRNeighbor
in interface CachedNode
public boolean hasRSuccessor(Role r)
public boolean hasSuccessor(Node x)
hasSuccessor
in class Node
public final boolean hasRSuccessor(Role r, Node x)
public Bool hasDataPropertyValue(Role r, java.lang.Object value)
r
- value
-
public boolean hasRNeighbor(Role r, Node x)
public Edge addEdge(Role r, Node x, DependencySet ds)
public final EdgeList getOutEdges()
CachedNode
getOutEdges
in interface CachedNode
public Individual getParent()
public void reset(boolean onlyApplyTypes)
reset
in class Node
public boolean restore(int branch)
restore
in class Node
public final boolean removeEdge(Edge edge)
public void prune(DependencySet ds)
prune
in class Node
succ
- ds
- public void unprune(int branch)
unprune
in class Node
public java.lang.String debugString()
public boolean isBottom()
isBottom
in interface CachedNode
true
if this is the cached node for TOP conceptpublic boolean isComplete()
isComplete
in interface CachedNode
true
if this cached node is completepublic boolean isTop()
isTop
in interface CachedNode
true
if this is the cached node for BOTTOM concept
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |