| Modifier and Type | Method and Description |
|---|---|
DependencySet |
TrivialSatisfactionHelpers.isAtomTrue(RuleAtom atom,
VariableBinding binding) |
| Modifier and Type | Method and Description |
|---|---|
Edge |
ContinuousRulesStrategy.addEdge(Individual subj,
Role pred,
Node obj,
DependencySet ds) |
void |
ContinuousRulesStrategy.addType(Node node,
aterm.ATermAppl c,
DependencySet ds) |
boolean |
RuleAtomAsserter.assertAtom(RuleAtom atom,
VariableBinding binding,
DependencySet ds,
boolean negated,
ABox abox,
CompletionStrategy strategy) |
protected boolean |
ContinuousRulesStrategy.mergeIndividuals(Individual y,
Individual x,
DependencySet ds) |
void |
ContinuousRulesStrategy.mergeTo(Node y,
Node z,
DependencySet ds) |
boolean |
ContinuousRulesStrategy.setDifferent(Node y,
Node z,
DependencySet ds) |
| Constructor and Description |
|---|
PartialBinding(Rule rule,
VariableBinding binding,
DependencySet ds) |
| Modifier and Type | Field and Description |
|---|---|
protected DependencySet |
ProductionNode.ds |
| Modifier and Type | Method and Description |
|---|---|
DependencySet |
Tuple.getDependencySet() |
abstract DependencySet |
WME.getDepends() |
DependencySet |
WME.EdgeWME.getDepends() |
DependencySet |
WME.BuiltinWME.getDepends() |
abstract DependencySet |
Token.getDepends(boolean doExplanation) |
| 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.activateType(Individual ind,
aterm.ATermAppl type,
DependencySet ds) |
static WME |
WME.createBuiltin(Literal[] literals,
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) |
| Constructor and Description |
|---|
BuiltinWME(Literal[] literals,
DependencySet depends) |
DiffFrom(Individual subject,
Individual object,
DependencySet depends) |
Fact(DependencySet ds,
aterm.ATermAppl... constants) |
Fact(DependencySet ds,
List<aterm.ATermAppl> constants) |
SameAs(Individual subject,
Individual object,
DependencySet depends) |
Tuple(DependencySet ds,
List<T> elements) |
Tuple(DependencySet ds,
T... elementArgs) |
TypeWME(Individual subject,
aterm.ATermAppl type,
DependencySet depends) |
| Modifier and Type | Field and Description |
|---|---|
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.
|
protected DependencySet |
Node.mergeDepends
Dependency information about why merged happened (if at all)
|
protected DependencySet |
Node.pruned |
| Modifier and Type | Field and Description |
|---|---|
protected Map<aterm.ATermAppl,DependencySet> |
Node.depends |
protected Map<Node,DependencySet> |
Node.differents |
| Modifier and Type | Method and Description |
|---|---|
DependencySet |
DependencySet.cache()
Return a dummy representation of this DependencySet such that
this.isIndependent() == this.copyForCache().isIndependent()
The returned copy will not be accurate w.r.t. |
DependencySet |
DependencySet.copy(int newBranch)
Creates a new DependencySet object with a new branch number where the IntSet
is shared (changing one will change the other).
|
DependencySet |
Clash.getDepends() |
DependencySet |
DefaultEdge.getDepends() |
DependencySet |
Edge.getDepends() |
DependencySet |
NodeMerge.getDepends() |
DependencySet |
Node.getDepends(aterm.ATerm c) |
DependencySet |
EdgeList.getDepends(boolean doExplanation) |
DependencySet |
Node.getDifferenceDependency(Node node) |
DependencySet |
Literal.getDifferenceDependency(Node node) |
DependencySet |
Individual.getDifferenceDependency(Node node) |
DependencySet |
Role.getExplainAsymmetric() |
DependencySet |
Role.getExplainDisjointRole(Role role) |
DependencySet |
Role.getExplainDomain(aterm.ATermAppl a) |
DependencySet |
Role.getExplainFunctional() |
DependencySet |
Role.getExplainInverseFunctional() |
DependencySet |
Role.getExplainIrreflexive() |
DependencySet |
Role.getExplainRange(aterm.ATermAppl a) |
DependencySet |
Role.getExplainReflexive() |
DependencySet |
Role.getExplainSub(aterm.ATerm r) |
DependencySet |
Role.getExplainSubOrInv(Role 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.
|
abstract DependencySet |
Node.getNodeDepends() |
DependencySet |
Literal.getNodeDepends() |
DependencySet |
Individual.getNodeDepends() |
DependencySet |
Node.getPruned() |
DependencySet |
Individual.hasDistinctRNeighborsForMax(Role r,
int n,
aterm.ATermAppl c)
Checks if this individual has at least n distinct r-neighbors that has
a specific type.
|
DependencySet |
Individual.hasMax1(Role r) |
DependencySet |
DependencySet.union(DependencySet ds,
boolean doExplanation)
Create a new DependencySet and all the elements of
this
and ds. |
DependencySet |
DependencySet.union(IntSet set)
Create a new DependencySet and all the elements of
this
and set . |
DependencySet |
DependencySet.union(Set<aterm.ATermAppl> explain,
boolean doExplanation) |
| Modifier and Type | Method and Description |
|---|---|
Map<Node,DependencySet> |
Node.getAllMerged() |
Map<aterm.ATermAppl,DependencySet> |
Node.getDepends() |
| Modifier and Type | Method and Description |
|---|---|
void |
Literal.addAllTypes(Map<aterm.ATermAppl,DependencySet> types,
DependencySet ds) |
void |
KnowledgeBase.addDisjointProperty(aterm.ATermAppl p1,
aterm.ATermAppl p2,
DependencySet ds) |
boolean |
RBox.addDisjointRole(aterm.ATerm s,
aterm.ATerm r,
DependencySet ds) |
void |
Role.addDisjointRole(Role r,
DependencySet ds) |
boolean |
Role.addDomain(aterm.ATermAppl a,
DependencySet ds) |
Edge |
ABox.addEdge(aterm.ATermAppl p,
aterm.ATermAppl s,
aterm.ATermAppl o,
DependencySet ds) |
Edge |
Individual.addEdge(Role r,
Node x,
DependencySet ds) |
boolean |
RBox.addEquivalentRole(aterm.ATerm s,
aterm.ATerm r,
DependencySet ds) |
Individual |
ABox.addFreshIndividual(Individual parent,
DependencySet ds) |
Individual |
ABox.addIndividual(aterm.ATermAppl x,
DependencySet ds) |
boolean |
RBox.addInverseRole(aterm.ATerm s,
aterm.ATerm r,
DependencySet ds) |
Literal |
ABox.addLiteral(aterm.ATermAppl dataValue,
DependencySet ds) |
Literal |
ABox.addLiteral(DependencySet ds)
Add a new literal to the ABox.
|
boolean |
Role.addRange(aterm.ATermAppl a,
DependencySet ds) |
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 |
ABox.addType(aterm.ATermAppl x,
aterm.ATermAppl c,
DependencySet ds) |
void |
KnowledgeBase.addType(aterm.ATermAppl i,
aterm.ATermAppl c,
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) |
static Clash |
Clash.atomic(Node node,
DependencySet depends) |
static Clash |
Clash.atomic(Node node,
DependencySet depends,
aterm.ATermAppl c) |
static Clash |
Clash.bottomProperty(Node node,
DependencySet depends,
aterm.ATermAppl p) |
boolean |
Individual.checkMaxClash(aterm.ATermAppl normalizedMax,
DependencySet maxDepends) |
boolean |
Individual.checkMinClash(aterm.ATermAppl minCard,
DependencySet minDepends) |
static Clash |
Clash.disjointProps(Node node,
DependencySet depends) |
static Clash |
Clash.disjointProps(Node node,
DependencySet depends,
aterm.ATermAppl p1,
aterm.ATermAppl p2) |
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) |
static Clash |
Clash.minMax(Node node,
DependencySet depends) |
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.
|
boolean |
Role.removeDomain(aterm.ATermAppl a,
DependencySet ds) |
boolean |
Role.removeRange(aterm.ATermAppl a,
DependencySet ds) |
void |
Role.setAntisymmetric(boolean b,
DependencySet ds)
Deprecated.
|
void |
Role.setAsymmetric(boolean b,
DependencySet ds) |
void |
Clash.setDepends(DependencySet depends) |
void |
DefaultEdge.setDepends(DependencySet ds) |
void |
Edge.setDepends(DependencySet ds) |
boolean |
Node.setDifferent(Node node,
DependencySet ds) |
void |
ABox.setExplanation(DependencySet ds) |
void |
Role.setFunctional(boolean b,
DependencySet ds) |
void |
Role.setInverseFunctional(boolean b,
DependencySet ds) |
void |
Role.setIrreflexive(boolean b,
DependencySet ds) |
void |
Role.setReflexive(boolean b,
DependencySet ds) |
boolean |
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,
String msg) |
DependencySet |
DependencySet.union(DependencySet ds,
boolean doExplanation)
Create a new DependencySet and all the elements of
this
and ds. |
static Clash |
Clash.valueDatatype(Node node,
DependencySet depends) |
static Clash |
Clash.valueDatatype(Node node,
DependencySet depends,
aterm.ATermAppl value,
aterm.ATermAppl datatype) |
| Modifier and Type | Method and Description |
|---|---|
void |
Literal.addAllTypes(Map<aterm.ATermAppl,DependencySet> types,
DependencySet ds) |
void |
Role.setSubRolesAndChains(Set<Role> subRoles,
Set<aterm.ATermList> subRoleChains,
Map<aterm.ATerm,DependencySet> dependencies) |
| Constructor and Description |
|---|
DefaultEdge(Role name,
Individual from,
Node to,
DependencySet d) |
Literal(aterm.ATermAppl name,
aterm.ATermAppl term,
ABox abox,
DependencySet ds) |
NodeMerge(Node y,
Node z,
DependencySet ds) |
| Modifier and Type | Field and Description |
|---|---|
protected DependencySet[] |
DisjunctionBranch.prevDS |
| Modifier and Type | Method and Description |
|---|---|
DependencySet |
Branch.getCombinedClash() |
DependencySet |
Branch.getTermDepends() |
| Modifier and Type | Method and Description |
|---|---|
void |
MaxBranch.setLastClash(DependencySet ds) |
void |
RuleBranch.setLastClash(DependencySet ds) |
void |
DisjunctionBranch.setLastClash(DependencySet ds) |
void |
Branch.setLastClash(DependencySet ds) |
void |
Branch.setTermDepends(DependencySet termDepends) |
| Constructor and Description |
|---|
ChooseBranch(ABox abox,
CompletionStrategy completion,
Node node,
aterm.ATermAppl c,
DependencySet ds) |
DisjunctionBranch(ABox abox,
CompletionStrategy completion,
Node node,
aterm.ATermAppl disjunction,
DependencySet ds,
aterm.ATermAppl[] disj) |
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) |
RuleBranch(ABox abox,
CompletionStrategy completion,
RuleAtomAsserter ruleAtomAsserter,
List<RuleAtom> atoms,
VariableBinding binding,
int bodyAtomCount,
DependencySet ds) |
| Modifier and Type | Method and Description |
|---|---|
DependencySet |
CachedEdge.getDepends() |
| Modifier and Type | Method and Description |
|---|---|
Map<aterm.ATermAppl,DependencySet> |
CachedNode.getDepends()
Returns the types and their dependencies for this node.
|
Map<aterm.ATermAppl,DependencySet> |
CachedConstantNode.getDepends()
Returns the types and their dependencies for this node.
|
Map<aterm.ATermAppl,DependencySet> |
CachedConceptNode.getDepends()
Returns the types and their dependencies for this node.
|
| Modifier and Type | Method and Description |
|---|---|
void |
CachedEdge.setDepends(DependencySet ds) |
| Constructor and Description |
|---|
CachedEdge(Role role,
aterm.ATermAppl neighbor,
DependencySet ds) |
CachedInEdge(Role role,
aterm.ATermAppl from,
DependencySet ds) |
CachedOutEdge(Role role,
aterm.ATermAppl to,
DependencySet ds) |
| Modifier and Type | Method and Description |
|---|---|
Edge |
CompletionStrategy.addEdge(Individual subj,
Role pred,
Node obj,
DependencySet ds) |
void |
CompletionStrategy.addType(Node node,
aterm.ATermAppl c,
DependencySet ds) |
protected void |
CompletionStrategy.applyFunctionalMaxRule(Literal x,
Role r,
DependencySet ds) |
Individual |
CompletionStrategy.createFreshIndividual(Individual parent,
DependencySet ds) |
protected boolean |
CompletionStrategy.mergeIndividuals(Individual y,
Individual x,
DependencySet ds)
Merge individual y into x.
|
protected void |
CompletionStrategy.mergeLiterals(Literal y,
Literal x,
DependencySet ds)
Merge literal y into x.
|
void |
CompletionStrategy.mergeTo(Node y,
Node z,
DependencySet ds)
Merge node y into z.
|
boolean |
CompletionStrategy.setDifferent(Node y,
Node z,
DependencySet ds) |
| Modifier and Type | Method and Description |
|---|---|
void |
DependencyIndex.addCloseBranchDependency(Branch branch,
DependencySet ds)
Add a new branch ds removal dependency
|
void |
DependencyIndex.addEdgeDependency(Edge edge,
DependencySet ds)
Add a new edge dependency
|
void |
DependencyIndex.addMergeDependency(aterm.ATermAppl ind,
aterm.ATermAppl mergedTo,
DependencySet ds)
Add a new merge dependency
|
void |
DependencyIndex.addTypeDependency(aterm.ATermAppl ind,
aterm.ATermAppl type,
DependencySet ds)
Add a new type dependency
|
| Modifier and Type | Method and Description |
|---|---|
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) |
void |
MaxRule.applyFunctionalMaxRule(Individual x,
Role s,
aterm.ATermAppl c,
DependencySet ds) |
protected boolean |
MaxRule.applyMaxRule(Individual x,
Role r,
aterm.ATermAppl c,
int k,
DependencySet ds)
applyMaxRule
|
Copyright © 2019. All rights reserved.