uk.ac.manchester.cs.jfact.helpers

Class DLTreeFactory

java.lang.Object

uk.ac.manchester.cs.jfact.helpers.DLTreeFactory

public class DLTreeFactory
extends Object

Constructor Summary

Constructors

Constructor and Description
DLTreeFactory()

Method Summary

Methods

Modifier and Type	Method and Description
static DLTree	buildDisjAux(List<DLTree> beg) build a construction in the form AND (\neg q_i)
static DLTree	buildTree(Lexeme t)
static DLTree	buildTree(Lexeme t, DLTree t1)
static DLTree	buildTree(Lexeme t, DLTree t1, DLTree t2)
static DLTree	createBottom() create BOTTOM element
static DLTree	createEntry(Token tag, NamedEntry entry)
static DLTree	createInverse(DLTree R)
static DLTree	createRole(Role R)
static DLTree	createSNFAnd(Collection<DLTree> collection)
static DLTree	createSNFAnd(Collection<DLTree> collection, DLTree ancestor)
static DLTree	createSNFAnd(DLTree C, DLTree D)
static DLTree	createSNFExists(DLTree R, DLTree C) create existential restriction of given formulas (\ER.C)
static DLTree	createSNFForall(DLTree R, DLTree C)
static DLTree	createSNFGE(int n, DLTree R, DLTree C)
static DLTree	createSNFLE(int n, DLTree R, DLTree C) create at-most (LE) restriction of given formulas (<= n R.C)
static DLTree	createSNFNot(DLTree C)
static DLTree	createSNFNot(DLTree C, DLTree ancestor)
static DLTree	createSNFOr(Collection<DLTree> C) create disjunction of given formulas
static DLTree	createSNFSelf(DLTree R) create SELF restriction for role R
static DLTree	createTop() create TOP element
static DLTree	inverseComposition(DLTree tree)
static boolean	isBotRole(DLTree t) check whether T is a bottom (empty) role
static boolean	isFunctionalExpr(DLTree t, NamedEntry R) check whether T is an expression in the form (atmost 1 RNAME)
static boolean	isSNF(DLTree t)
static boolean	isSubTree(DLTree t1, DLTree t2)
static boolean	isTopRole(DLTree t) check whether T is a top (universal) role
static boolean	isUniversalRole(DLTree t) check whether T is U-Role
static boolean	replaceSynonymsFromTree(DLTree desc)
static NamedEntry	unwrap(DLTree t) get TDE by a given DLTree
static DLTree	wrap(NamedEntry t) get DLTree by a given TDE

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

DLTreeFactory

public DLTreeFactory()

Method Detail

createBottom

public static DLTree createBottom()

create BOTTOM element

createInverse

public static DLTree createInverse(DLTree R)

buildDisjAux

public static DLTree buildDisjAux(List<DLTree> beg)

build a construction in the form AND (\neg q_i)

createSNFAnd

public static DLTree createSNFAnd(DLTree C,
                  DLTree D)

createSNFAnd

public static DLTree createSNFAnd(Collection<DLTree> collection)

createSNFAnd

public static DLTree createSNFAnd(Collection<DLTree> collection,
                  DLTree ancestor)

createSNFExists

public static DLTree createSNFExists(DLTree R,
                     DLTree C)

create existential restriction of given formulas (\ER.C)

createSNFForall

public static DLTree createSNFForall(DLTree R,
                     DLTree C)

createRole

public static DLTree createRole(Role R)

createEntry

public static DLTree createEntry(Token tag,
                 NamedEntry entry)

createSNFLE

public static DLTree createSNFLE(int n,
                 DLTree R,
                 DLTree C)

create at-most (LE) restriction of given formulas (<= n R.C)

isBotRole

public static boolean isBotRole(DLTree t)

check whether T is a bottom (empty) role

isTopRole

public static boolean isTopRole(DLTree t)

check whether T is a top (universal) role

createSNFSelf

public static DLTree createSNFSelf(DLTree R)

create SELF restriction for role R

createSNFGE

public static DLTree createSNFGE(int n,
                 DLTree R,
                 DLTree C)

createSNFNot

public static DLTree createSNFNot(DLTree C)

createSNFNot

public static DLTree createSNFNot(DLTree C,
                  DLTree ancestor)

createSNFOr

public static DLTree createSNFOr(Collection<DLTree> C)

create disjunction of given formulas

createTop

public static DLTree createTop()

create TOP element

inverseComposition

public static DLTree inverseComposition(DLTree tree)

wrap

public static DLTree wrap(NamedEntry t)

get DLTree by a given TDE

unwrap

public static NamedEntry unwrap(DLTree t)

get TDE by a given DLTree

buildTree

public static DLTree buildTree(Lexeme t,
               DLTree t1,
               DLTree t2)

buildTree

public static DLTree buildTree(Lexeme t,
               DLTree t1)

buildTree

public static DLTree buildTree(Lexeme t)

isFunctionalExpr

public static boolean isFunctionalExpr(DLTree t,
                       NamedEntry R)

check whether T is an expression in the form (atmost 1 RNAME)

isSNF

public static boolean isSNF(DLTree t)

isSubTree

public static boolean isSubTree(DLTree t1,
                DLTree t2)

isUniversalRole

public static boolean isUniversalRole(DLTree t)

check whether T is U-Role

replaceSynonymsFromTree

public static boolean replaceSynonymsFromTree(DLTree desc)