|
||||||||||
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 |
---|
Fields inherited from class org.mindswap.pellet.Node |
---|
ALL, ALLFUT, ALLPAST, AT, ATOM, BLOCKABLE, CHANGED, DEBUG, FUT, MAX, MIN, NOM, NOMINAL, OR, PAST, SOME, SOMEFUT, SOMEPAST, TYPES, UNCHANGED |
Method Summary | |
---|---|
Edge |
addEdge(Role r,
Node x,
DependencySet ds)
|
void |
addType(aterm.ATermAppl c,
DependencySet ds)
|
void |
addType(aterm.ATermAppl c,
DependencySet ds,
int moment)
09/11/08 addType(c, ds,moment) |
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()
|
java.util.List |
getAncestors()
Returns (only blockable) ancestors. |
DependencySet |
getDifferenceDependency(Node node)
|
java.util.Set |
getDifferents()
|
EdgeList |
getEdgesTo(Node x)
|
EdgeList |
getEdgesTo(Node x,
Role r)
|
int |
getMaxCard(Role r)
|
java.util.Set |
getMerged()
|
int |
getMinCard(Role r)
|
int |
getNominalLevel()
|
void |
getObviousTypes(java.util.List types,
java.util.List 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()
|
EdgeList |
getRNeighborEdges(Role r)
|
java.util.Set |
getRNeighborNames(Role r)
|
java.util.Set |
getRNeighbors(Role r)
|
EdgeList |
getRPredecessorEdges(Role r)
|
EdgeList |
getRSuccessorEdges(Role r)
|
java.util.Set |
getRSuccessors(Role r)
|
java.util.Set |
getSortedSuccessors()
|
java.util.Set |
getSuccessors()
|
aterm.ATermAppl |
getTerm()
|
java.util.List |
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. |
boolean |
hasEdge(Role r,
Node x)
|
DependencySet |
hasMax1(Role maxR)
|
Bool |
hasObjectPropertyValue(Role r,
Individual value)
Check the property assertions to see if it is possible for this individual to have the value for the given object property. |
boolean |
hasRNeighbor(Role r)
|
boolean |
hasRSuccessor(Role r)
|
boolean |
hasSuccessor(Node x)
|
boolean |
isBlockable()
|
boolean |
isDifferent(Node node)
|
boolean |
isIndividual()
|
boolean |
isLeaf()
|
boolean |
isLiteral()
|
boolean |
isMarked()
|
boolean |
isNominal()
|
boolean |
isRedundantMax(aterm.ATermAppl maxCard)
|
boolean |
isRedundantMin(aterm.ATermAppl minCard)
|
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)
|
void |
removeType(aterm.ATermAppl c)
|
boolean |
restore(int branch)
|
void |
setNominalLevel(int level)
|
void |
unprune(int branch)
|
Methods inherited from class org.mindswap.pellet.Node |
---|
copy, equals, getABox, getDepends, getDepends, getInEdges, getMergeDependency, getMergedTo, getName, getNameStr, getOntology, getParent, getPath, getPredecessors, getPruned, getSame, getTypes, hasObviousType, hasObviousType, hasType, inheritDifferents, isBnode, isChanged, isChanged, isConceptRoot, isMerged, isNamedIndividual, isPruned, isRoot, isRootNominal, isSame, mergedAt, prunedAt, removeInEdge, removeInEdges, removeTypes, setChanged, setChanged, setConceptRoot, setDifferent, setOntology, setSame, toString, undoSetSame |
Methods inherited from class java.lang.Object |
---|
getClass, hashCode, notify, notifyAll, wait, wait, wait |
Method Detail |
---|
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 isMarked()
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.Set getMerged()
public java.util.List getTypes(int type)
public boolean isDifferent(Node node)
isDifferent
in class Node
public java.util.Set getDifferents()
getDifferents
in class Node
public DependencySet getDifferenceDependency(Node node)
getDifferenceDependency
in class Node
public void getObviousTypes(java.util.List types, java.util.List 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 void addType(aterm.ATermAppl c, DependencySet ds, int moment)
Node
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 maxR)
public int getMaxCard(Role r)
public int getMinCard(Role r)
public void removeType(aterm.ATermAppl c)
removeType
in class Node
public final boolean isLeaf()
isLeaf
in class Node
public final java.util.Set getSuccessors()
public final java.util.Set getSortedSuccessors()
public final java.util.Set getRSuccessors(Role r)
public final EdgeList getRSuccessorEdges(Role r)
public final EdgeList getRPredecessorEdges(Role r)
public final java.util.Set getRNeighborNames(Role r)
public final java.util.Set getRNeighbors(Role r)
public EdgeList getRNeighborEdges(Role r)
public EdgeList getEdgesTo(Node x)
public EdgeList getEdgesTo(Node x, Role r)
public final boolean hasRNeighbor(Role r)
public boolean hasRSuccessor(Role r)
public boolean hasEdge(Role r, Node x)
public boolean hasSuccessor(Node x)
hasSuccessor
in class Node
public Bool hasDataPropertyValue(Role r, java.lang.Object value)
r
- value
-
public Bool hasObjectPropertyValue(Role r, Individual value)
r
- value
-
public Edge addEdge(Role r, Node x, DependencySet ds)
public final EdgeList getOutEdges()
public java.util.List getAncestors()
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()
|
||||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |