Uses of Class
org.mindswap.pellet.DependencySet

Packages that use DependencySet
org.mindswap.pellet   
 

Uses of DependencySet in org.mindswap.pellet
 

Fields in org.mindswap.pellet declared as DependencySet
static DependencySet DependencySet.DUMMY
          A dummy dependency set that is used just to indicate there is a dependency
static DependencySet DependencySet.EMPTY
          An empty dependency set
static DependencySet DependencySet.INDEPENDENT
          Used for assertions that are true by nature, i.e. an individual always has type owl:Thing
 

Methods in org.mindswap.pellet that return DependencySet
 DependencySet DependencySet.copy()
          Creates a new DependencySet object where the BitSet is shared (changing one will change the other).
 DependencySet Edge.getDepends()
           
 DependencySet Node.getDepends(aterm.ATerm c)
           
 DependencySet Node.getDifferenceDependency(Node node)
           
 DependencySet Literal.getDifferenceDependency(Node node)
           
 DependencySet Individual.getDifferenceDependency(Node node)
           
 DependencySet Node.getMergeDependency(boolean all)
          Get the dependency if this node is merged to another node.
 DependencySet Node.getPruned()
           
 DependencySet Individual.hasMax1(Role maxR)
           
 DependencySet DependencySet.union(DependencySet ds)
          Create a new DependencySet and all the elements of this and ds (Neither set is affected when the return the set is modified).
 

Methods in org.mindswap.pellet with parameters of type DependencySet
 void Literal.addAllTypes(java.util.Map types, DependencySet ds)
           
 void SHOINStrategy.addEdge(Individual subj, Role pred, Node obj, DependencySet ds)
           
 void CompletionStrategy.addEdge(Individual subj, Role pred, Node obj, DependencySet ds)
           
 Edge Individual.addEdge(Role r, Node x, DependencySet ds)
           
 void Node.addType(aterm.ATermAppl c, DependencySet ds)
           
 void Literal.addType(aterm.ATermAppl c, DependencySet d)
           
 void Individual.addType(aterm.ATermAppl c, DependencySet ds)
           
 void Node.addType(aterm.ATermAppl c, DependencySet ds, int moment)
          09/11/08 addType(c, ds,moment)
 void Individual.addType(aterm.ATermAppl c, DependencySet ds, int moment)
           
 void CompletionStrategy.addType(Node node, aterm.ATermAppl c, DependencySet ds)
           
static Clash Clash.atomic(Node node, DependencySet depends)
           
static Clash Clash.atomic(Node node, DependencySet depends, aterm.ATermAppl c)
           
 boolean Individual.checkMaxClash(aterm.ATermAppl normalizedMax, DependencySet maxDepends)
           
 boolean Individual.checkMinClash(aterm.ATermAppl minCard, DependencySet minDepends)
           
static Clash Clash.functionalCardinality(Node node, DependencySet depends)
           
static Clash Clash.functionalCardinality(Node node, DependencySet depends, aterm.ATermAppl r)
           
 void Node.inheritDifferents(Node y, DependencySet ds)
           
static Clash Clash.invalidLiteral(Node node, DependencySet depends)
           
static Clash Clash.invalidLiteral(Node node, DependencySet depends, aterm.ATermAppl value)
           
static Clash Clash.maxCardinality(Node node, DependencySet depends)
           
static Clash Clash.maxCardinality(Node node, DependencySet depends, aterm.ATermAppl r, int n)
           
 void CompletionStrategy.mergeTo(Node y, Node z, DependencySet ds)
           
static Clash Clash.missingDatatype(Node node, DependencySet depends)
           
static Clash Clash.missingDatatype(Node node, DependencySet depends, aterm.ATermAppl value, aterm.ATermAppl datatype)
           
static Clash Clash.nominal(Node node, DependencySet depends)
           
static Clash Clash.nominal(Node node, DependencySet depends, aterm.ATermAppl other)
           
abstract  void Node.prune(DependencySet ds)
           
 void Literal.prune(DependencySet ds)
           
 void Individual.prune(DependencySet ds)
          Prune the given node by removing all links going to nominal nodes and recurse through all successors.
 void Node.setDifferent(Node node, DependencySet ds)
           
 void RuleBranch.setLastClash(DependencySet ds)
           
 void Node.setSame(Node node, DependencySet ds)
           
static Clash Clash.temporalAtomic(Node node, DependencySet depends)
           
static Clash Clash.temporalAtomic(Node node, DependencySet depends, aterm.ATermAppl c)
           
static Clash Clash.unexplained(Node node, DependencySet depends)
           
 DependencySet DependencySet.union(DependencySet ds)
          Create a new DependencySet and all the elements of this and ds (Neither set is affected when the return the set is modified).
static Clash Clash.valueDatatype(Node node, DependencySet depends)
           
static Clash Clash.valueDatatype(Node node, DependencySet depends, aterm.ATermAppl value, aterm.ATermAppl datatype)
           
 

Constructors in org.mindswap.pellet with parameters of type DependencySet
CachedNode(Individual node, DependencySet depends)
           
Edge(Role name, Individual from, Node to, DependencySet d)
           
 



Copyright © 2007-2009 Natalya Keberle. All Rights Reserved.