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

Packages that use Role

Package	Description
uk.ac.manchester.cs.jfact
uk.ac.manchester.cs.jfact.helpers
uk.ac.manchester.cs.jfact.kernel
uk.ac.manchester.cs.jfact.kernel.actors

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

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

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

Uses of Role in uk.ac.manchester.cs.jfact.helpers

Methods in uk.ac.manchester.cs.jfact.helpers that return Role

Modifier and Type	Method and Description
Role	DLVertex.getProjRole()
Role	DLVertex.getRole()

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

Modifier and Type	Method and Description
static DLTree	DLTreeFactory.createRole(Role r)

Constructors in uk.ac.manchester.cs.jfact.helpers with parameters of type Role

Constructor and Description
DLVertex(DagTag op, int m, Role r, int c, Role projR, DLDag heap) c'tor for max n R_C; and for \A R{n}_C; Note order C, n, R.pointer

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

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

Modifier and Type	Method and Description
Role	Role.eliminateToldCycles() eliminate told role cycle
Role	RoleMaster.getBotRole()
Role	Role.getInverse()
Role	Related.getRole()
Role	DlCompletionTreeArc.getRole()
Role	RoleMaster.getTopRole()
Role	Role.inverse()
Role	Role.realInverse()
static Role	Role.resolveRole(DLTree t)
static Role	Role.resolveRole(DLTree t, String r)

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

Modifier and Type	Method and Description
Collection<Role>	RATransition.begin()
List<Role>	Role.beginTopfunc()
List<Role>	Role.getAncestor()
List<Role>	RoleMaster.getRoles()
Stream<Role>	RoleMaster.roles()

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

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
static void	RoleMaster.addRoleParent(DLTree tree, Role parent)
static void	RoleMaster.addRoleParent(Role role, Role parent) add parent for the input role
static void	RoleMaster.addRoleParentProper(Role role, Role parent) add parent for the input role
static void	RoleMaster.addRoleSynonym(Role role, Role syn) add synonym to existing role
boolean	RATransition.applicable(Role r)
int	TBox.atmost2dag(int n, Role r, int c)
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;
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)
int	TBox.dataForall2dag(Role r, int c)
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;
RoleExpression	TDag2Interface.getObjectRoleExpression(Role r)
List<Individual>	Individual.getRelatedCache(Role r)
RoleMaster	TBox.getRM(Role r)
boolean	Individual.hasRelatedCache(Role r)
boolean	Role.isDisjoint(Role r)
boolean	TBox.isDisjointRoles(Role r, Role s)
boolean	TBox.isIrreflexive(Role r)
boolean	DlCompletionTreeArc.isNeighbour(Role pRole)
DlCompletionTree	DlCompletionTree.isSomeApplicable(Role r, int c) check if SOME rule is applicable; includes transitive SOME support
boolean	Role.lesserequal(Role r)
DepSet	DlCompletionTreeArc.neighbourDepSet(Role pRole)
boolean	RAStateTransitions.recognise(Role r)
int	TBox.reflexive2dag(Role r)
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 d, int b) update sorts for (a,b):R construction

Method parameters in uk.ac.manchester.cs.jfact.kernel with type arguments of type Role

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;
void	Concept.searchTSbyRoleAndSupers(Role r, Set<Role> rolesProcessed)

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

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)

Uses of Role in uk.ac.manchester.cs.jfact.kernel.actors

Constructor parameters in uk.ac.manchester.cs.jfact.kernel.actors with type arguments of type Role

Constructor and Description
AddRoleActor(List<Role> v)