| Package | Description |
|---|---|
| uk.ac.manchester.cs.jfact.helpers | |
| uk.ac.manchester.cs.jfact.kernel | |
| uk.ac.manchester.cs.jfact.kernel.actors | |
| uk.ac.manchester.cs.jfact.split |
| Modifier and Type | Method and Description |
|---|---|
Role |
DLVertex.getProjRole() |
Role |
DLVertex.getRole() |
| Modifier and Type | Method and Description |
|---|---|
static DLTree |
DLTreeFactory.createRole(Role R) |
| Constructor and Description |
|---|
DLVertex(DagTag op,
int m,
Role R,
int c,
Role ProjR)
c'tor for <= n R_C; and for \A R{n}_C; Note order C, n, R.pointer
|
| Modifier and Type | Field and Description |
|---|---|
protected Role |
DlCompletionTreeArc.role
role, labelling given arc
|
| Modifier and Type | Method and Description |
|---|---|
Role |
Role.eliminateToldCycles()
eliminate told role cycle
|
Role |
Role.getInverse() |
Role |
Related.getRole()
get access to role wrt the FROM direction
|
Role |
DlCompletionTreeArc.getRole()
get label of the edge
|
Role |
Role.inverse()
get inverse of given role (non- version)
|
Role |
RoleMaster.RoleCreator.makeEntry(String name) |
Role |
Role.realInverse()
get real inverse of a role (RO)
|
static Role |
Role.resolveRole(DLTree t) |
| Modifier and Type | Method and Description |
|---|---|
List<Role> |
Role.begin_topfunc()
get access to the func super-roles w/o func parents via iterator
|
Collection<Role> |
RATransition.begin()
get the 1st role in (multi-)transition
|
List<Role> |
Role.getAncestor() |
List<Role> |
RoleMaster.getRoles() |
| Modifier and Type | Method and Description |
|---|---|
void |
Role.addDisjointRole(Role R)
set R and THIS as a disjoint; use it after Anc/Desc are determined
|
void |
RoleMaster.addDisjointRoles(Role R,
Role S)
a pair of disjoint roles
|
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
|
void |
RoleMaster.addRoleParent(DLTree tree,
Role parent) |
void |
RoleMaster.addRoleParentProper(Role role,
Role parent)
add parent for the input role
|
void |
RoleMaster.addRoleSynonym(Role role,
Role syn)
add synonym to existing role
|
boolean |
RATransition.applicable(Role R)
check whether transition is applicable wrt role R
|
int |
TBox.atmost2dag(int n,
Role R,
int C) |
protected boolean |
DlSatTester.checkDisjointRoleClash(DlCompletionTree from,
DlCompletionTree to,
Role R,
DepSet dep) |
boolean |
DlSatTester.checkDisjointRoles(Role R,
Role S) |
boolean |
DlSatTester.checkIrreflexivity(Role R) |
DlCompletionTreeArc |
DlCompletionGraph.createLoop(DlCompletionTree node,
Role r,
DepSet dep)
Create an R-loop of NODE wrt dep-set DEP; @return a loop edge
|
DlCompletionTreeArc |
DlCompletionGraph.createNeighbour(DlCompletionTree from,
boolean isPredEdge,
Role r,
DepSet dep)
Create an empty R-neighbour of FROM;
|
int |
TBox.dataAtMost2dag(int n,
Role R,
int C)
create atmost node for data role
|
int |
TBox.dataForall2dag(Role R,
int C)
create forall node for data role
|
void |
TBox.dumpRole(uk.ac.manchester.cs.jfact.kernel.DumpInterface dump,
Role p) |
void |
LogicFeatures.fillRoleData(Role p,
boolean both) |
int |
TBox.forall2dag(Role R,
int C) |
RoleExpression |
TDag2Interface.getDataRoleExpression(Role r) |
DlCompletionTreeArc |
DlCompletionTree.getEdgeLabelled(Role R,
DlCompletionTree node)
check if edge to NODE is labelled by R; return null if does not
|
RoleExpression |
TDag2Interface.getObjectRoleExpression(Role r) |
List<Individual> |
Individual.getRelatedCache(Role R)
get set of individuals related to THIS via R
|
RoleMaster |
TBox.getRM(Role R)
get RW access to the RoleMaster depending of the R
|
boolean |
Individual.hasRelatedCache(Role R) |
boolean |
Role.isDisjoint(Role r)
check whether a role is disjoint with R
|
boolean |
TBox.isDisjointRoles(Role R,
Role S) |
boolean |
TBox.isIrreflexive(Role R)
check if the role R is irreflexive
|
boolean |
DlCompletionTreeArc.isNeighbour(Role pRole)
check if arc is labelled by a super-role of PROLE
|
boolean |
DlCompletionTreeArc.isNeighbour(Role pRole,
DepSet dep)
same as above; fills DEP with current DEPSET if so
|
protected boolean |
NominalReasoner.isNNApplicable(Role r,
int C,
int stopper) |
protected boolean |
DlSatTester.isNNApplicable(Role r,
int C,
int stopper) |
DlCompletionTree |
DlCompletionTree.isSomeApplicable(Role R,
int C)
check if SOME rule is applicable; includes transitive SOME support
|
boolean |
Role.lesserequal(Role r) |
boolean |
RAStateTransitions.recognise(Role R) |
int |
TBox.reflexive2dag(Role R)
create REFLEXIVE node
|
void |
Concept.searchTSbyRoleAndSupers(Role r,
Set<Role> RolesProcessed) |
void |
Role.setInverse(Role p)
set inverse to given role
|
void |
Individual.setRelatedCache(Role R,
List<Individual> v)
set the cache of individuals related to THIS via R
|
void |
DLDag.updateSorts(int a,
Role R,
int b)
update sorts for
|
| Modifier and Type | Method and Description |
|---|---|
void |
RoleMaster.fillReflexiveRoles(List<Role> RR) |
boolean |
Concept.initToldSubsumers(DLTree _desc,
Set<Role> RolesProcessed)
init told subsumers of the concept by given DESCription; @return TRUE iff
concept is CD
|
void |
Concept.searchTSbyRoleAndSupers(Role r,
Set<Role> RolesProcessed) |
| Constructor and Description |
|---|
DlCompletionTreeArc(Role r,
DepSet dep,
DlCompletionTree n) |
RATransition(int st,
Role R)
create a transition with a given label R to given state ST
|
Related(Individual a_,
Individual b_,
Role R_) |
| Constructor and Description |
|---|
AddRoleActor(List<Role> v) |
| 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
|
Copyright © 2013 The University of Manchester. All Rights Reserved.