Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV NEXT | FRAMES NO FRAMES

## Uses of Class
org.mindswap.pellet.DependencySet

Packages that use DependencySet
org.mindswap.pellet |
org.mindswap.pellet.rete |
org.mindswap.pellet.rules |

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.

Methods in org.mindswap.pellet that return DependencySet
`DependencySet` | `DependencySet.addExplain(java.util.Set<aterm.ATermAppl> explain, boolean doExplanation)`
`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` | `EdgeList.getDepends(boolean doExplanation)`
`DependencySet` | `Individual.getDifferenceDependency(Node node)`
`DependencySet` | `Literal.getDifferenceDependency(Node node)`
`DependencySet` | `Node.getDifferenceDependency(Node node)`
`DependencySet` | `Role.getExplainAntisymmetric()`
`DependencySet` | `Role.getExplainDomain()`
`DependencySet` | `Role.getExplainDomain(aterm.ATermAppl a)`
`DependencySet` | `Role.getExplainFunctional()`
`DependencySet` | `Role.getExplainInverse()`
`DependencySet` | `Role.getExplainInverseFunctional()`
`DependencySet` | `Role.getExplainIrreflexive()`
`DependencySet` | `Role.getExplainRange()`
`DependencySet` | `Role.getExplainRange(aterm.ATermAppl a)`
`DependencySet` | `Role.getExplainReflexive()`
`DependencySet` | `Role.getExplainSub(aterm.ATerm r)`
`DependencySet` | `Role.getExplainSuper(aterm.ATerm r)`
`DependencySet` | `Role.getExplainSymmetric()`
`DependencySet` | `Role.getExplainTransitive()`
`DependencySet` | `Node.getMergeDependency(boolean all)` Get the dependency if this node is merged to another node.
`DependencySet` | `Node.getPruned()`
`DependencySet` | `Individual.hasMax1(Role r)`
`DependencySet` | `DependencySet.union(DependencySet ds, boolean doExplanation)` 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` | `Role.addDomain(aterm.ATermAppl a, DependencySet ds)`
`void` | `KnowledgeBase.addDomain(aterm.ATerm p, aterm.ATermAppl c, DependencySet ds)` For internal use with tracing.
`void` | `ContinuousRulesStrategy.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)`
`boolean` | `RBox.addEquivalentRole(aterm.ATerm s, aterm.ATerm r, DependencySet ds)`
`boolean` | `RBox.addInverseRole(aterm.ATerm s, aterm.ATerm r, DependencySet ds)`
`Literal` | `ABox.addLiteral(aterm.ATermAppl dataValue, DependencySet ds)`
`void` | `Role.addRange(aterm.ATermAppl a, DependencySet ds)`
`void` | `KnowledgeBase.addRange(aterm.ATerm p, aterm.ATermAppl c, DependencySet ds)` For internal use with tracing.
`boolean` | `RBox.addSubRole(aterm.ATerm sub, aterm.ATerm sup, DependencySet ds)`
`void` | `Role.addSubRole(Role r, DependencySet ds)` Add sub role with depedency set.
`void` | `Role.addSubRoleChain(aterm.ATermList chain, DependencySet ds)` Add a sub role chain with dependency tracking.
`void` | `Role.addSuperRole(Role r, DependencySet ds)`
`void` | `KnowledgeBase.addType(aterm.ATermAppl i, aterm.ATermAppl c, DependencySet ds)`
`void` | `ABox.addType(aterm.ATermAppl x, aterm.ATermAppl c, DependencySet ds)`
`void` | `Individual.addType(aterm.ATermAppl c, DependencySet ds)`
`void` | `Literal.addType(aterm.ATermAppl c, DependencySet d)`
`void` | `Node.addType(aterm.ATermAppl c, DependencySet ds)`
`void` | `ContinuousRulesStrategy.addType(Node node, aterm.ATermAppl c, DependencySet ds)`
`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 CachedNode` | `CachedNode.createNode(Individual node, DependencySet depends)`
`static Clash` | `Clash.emptyDatatype(Node node, DependencySet depends)`
`static Clash` | `Clash.emptyDatatype(Node node, DependencySet depends, aterm.ATermAppl[] datatypes)`
`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` | `ContinuousRulesStrategy.mergeTo(Node y, Node z, DependencySet ds)`
`void` | `CompletionStrategy.mergeTo(Node y, Node z, DependencySet ds)` Merge node y into z.
`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)`
`void` | `Individual.prune(DependencySet ds)` Prune the given node by removing all links going to nominal nodes and recurse through all successors.
`void` | `Literal.prune(DependencySet ds)`
`abstract void` | `Node.prune(DependencySet ds)`
`void` | `Role.setAntisymmetric(boolean b, DependencySet ds)`
`void` | `Node.setDifferent(Node node, DependencySet ds)`
`void` | `Role.setFunctional(boolean b, DependencySet ds)`
`void` | `Role.setInverse(Role term, DependencySet ds)`
`void` | `Role.setInverseFunctional(boolean b, DependencySet ds)`
`void` | `Role.setIrreflexive(boolean b, DependencySet ds)`
`void` | `RuleBranch.setLastClash(DependencySet ds)`
`void` | `Role.setReflexive(boolean b, DependencySet ds)`
`void` | `Node.setSame(Node node, DependencySet ds)`
`void` | `Role.setTransitive(boolean b, DependencySet ds)`
`static Clash` | `Clash.unexplained(Node node, DependencySet depends)`
`static Clash` | `Clash.unexplained(Node node, DependencySet depends, java.lang.String msg)`
`DependencySet` | `DependencySet.union(DependencySet ds, boolean doExplanation)` 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
`ChooseBranch(ABox abox, CompletionStrategy completion, Node x, aterm.ATermAppl c, DependencySet ds)`
`Edge(Role name, Individual from, Node to, DependencySet d)`
`Literal(aterm.ATermAppl name, aterm.ATermAppl term, ABox abox, DependencySet ds)`

Uses of DependencySet in org.mindswap.pellet.rete

Methods in org.mindswap.pellet.rete that return DependencySet
`DependencySet` | `Tuple.getDependencySet()`

Constructors in org.mindswap.pellet.rete with parameters of type DependencySet
`Fact(DependencySet ds, Constant... constants)`
`Fact(DependencySet ds, java.util.List<Constant> constants)`
`TermTuple(DependencySet ds, java.util.List<Term> terms)`
`TermTuple(DependencySet ds, Term... terms)`
`Tuple(DependencySet ds, java.util.List<T> elements)`
`Tuple(DependencySet ds, T... elementArgs)`

Uses of DependencySet in org.mindswap.pellet.rules

Methods in org.mindswap.pellet.rules that return types with arguments of type DependencySet
`Pair<Term,DependencySet>` | `RulesToReteTranslator.translateAtomObject(AtomObject obj)` Return a pair of a term, and a dependency set.

Methods in org.mindswap.pellet.rules with parameters of type DependencySet
`TermTuple` | `RulesToReteTranslator.translateAtom(RuleAtom atom, DependencySet ds)` Translates a rule atom into a rete triple.
`java.util.List<TermTuple>` | `RulesToReteTranslator.translateAtoms(java.util.Collection<RuleAtom> atoms, DependencySet ds)` Translates a list of rule atoms into rete triples.

Overview | Package | Class | Use | Tree | Deprecated | Index | Help
PREV NEXT | FRAMES NO FRAMES

Copyright © 2004 Evren Sirin. All Rights Reserved.