uk.ac.manchester.cs.jfact.kernel

Class InAx

java.lang.Object

uk.ac.manchester.cs.jfact.kernel.InAx

All Implemented Interfaces:

Serializable

@PortedFrom(file="tAxiom.h",
            name="InAx")
public class InAx
extends Object
implements Serializable

DLTREE utils

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor and Description
InAx()

Method Summary

Methods

Modifier and Type	Method and Description
static boolean	containsSAbsAction()
static boolean	containsSAbsBApply()
static boolean	containsSAbsCApply()
static boolean	containsSAbsCAttempt()
static boolean	containsSAbsInput()
static boolean	containsSAbsNApply()
static boolean	containsSAbsNAttempt()
static boolean	containsSAbsRApply()
static boolean	containsSAbsRAttempt()
static boolean	containsSAbsRepCN()
static boolean	containsSAbsRepForall()
static boolean	containsSAbsSplit()
static boolean	containsSAbsTApply()
static Concept	getConcept(DLTree p)
static int	getSAbsAction()
static int	getSAbsBApply()
static int	getSAbsCApply()
static int	getSAbsCAttempt()
static int	getSAbsInput()
static int	getSAbsNApply()
static int	getSAbsNAttempt()
static int	getSAbsRApply()
static int	getSAbsRAttempt()
static int	getSAbsRepCN()
static int	getSAbsRepForall()
static int	getSAbsSplit()
static int	getSAbsTApply()
static boolean	isAbsForall(DLTree p)
static boolean	isAnd(DLTree p)
static boolean	isBot(DLTree p)
static boolean	isForall(DLTree p)
static boolean	isNegCN(DLTree p)
static boolean	isNegNP(DLTree p, TBox t)
static boolean	isNegPC(DLTree p)
static boolean	isNP(Concept C, TBox t)
static boolean	isOForall(DLTree p)
static boolean	isOr(DLTree p)
static boolean	isPosCN(DLTree p)
static boolean	isPosNP(DLTree p, TBox t)
static boolean	isPosPC(DLTree p)
static boolean	isSimpleForall(DLTree p)
static boolean	isTop(DLTree p)
static void	SAbsAction() init SAbsAction
static void	SAbsBApply() init SAbsBApply
static void	SAbsCApply() init SAbsCApply
static void	SAbsCAttempt() init SAbsCAttempt
static void	SAbsInput() init SAbsInput
static void	SAbsNApply() init SAbsNApply
static void	SAbsNAttempt() init SAbsNAttempt
static void	SAbsRApply() init SAbsRApply
static void	SAbsRAttempt() init SAbsRAttempt
static void	SAbsRepCN() init SAbsRepCN
static void	SAbsRepForall() init SAbsRepForall
static void	SAbsSplit() init SAbsSplit
static void	SAbsTApply() init SAbsTApply

Methods inherited from class java.lang.Object

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

Constructor Detail

InAx

public InAx()

Method Detail

getConcept

public static Concept getConcept(DLTree p)

Parameters:

p - the tree

Returns:

an RW concept from a given [C|I]NAME-rooted DLTree

isNP

@PortedFrom(file="tAxiom.cpp",
            name="isNP")
public static boolean isNP(Concept C,
                              TBox t)

Parameters:

C - concept

t - tbox

Returns:

true if a concept C is a concept is non-primitive

isTop

public static boolean isTop(DLTree p)

Parameters:

p - the tree

Returns:

true iff P is a TOP

isBot

public static boolean isBot(DLTree p)

Parameters:

p - the tree

Returns:

true iff P is a BOTTOM

isPosCN

public static boolean isPosCN(DLTree p)

Parameters:

p - the tree

Returns:

true iff P is a positive concept name

isPosNP

public static boolean isPosNP(DLTree p,
              TBox t)

Parameters:

p - the tree

t - tbox

Returns:

true iff P is a positive non-primitive CN

isPosPC

public static boolean isPosPC(DLTree p)

Parameters:

p - the tree

Returns:

true iff P is a positive primitive CN

isNegCN

public static boolean isNegCN(DLTree p)

Parameters:

p - the tree

Returns:

true iff P is a negative concept name

isNegNP

public static boolean isNegNP(DLTree p,
              TBox t)

Parameters:

p - the tree

t - tbox

Returns:

true iff P is a negative non-primitive CN

isNegPC

public static boolean isNegPC(DLTree p)

Parameters:

p - the tree

Returns:

true iff P is a negative primitive CN

isAnd

public static boolean isAnd(DLTree p)

Parameters:

p - the tree

Returns:

check whether P is in the form (and C D)

isOr

public static boolean isOr(DLTree p)

Parameters:

p - the tree

Returns:

true iff P is an OR expression

isForall

public static boolean isForall(DLTree p)

Parameters:

p - the tree

Returns:

true iff P is a general FORALL expression

isOForall

public static boolean isOForall(DLTree p)

Parameters:

p - the tree

Returns:

true iff P is an object FORALL expression

isAbsForall

public static boolean isAbsForall(DLTree p)

Parameters:

p - the tree

Returns:

true iff P is a FORALL expression suitable for absorption

SAbsRepCN

public static void SAbsRepCN()

init SAbsRepCN

SAbsRepForall

public static void SAbsRepForall()

init SAbsRepForall

SAbsBApply

public static void SAbsBApply()

init SAbsBApply

SAbsSplit

public static void SAbsSplit()

init SAbsSplit

SAbsTApply

public static void SAbsTApply()

init SAbsTApply

SAbsCApply

public static void SAbsCApply()

init SAbsCApply

SAbsCAttempt

public static void SAbsCAttempt()

init SAbsCAttempt

SAbsRApply

public static void SAbsRApply()

init SAbsRApply

SAbsRAttempt

public static void SAbsRAttempt()

init SAbsRAttempt

SAbsInput

public static void SAbsInput()

init SAbsInput

SAbsAction

public static void SAbsAction()

init SAbsAction

SAbsNApply

public static void SAbsNApply()

init SAbsNApply

SAbsNAttempt

public static void SAbsNAttempt()

init SAbsNAttempt

containsSAbsRepCN

public static boolean containsSAbsRepCN()

Returns:

true if map contains SAbsRepCN

containsSAbsRepForall

public static boolean containsSAbsRepForall()

Returns:

true if map contains SAbsRepForall

containsSAbsBApply

public static boolean containsSAbsBApply()

Returns:

true if map contains SAbsBApply

containsSAbsSplit

public static boolean containsSAbsSplit()

Returns:

true if map contains SAbsSplit

containsSAbsTApply

public static boolean containsSAbsTApply()

Returns:

true if map contains SAbsTApply

containsSAbsCApply

public static boolean containsSAbsCApply()

Returns:

true if map contains SAbsCApply

containsSAbsCAttempt

public static boolean containsSAbsCAttempt()

Returns:

true if map contains SAbsCAttempt

containsSAbsRApply

public static boolean containsSAbsRApply()

Returns:

true if map contains SAbsRApply

containsSAbsRAttempt

public static boolean containsSAbsRAttempt()

Returns:

true if map contains SAbsRAttempt

containsSAbsInput

public static boolean containsSAbsInput()

Returns:

true if map contains SAbsInput

containsSAbsAction

public static boolean containsSAbsAction()

Returns:

true if map contains SAbsAction

containsSAbsNApply

public static boolean containsSAbsNApply()

Returns:

true if map contains SAbsNApply

containsSAbsNAttempt

public static boolean containsSAbsNAttempt()

Returns:

true if map contains SAbsNAttempt

getSAbsRepCN

public static int getSAbsRepCN()

Returns:

value for SAbsRepCN

getSAbsRepForall

public static int getSAbsRepForall()

Returns:

value for SAbsRepForall

getSAbsBApply

public static int getSAbsBApply()

Returns:

value for SAbsBApply

getSAbsSplit

public static int getSAbsSplit()

Returns:

value for SAbsSplit

getSAbsTApply

public static int getSAbsTApply()

Returns:

value for SAbsTApply

getSAbsCApply

public static int getSAbsCApply()

Returns:

value for SAbsCApply

getSAbsCAttempt

public static int getSAbsCAttempt()

Returns:

value for SAbsCAttempt

getSAbsRApply

public static int getSAbsRApply()

Returns:

value for SAbsRApply

getSAbsRAttempt

public static int getSAbsRAttempt()

Returns:

value for SAbsRAttempt

getSAbsInput

public static int getSAbsInput()

Returns:

value for SAbsInput

getSAbsAction

public static int getSAbsAction()

Returns:

value for SAbsAction

getSAbsNApply

public static int getSAbsNApply()

Returns:

value for SAbsNApply

getSAbsNAttempt

public static int getSAbsNAttempt()

Returns:

value for SAbsNAttempt

isSimpleForall

@PortedFrom(file="tAxiom.h",
            name="isSimpleForall")
public static boolean isSimpleForall(DLTree p)

Parameters:

p - dltree representing a forall

Returns:

true iff P is a FORALL expression suitable for absorption with name at the end