Uses of Class
uk.ac.manchester.cs.jfact.kernel.DlCompletionTree

Packages that use DlCompletionTree

Package	Description
uk.ac.manchester.cs.jfact
uk.ac.manchester.cs.jfact.kernel
uk.ac.manchester.cs.jfact.kernel.modelcaches
uk.ac.manchester.cs.jfact.kernel.todolist

Uses of DlCompletionTree in uk.ac.manchester.cs.jfact

Methods in uk.ac.manchester.cs.jfact that return DlCompletionTree

Modifier and Type	Method and Description
DlCompletionTree	KnowledgeExplorer.getBlocker(DlCompletionTree node)

Methods in uk.ac.manchester.cs.jfact that return types with arguments of type DlCompletionTree

Modifier and Type	Method and Description
List<DlCompletionTree>	KnowledgeExplorer.getNeighbours(DlCompletionTree node, Role no)

Methods in uk.ac.manchester.cs.jfact with parameters of type DlCompletionTree

Modifier and Type	Method and Description
DlCompletionTree	KnowledgeExplorer.getBlocker(DlCompletionTree node)
List<DataExpression>	KnowledgeExplorer.getDataLabel(DlCompletionTree node, boolean onlyDet)
Set<DataRoleExpression>	KnowledgeExplorer.getDataRoles(DlCompletionTree node, boolean onlyDet)
List<DlCompletionTree>	KnowledgeExplorer.getNeighbours(DlCompletionTree node, Role no)
List<ConceptExpression>	KnowledgeExplorer.getObjectLabel(DlCompletionTree node, boolean onlyDet)
Set<ObjectRoleExpression>	KnowledgeExplorer.getObjectRoles(DlCompletionTree node, boolean onlyDet, boolean needIncoming)

Uses of DlCompletionTree in uk.ac.manchester.cs.jfact.kernel

Methods in uk.ac.manchester.cs.jfact.kernel that return DlCompletionTree

Modifier and Type	Method and Description
DlCompletionTree	TBox.buildCompletionTree(Concept pConcept) build a completion tree for a concept C (no caching as it breaks the idea of KE).
DlCompletionTree	ReasoningKernel.buildCompletionTree(ConceptExpression c) build a completion tree for a concept expression C (no caching as it breaks the idea of KE).
DlCompletionTree	DlCompletionTreeArc.getArcEnd()
DlCompletionTree	DlCompletionTree.getBlocker()
DlCompletionTree	ReasoningKernel.getBlocker(DlCompletionTree node)
DlCompletionTree	DlCompletionGraph.getFCViolator(int c)
DlCompletionTree	DlCompletionGraph.getNewNode()
DlCompletionTree	Individual.getNode()
DlCompletionTree	DlCompletionGraph.getNode(int i)
DlCompletionTree	DlCompletionTree.getParentNode()
DlCompletionTree	DlCompletionGraph.getRoot()
DlCompletionTree	DlSatTester.getRootNode()
DlCompletionTree	DlCompletionTree.isSomeApplicable(Role r, int c) check if SOME rule is applicable; includes transitive SOME support
DlCompletionTree	DlCompletionTree.resolvePBlocker()
DlCompletionTree	DlCompletionTree.resolvePBlocker(DepSet dep)

Methods in uk.ac.manchester.cs.jfact.kernel that return types with arguments of type DlCompletionTree

Modifier and Type	Method and Description
List<DlCompletionTree>	ReasoningKernel.getNeighbours(DlCompletionTree node, RoleExpression role) build the set of neighbours of a NODE via role ROLE; put the resulting list into RESULT
java.util.stream.Stream<DlCompletionTree>	DlCompletionGraph.nodes()

Methods in uk.ac.manchester.cs.jfact.kernel with parameters of type DlCompletionTree

Modifier and Type	Method and Description
void	DlCompletionGraph.addConceptToNode(DlCompletionTree node, ConceptWDep c, DagTag tag) add concept C of a type TAG to NODE; call blocking check if appropriate
DlCompletionTreeArc	DlCompletionGraph.addRoleLabel(DlCompletionTree from, DlCompletionTree to, boolean isPredEdge, Role r, DepSet dep) add role R with dep-set DEP to the label of the TO arc
int	DlCompletionTree.compareTo(DlCompletionTree o)
DlCompletionTreeArc	DlCompletionGraph.createLoop(DlCompletionTree node, Role r, DepSet dep) Create an R-loop of NODE wrt dep-set DEP;
DlCompletionTreeArc	DlCompletionGraph.createNeighbour(DlCompletionTree from, boolean isPredEdge, Role r, DepSet dep) Create an empty R-neighbour of FROM;
void	DlCompletionGraph.detectBlockedStatus(DlCompletionTree node)
DlCompletionTree	ReasoningKernel.getBlocker(DlCompletionTree node)
List<DataExpression>	ReasoningKernel.getDataLabel(DlCompletionTree node, boolean onlyDet)
Set<DataRoleExpression>	ReasoningKernel.getDataRoles(DlCompletionTree node, boolean onlyDet) build the set of data neighbours of a NODE, put the set of data roles into the RESULT variable
DlCompletionTreeArc	DlCompletionTree.getEdgeLabelled(Role r, DlCompletionTree node) check if edge to NODE is labelled by R;
List<DlCompletionTree>	ReasoningKernel.getNeighbours(DlCompletionTree node, RoleExpression role) build the set of neighbours of a NODE via role ROLE; put the resulting list into RESULT
List<ConceptExpression>	ReasoningKernel.getObjectLabel(DlCompletionTree node, boolean onlyDet) put into RESULT all the expressions from the NODE label; if ONLYDET is true, return only deterministic elements
Set<ObjectRoleExpression>	ReasoningKernel.getObjectRoles(DlCompletionTree node, boolean onlyDet, boolean needIncoming) build the set of object neighbours of a NODE, put the set of object roles and inverses into the RESULT variable
boolean	DlCompletionTree.isBlockedBySH(DlCompletionTree p)
boolean	DlCompletionTree.isBlockedBySHI(DLDag dag, DlCompletionTree p)
boolean	DlCompletionTree.isBlockedBySHIQ(DLDag dag, DlCompletionTree p)
void	DlCompletionGraph.merge(DlCompletionTree from, DlCompletionTree to, DepSet dep, List<DlCompletionTreeArc> edges) merge labels; see SHOIN paper for detailed description
boolean	DlCompletionGraph.nonMergable(DlCompletionTree p, DlCompletionTree q, Reference<DepSet> dep)
boolean	DlCompletionTree.nonMergable(DlCompletionTree node, Reference<DepSet> dep) check if the NODE's and current node's IR are labelled with the same level
void	DlSatTester.repeatUnblockedNode(DlCompletionTree node, boolean direct) re-apply all the relevant expantion rules to a given unblocked NODE
void	DlCompletionGraph.saveNode(DlCompletionTree node, int level) save given node wrt level
void	DlCompletionTree.setBlocker(DlCompletionTree blocker)
boolean	DlCompletionGraph.setCurIR(DlCompletionTree node, DepSet ds)
Restorer	DlCompletionTree.setDBlocked(DlCompletionTree blocker) mark node d-blocked
Restorer	DlCompletionTree.setIBlocked(DlCompletionTree blocker) mark node i-blocked
void	Individual.setNode(DlCompletionTree node)
Restorer	DlCompletionTree.setPBlocked(DlCompletionTree blocker, DepSet dep) mark node purged
void	DlCompletionGraph.updateDBlockedStatus(DlCompletionTree node) update blocked status for d-blocked node
Restorer	DlCompletionTree.updateIR(DlCompletionTree node, DepSet toAdd) update IR of the current node with IR from NODE and additional clash-set;

Constructors in uk.ac.manchester.cs.jfact.kernel with parameters of type DlCompletionTree

Constructor and Description
DlCompletionTreeArc(Role r, DepSet dep, DlCompletionTree n)

Uses of DlCompletionTree in uk.ac.manchester.cs.jfact.kernel.modelcaches

Methods in uk.ac.manchester.cs.jfact.kernel.modelcaches with parameters of type DlCompletionTree

Modifier and Type	Method and Description
void	ModelCacheIan.initRolesFromArcs(DlCompletionTree pCT) init existRoles from arcs; can be used to create pseudo-cache with deps of CT edges

Constructors in uk.ac.manchester.cs.jfact.kernel.modelcaches with parameters of type DlCompletionTree

Constructor and Description
ModelCacheIan(DLDag heap, DlCompletionTree p, boolean flagNominals, int nC, int nR, JFactReasonerConfiguration simpleRules) Create cache model of given CompletionTree using given HEAP

Uses of DlCompletionTree in uk.ac.manchester.cs.jfact.kernel.todolist

Methods in uk.ac.manchester.cs.jfact.kernel.todolist that return DlCompletionTree

Modifier and Type	Method and Description
DlCompletionTree	ToDoEntry.getNode()

Methods in uk.ac.manchester.cs.jfact.kernel.todolist with parameters of type DlCompletionTree

Modifier and Type	Method and Description
void	ArrayQueue.add(DlCompletionTree node, ConceptWDep offset) add entry to a queue
void	ToDoList.addEntry(DlCompletionTree node, DagTag type, ConceptWDep c) add entry with given NODE and CONCEPT with given OFFSET to the Todo table