| Modifier and Type | Method and Description |
|---|---|
Iterator<Map.Entry<Node,Set<aterm.ATermAppl>>> |
IncrementalChangeTracker.deletedTypes()
Iterate over all nodes with deleted types (and those types) (see
IncrementalChangeTracker.addDeletedType(Node, ATermAppl)) since the previous
IncrementalChangeTracker.clear() |
Iterator<Node> |
IncrementalChangeTracker.unprunedNodes()
Iterate over all nodes unpruned (see
#addUnprunedIndividual(Individual)) since the previous
IncrementalChangeTracker.clear() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
IncrementalChangeTracker.addDeletedType(Node n,
aterm.ATermAppl type)
Record that a type was deleted from an individual
|
boolean |
IncrementalChangeTracker.addUnprunedNode(Node n)
Record that a node has been "unpruned" because a merge was reverted
during restore
|
| Modifier and Type | Method and Description |
|---|---|
Iterator<Map.Entry<Node,Set<aterm.ATermAppl>>> |
SimpleIncrementalChangeTracker.deletedTypes() |
Iterator<Node> |
SimpleIncrementalChangeTracker.unprunedNodes() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
SimpleIncrementalChangeTracker.addDeletedType(Node n,
aterm.ATermAppl type) |
boolean |
SimpleIncrementalChangeTracker.addUnprunedNode(Node n) |
| Modifier and Type | Method and Description |
|---|---|
Set<Map.Entry<? extends AtomVariable,? extends Node>> |
VariableBinding.entrySet() |
| 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) |
void |
ContinuousRulesStrategy.mergeTo(Node y,
Node z,
DependencySet ds) |
boolean |
ContinuousRulesStrategy.setDifferent(Node y,
Node z,
DependencySet ds) |
| Constructor and Description |
|---|
LiteralFilter(Iterator<Node> iterator) |
| Modifier and Type | Method and Description |
|---|---|
protected <N extends Node> |
AlphaFixedEdgeNode.initNode() |
| Modifier and Type | Method and Description |
|---|---|
abstract Node |
WME.getArg(int index) |
Node |
WME.TypeWME.getArg(int index) |
Node |
WME.EdgeWME.getArg(int index) |
Node |
WME.BuiltinWME.getArg(int index) |
protected Node |
ProductionNode.getNode(NodeProvider provider,
Token token) |
abstract Node |
NodeProvider.getNode(WME wme,
Token token) |
Node |
NodeProvider.ConstantNodeProvider.getNode(WME wme,
Token token) |
Node |
NodeProvider.TokenNodeProvider.getNode(WME wme,
Token token) |
Node |
NodeProvider.WMENodeProvider.getNode(WME wme,
Token token) |
protected Node |
AlphaNode.initNode(aterm.ATermAppl name) |
protected Node |
AlphaNoVarEdgeNode.initObjectNode() |
| Modifier and Type | Method and Description |
|---|---|
protected Iterator<WME> |
AlphaEdgeNode.getMatches(Individual s,
Role r,
Node o) |
Iterator<WME> |
AlphaNoVarEdgeNode.getMatches(int argIndex,
Node arg) |
Iterator<WME> |
AlphaEdgeNode.getMatches(int argIndex,
Node arg) |
Iterator<WME> |
AlphaDiffFromNode.getMatches(int argIndex,
Node arg) |
Iterator<WME> |
AlphaTypeNode.getMatches(int argIndex,
Node arg) |
Iterator<WME> |
AlphaReflexiveEdgeNode.getMatches(int argIndex,
Node arg) |
Iterator<WME> |
AlphaFixedObjectEdgeNode.getMatches(int argIndex,
Node arg) |
Iterator<WME> |
AlphaFixedSubjectEdgeNode.getMatches(int argIndex,
Node arg) |
abstract Iterator<WME> |
AlphaNode.getMatches(int argIndex,
Node arg) |
| Constructor and Description |
|---|
ConstantNodeProvider(Node node) |
| Modifier and Type | Class and Description |
|---|---|
class |
Individual |
class |
Literal |
| Modifier and Type | Field and Description |
|---|---|
protected Node |
Node.mergedTo
If this node is merged to another one, points to that node otherwise
points to itself.
|
| Modifier and Type | Field and Description |
|---|---|
protected Map<Node,DependencySet> |
Node.differents |
protected Set<Node> |
Node.merged
Set of other nodes that have been merged to this node.
|
protected Map<aterm.ATermAppl,Node> |
ABox.nodes
This is a list of nodes.
|
| Modifier and Type | Method and Description |
|---|---|
abstract Node |
Node.copyTo(ABox abox) |
Node |
Literal.copyTo(ABox abox) |
Node |
Individual.copyTo(ABox abox) |
Node |
Node.getMergedTo() |
Node |
DefaultEdge.getNeighbor(Node node)
Given a node upon which this edge is incident, the opposite incident node is returned.
|
Node |
Edge.getNeighbor(Node node)
Given a node upon which this edge is incident, the opposite incident node is returned.
|
Node |
Clash.getNode() |
Node |
ABox.getNode(aterm.ATerm x) |
Node |
Node.getSame() |
Node |
DefaultEdge.getTo() |
Node |
Edge.getTo() |
| Modifier and Type | Method and Description |
|---|---|
Map<Node,DependencySet> |
Node.getAllMerged() |
Set<Node> |
Node.getDifferents() |
Set<Node> |
Individual.getDifferents() |
Set<Node> |
EdgeList.getFilteredNeighbors(Individual node,
aterm.ATermAppl c)
Find the neighbors of a node that has a certain type.
|
Set<Node> |
Node.getMerged() |
Set<Node> |
EdgeList.getNeighbors(Node node) |
Collection<Node> |
ABox.getNodes() |
Set<Node> |
Individual.getRNeighbors(Role r) |
Set<Node> |
Individual.getRSuccessors(Role r,
aterm.ATermAppl c) |
| Modifier and Type | Method and Description |
|---|---|
Edge |
Individual.addEdge(Role r,
Node x,
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) |
String |
Clash.describeNode(Node node) |
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) |
DependencySet |
Node.getDifferenceDependency(Node node) |
DependencySet |
Literal.getDifferenceDependency(Node node) |
DependencySet |
Individual.getDifferenceDependency(Node node) |
EdgeList |
EdgeList.getEdgesFromTo(Individual from,
Node to) |
EdgeList |
EdgeList.getEdgesTo(Node to) |
EdgeList |
Individual.getEdgesTo(Node x) |
EdgeList |
Individual.getEdgesTo(Node x,
Role r) |
EdgeList |
EdgeList.getEdgesTo(Role r,
Node to) |
Edge |
EdgeList.getExactEdge(Individual from,
Role role,
Node to) |
Node |
DefaultEdge.getNeighbor(Node node)
Given a node upon which this edge is incident, the opposite incident node is returned.
|
Node |
Edge.getNeighbor(Node node)
Given a node upon which this edge is incident, the opposite incident node is returned.
|
Set<Node> |
EdgeList.getNeighbors(Node node) |
EdgeList |
Individual.getRNeighborEdges(Role r,
Node node)
Get neighbor edges to a specific node
|
boolean |
EdgeList.hasEdge(Individual from,
Role role,
Node to)
Checks if this list contains an edge matching the given subject,
predicate and object.
|
boolean |
EdgeList.hasEdgeTo(Node to) |
boolean |
EdgeList.hasEdgeTo(Role role,
Node to) |
boolean |
EdgeList.hasExactEdge(Individual from,
Role role,
Node to)
Similar to
EdgeList.hasEdge(Individual, Role, Node) but does not
consider subproperty hierarchy for matching so only exact predicate
matches are considered. |
boolean |
Individual.hasRNeighbor(Role r,
Node x) |
boolean |
Individual.hasRSuccessor(Role r,
Node x) |
abstract boolean |
Node.hasSuccessor(Node x) |
boolean |
Literal.hasSuccessor(Node x) |
boolean |
Individual.hasSuccessor(Node x) |
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) |
boolean |
Node.isDifferent(Node node) |
boolean |
Literal.isDifferent(Node node) |
boolean |
Individual.isDifferent(Node node) |
boolean |
Node.isSame(Node node) |
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) |
boolean |
Node.setDifferent(Node node,
DependencySet ds) |
void |
Clash.setNode(Node node) |
boolean |
Node.setSame(Node node,
DependencySet ds) |
static Clash |
Clash.unexplained(Node node,
DependencySet depends) |
static Clash |
Clash.unexplained(Node node,
DependencySet depends,
String msg) |
static Clash |
Clash.valueDatatype(Node node,
DependencySet depends) |
static Clash |
Clash.valueDatatype(Node node,
DependencySet depends,
aterm.ATermAppl value,
aterm.ATermAppl datatype) |
| Constructor and Description |
|---|
DefaultEdge(Role name,
Individual from,
Node to) |
DefaultEdge(Role name,
Individual from,
Node to,
DependencySet d) |
Node(Node node,
ABox abox) |
NodeMerge(Node y,
Node z) |
NodeMerge(Node y,
Node z,
DependencySet ds) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
BlockingContext.moveBlockerDown(Node child)
Sets the blocker to the specified child of the current blocker and
returns if the new blocker candidate is allowed to block.
|
| Modifier and Type | Field and Description |
|---|---|
protected Node |
DisjunctionBranch.node |
| Modifier and Type | Method and Description |
|---|---|
Node |
RuleBranch.getNode() |
Node |
DisjunctionBranch.getNode() |
abstract Node |
Branch.getNode() |
Node |
IndividualBranch.getNode() |
| 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) |
| Modifier and Type | Method and Description |
|---|---|
Node |
CachedEdge.getNeighbor(Node node)
Given a node upon which this edge is incident, the opposite incident node is returned.
|
Node |
CachedEdge.getTo() |
| Modifier and Type | Method and Description |
|---|---|
Node |
CachedEdge.getNeighbor(Node node)
Given a node upon which this edge is incident, the opposite incident node is returned.
|
| Modifier and Type | Method and Description |
|---|---|
Iterator<Map.Entry<Node,Set<aterm.ATermAppl>>> |
SROIQIncStrategy.getRemovedTypeIterator()
Return types that were deleted
|
Iterator<Node> |
SROIQIncStrategy.getUnPrunedIterator()
Return the unpruned indivdiuals
|
| 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 EdgeList |
SROIQIncStrategy.findAllValues(Node node,
Individual neighbor,
Set<aterm.ATermAppl> removedTypes,
Edge edge)
Method to find the edges which an all values could be applied to
|
protected EdgeList |
SROIQIncStrategy.findAllValues(Node node,
Set<aterm.ATermAppl> removedTypes)
Find applicable all values for a removed type during a restore
|
void |
CompletionStrategy.mergeTo(Node y,
Node z,
DependencySet ds)
Merge node y into z.
|
protected boolean |
SROIQIncStrategy.requiredAddType(Node node,
aterm.ATermAppl type)
Test if a type should be readded to a node
|
boolean |
CompletionStrategy.setDifferent(Node y,
Node z,
DependencySet ds) |
protected void |
CompletionStrategy.updateQueueAddEdge(Individual subj,
Role pred,
Node obj)
This method updates the queue in the event that there is an edge added between two nodes.
|
| Modifier and Type | Method and Description |
|---|---|
Node |
OptimizedBasicCompletionQueue.nextLiteral()
Get the next element of a queue of a given type
|
abstract Node |
CompletionQueue.nextLiteral()
Get next literal
|
Node |
BasicCompletionQueue.nextLiteral()
Get the next element of a queue of a given type
|
| Constructor and Description |
|---|
QueueElement(Node n)
Constructor
|
QueueElement(Node n,
aterm.ATermAppl l) |
| Modifier and Type | Method and Description |
|---|---|
protected void |
AbstractTableauRule.addQueueElement(Node node) |
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) |
Copyright © 2019. All rights reserved.