Uses of Class
org.mindswap.pellet.Node

Packages that use Node

Package	Description
com.clarkparsia.pellet
com.clarkparsia.pellet.impl
com.clarkparsia.pellet.rules
org.mindswap.pellet
org.mindswap.pellet.tableau.blocking
org.mindswap.pellet.tableau.branch
org.mindswap.pellet.tableau.cache
org.mindswap.pellet.tableau.completion
org.mindswap.pellet.tableau.completion.queue
org.mindswap.pellet.tableau.completion.rule

Uses of Node in com.clarkparsia.pellet

Methods in com.clarkparsia.pellet that return types with arguments of type Node

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()

Methods in com.clarkparsia.pellet with parameters of type Node

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

Uses of Node in com.clarkparsia.pellet.impl

Methods in com.clarkparsia.pellet.impl that return types with arguments of type Node

Modifier and Type	Method and Description
Iterator<Map.Entry<Node,Set<aterm.ATermAppl>>>	SimpleIncrementalChangeTracker.deletedTypes()
Iterator<Node>	SimpleIncrementalChangeTracker.unprunedNodes()

Methods in com.clarkparsia.pellet.impl with parameters of type Node

Modifier and Type	Method and Description
boolean	SimpleIncrementalChangeTracker.addDeletedType(Node n, aterm.ATermAppl type)
boolean	SimpleIncrementalChangeTracker.addUnprunedNode(Node n)

Uses of Node in com.clarkparsia.pellet.rules

Methods in com.clarkparsia.pellet.rules that return types with arguments of type Node

Modifier and Type	Method and Description
Set<Map.Entry<? extends AtomVariable,? extends Node>>	VariableBinding.entrySet()

Methods in com.clarkparsia.pellet.rules with parameters of type Node

Modifier and Type	Method and Description
void	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)

Constructor parameters in com.clarkparsia.pellet.rules with type arguments of type Node

Constructor and Description
LiteralFilter(Iterator<Node> iterator)

Uses of Node in org.mindswap.pellet

Subclasses of Node in org.mindswap.pellet

Modifier and Type	Class and Description
class	Individual
class	Literal

Fields in org.mindswap.pellet declared as Node

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.

Fields in org.mindswap.pellet with type parameters of type Node

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.

Methods in org.mindswap.pellet that return Node

Modifier and Type	Method and Description
abstract Node	Node.copyTo(ABox abox)
Node	Individual.copyTo(ABox abox)
Node	Literal.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()

Methods in org.mindswap.pellet that return types with arguments of type Node

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)

Methods in org.mindswap.pellet with parameters of type Node

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	Individual.getDifferenceDependency(Node node)
DependencySet	Literal.getDifferenceDependency(Node node)
EdgeList	EdgeList.getEdgesFromTo(Individual from, Node to)
EdgeList	Individual.getEdgesTo(Node x)
EdgeList	EdgeList.getEdgesTo(Node to)
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	Individual.hasSuccessor(Node x)
boolean	Literal.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	Individual.isDifferent(Node node)
boolean	Literal.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)
void	Node.setDifferent(Node node, DependencySet ds)
void	Clash.setNode(Node node)
void	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)

Constructors in org.mindswap.pellet with parameters of type Node

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)

Uses of Node in org.mindswap.pellet.tableau.blocking

Methods in org.mindswap.pellet.tableau.blocking with parameters of type Node

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.

Uses of Node in org.mindswap.pellet.tableau.branch

Fields in org.mindswap.pellet.tableau.branch declared as Node

Modifier and Type	Field and Description
protected Node	DisjunctionBranch.node

Methods in org.mindswap.pellet.tableau.branch that return Node

Modifier and Type	Method and Description
Node	DisjunctionBranch.getNode()
abstract Node	Branch.getNode()
Node	RuleBranch.getNode()
Node	IndividualBranch.getNode()

Constructors in org.mindswap.pellet.tableau.branch with parameters of type Node

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)

Uses of Node in org.mindswap.pellet.tableau.cache

Methods in org.mindswap.pellet.tableau.cache that return Node

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()

Methods in org.mindswap.pellet.tableau.cache with parameters of type Node

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.

Uses of Node in org.mindswap.pellet.tableau.completion

Methods in org.mindswap.pellet.tableau.completion that return types with arguments of type Node

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

Methods in org.mindswap.pellet.tableau.completion with parameters of type Node

Modifier and Type	Method and Description
void	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
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.

Uses of Node in org.mindswap.pellet.tableau.completion.queue

Methods in org.mindswap.pellet.tableau.completion.queue that return Node

Modifier and Type	Method and Description
abstract Node	CompletionQueue.nextLiteral() Get next literal
Node	OptimizedBasicCompletionQueue.nextLiteral() Get the next element of a queue of a given type
Node	BasicCompletionQueue.nextLiteral() Get the next element of a queue of a given type

Constructors in org.mindswap.pellet.tableau.completion.queue with parameters of type Node

Constructor and Description
QueueElement(Node n) Constructor
QueueElement(Node n, aterm.ATermAppl l)

Uses of Node in org.mindswap.pellet.tableau.completion.rule

Methods in org.mindswap.pellet.tableau.completion.rule with parameters of type Node

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)