| Package | Description |
|---|---|
| uk.ac.manchester.cs.jfact.kernel | |
| uk.ac.manchester.cs.jfact.kernel.modelcaches | |
| uk.ac.manchester.cs.jfact.split |
| Modifier and Type | Field and Description |
|---|---|
protected DlCompletionTree |
DlCompletionTree.blocker
blocker of a node
|
protected DlCompletionTree |
DlSatTester.curNode
currently processed CTree node
|
| Modifier and Type | Method and Description |
|---|---|
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()
get (RW) access to the end of arc
|
DlCompletionTree |
DlCompletionTree.getBlocker()
get access to the blocker
|
DlCompletionTree |
DlCompletionGraph.getNewNode()
get new node (with internal level)
|
protected DlCompletionTree |
ToDoList.ToDoEntry.getNode() |
DlCompletionTree |
Individual.getNode() |
DlCompletionTree |
DlCompletionGraph.getNode(int i) |
DlCompletionTree |
DlCompletionTree.getParentNode()
return RW pointer to the parent node; WARNING: correct only for nodes
with hasParent()==TRUE
|
DlCompletionTree |
DlCompletionGraph.getRoot()
get a root node (non-const)
|
DlCompletionTree |
DlSatTester.getRootNode()
get the ROOT node of the completion graph
|
DlCompletionTree |
DlCompletionTree.isSomeApplicable(Role R,
int C)
check if SOME rule is applicable; includes transitive SOME support
|
DlCompletionTree |
DlCompletionTree.resolvePBlocker()
get node to which current one was merged
|
DlCompletionTree |
DlCompletionTree.resolvePBlocker(DepSet dep)
get node to which current one was merged; fills DEP from pDep's
|
| 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
|
| 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
|
void |
ToDoList.addEntry(DlCompletionTree node,
DagTag type,
ConceptWDep C)
add entry with given NODE and CONCEPT with given OFFSET to the Todo table
|
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
|
protected boolean |
DlSatTester.checkDisjointRoleClash(DlCompletionTree from,
DlCompletionTree to,
Role R,
DepSet dep) |
int |
DlCompletionTree.compareTo(DlCompletionTree o) |
DlCompletionTreeArc |
DlCompletionGraph.createLoop(DlCompletionTree node,
Role r,
DepSet dep)
Create an R-loop of NODE wrt dep-set DEP; @return a loop edge
|
protected ModelCacheInterface |
DlSatTester.createModelCache(DlCompletionTree p)
return cache of given completion tree (implementation)
|
DlCompletionTreeArc |
DlCompletionGraph.createNeighbour(DlCompletionTree from,
boolean isPredEdge,
Role r,
DepSet dep)
Create an empty R-neighbour of FROM;
|
void |
DlCompletionGraph.detectBlockedStatus(DlCompletionTree node) |
List<DataExpression> |
ReasoningKernel.getDataLabel(DlCompletionTree node,
boolean onlyDet) |
Set<RoleExpression> |
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; return null if does not
|
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<RoleExpression> |
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
|
protected boolean |
DlSatTester.initNewNode(DlCompletionTree node,
DepSet dep,
int C) |
boolean |
DlCompletionTree.isBlockedBy_SH(DlCompletionTree p)
check blocking condition for SH logic
|
boolean |
DlCompletionTree.isBlockedBy_SHI(DLDag dag,
DlCompletionTree p)
check blocking condition for SHI logic
|
boolean |
DlCompletionTree.isBlockedBy_SHIQ(DLDag dag,
DlCompletionTree p)
check blocking condition for SHIQ logic using optimised blocking
|
void |
DlCompletionGraph.merge(DlCompletionTree from,
DlCompletionTree to,
DepSet dep,
List<DlCompletionTreeArc> edges) |
boolean |
DlCompletionGraph.nonMergable(DlCompletionTree p,
DlCompletionTree q,
Reference<DepSet> dep)
Class for maintaining graph of CT nodes.
|
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; @return
restorer
|
| Constructor and Description |
|---|
DlCompletionTreeArc(Role r,
DepSet dep,
DlCompletionTree n) |
| 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
|
| Constructor and Description |
|---|
ModelCacheIan(DLDag heap,
DlCompletionTree p,
boolean flagNominals,
int nC,
int nR,
boolean simpleRules)
Create cache model of given CompletionTree using given HEAP
|
| Modifier and Type | Method and Description |
|---|---|
List<DlCompletionTree> |
KnowledgeExplorer.getNeighbours(DlCompletionTree node,
Role R)
build the set of neighbours of a NODE via role ROLE; put the resulting
list into RESULT
|
| Modifier and Type | Method and Description |
|---|---|
List<DataExpression> |
KnowledgeExplorer.getDataLabel(DlCompletionTree node,
boolean onlyDet) |
Set<RoleExpression> |
KnowledgeExplorer.getDataRoles(DlCompletionTree node,
boolean onlyDet) |
List<DlCompletionTree> |
KnowledgeExplorer.getNeighbours(DlCompletionTree node,
Role R)
build the set of neighbours of a NODE via role ROLE; put the resulting
list into RESULT
|
List<ConceptExpression> |
KnowledgeExplorer.getObjectLabel(DlCompletionTree node,
boolean onlyDet)
put into RESULT all the data expressions from the NODE label
|
Set<RoleExpression> |
KnowledgeExplorer.getObjectRoles(DlCompletionTree node,
boolean onlyDet,
boolean needIncoming)
build the set of object neighbours of a NODE; incoming edges are counted
iff NEEDINCOMING is true
|
Copyright © 2013 The University of Manchester. All Rights Reserved.