@PortedFrom(file="tAxiom.h", name="InAx") public class InAx extends Object implements Serializable
| Modifier and Type | Field and Description |
|---|---|
static String |
S_ABS_ACTION
statistics
|
static String |
S_ABS_B_APPLY
statistics
|
static String |
S_ABS_C_APPLY
statistics
|
static String |
S_ABS_C_ATTEMPT
statistics
|
static String |
S_ABS_INPUT
statistics
|
static String |
S_ABS_N_APPLY
statistics
|
static String |
S_ABS_N_ATTEMPT
statistics
|
static String |
S_ABS_R_APPLY
statistics
|
static String |
S_ABS_R_ATTEMPT
statistics
|
static String |
S_ABS_REP_CN
statistics
|
static String |
S_ABS_REP_FORALL
statistics
|
static String |
S_ABS_SPLIT
statistics
|
static String |
S_ABS_T_APPLY
statistics
|
| Constructor and Description |
|---|
InAx() |
| Modifier and Type | Method and Description |
|---|---|
boolean |
containsSAbsAction() |
boolean |
containsSAbsBApply() |
boolean |
containsSAbsCApply() |
boolean |
containsSAbsCAttempt() |
boolean |
containsSAbsInput() |
boolean |
containsSAbsNApply() |
boolean |
containsSAbsNAttempt() |
boolean |
containsSAbsRApply() |
boolean |
containsSAbsRAttempt() |
boolean |
containsSAbsRepCN() |
boolean |
containsSAbsRepForall() |
boolean |
containsSAbsSplit() |
boolean |
containsSAbsTApply() |
static Concept |
getConcept(DLTree p) |
int |
getSAbsAction() |
int |
getSAbsBApply() |
int |
getSAbsCApply() |
int |
getSAbsCAttempt() |
int |
getSAbsInput() |
int |
getSAbsNApply() |
int |
getSAbsNAttempt() |
int |
getSAbsRApply() |
int |
getSAbsRAttempt() |
int |
getSAbsRepCN() |
int |
getSAbsRepForall() |
int |
getSAbsSplit() |
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) |
static boolean |
isNegPC(DLTree p) |
static boolean |
isNP(Concept c) |
static boolean |
isOForall(DLTree p) |
static boolean |
isOr(DLTree p) |
static boolean |
isPosCN(DLTree p) |
static boolean |
isPosNP(DLTree p) |
static boolean |
isPosPC(DLTree p) |
static boolean |
isSimpleForall(DLTree p) |
static boolean |
isTop(DLTree p) |
void |
sAbsAction()
init SAbsAction
|
void |
sAbsBApply()
init SAbsBApply
|
void |
sAbsCApply()
init SAbsCApply
|
void |
sAbsCAttempt()
init SAbsCAttempt
|
void |
sAbsInput()
init SAbsInput
|
void |
sAbsNApply()
init SAbsNApply
|
void |
sAbsNAttempt()
init SAbsNAttempt
|
void |
sAbsRApply()
init SAbsRApply
|
void |
sAbsRAttempt()
init SAbsRAttempt
|
void |
sAbsRepCN()
init SAbsRepCN
|
void |
sAbsRepForall()
init SAbsRepForall
|
void |
sAbsSplit()
init SAbsSplit
|
void |
sAbsTApply()
init SAbsTApply
|
public static final String S_ABS_N_ATTEMPT
public static final String S_ABS_N_APPLY
public static final String S_ABS_ACTION
public static final String S_ABS_INPUT
public static final String S_ABS_R_ATTEMPT
public static final String S_ABS_R_APPLY
public static final String S_ABS_C_ATTEMPT
public static final String S_ABS_C_APPLY
public static final String S_ABS_T_APPLY
public static final String S_ABS_SPLIT
public static final String S_ABS_B_APPLY
public static final String S_ABS_REP_FORALL
public static final String S_ABS_REP_CN
public static Concept getConcept(DLTree p)
p - the tree@PortedFrom(file="tAxiom.cpp", name="isNP") public static boolean isNP(Concept c)
c - conceptpublic static boolean isTop(DLTree p)
p - the treepublic static boolean isBot(DLTree p)
p - the treepublic static boolean isPosCN(DLTree p)
p - the treepublic static boolean isPosNP(DLTree p)
p - the treepublic static boolean isPosPC(DLTree p)
p - the treepublic static boolean isNegCN(DLTree p)
p - the treepublic static boolean isNegNP(DLTree p)
p - the treepublic static boolean isNegPC(DLTree p)
p - the treepublic static boolean isAnd(DLTree p)
p - the treepublic static boolean isOr(DLTree p)
p - the treepublic static boolean isForall(DLTree p)
p - the treepublic static boolean isOForall(DLTree p)
p - the treepublic static boolean isAbsForall(DLTree p)
p - the treepublic void sAbsRepCN()
public void sAbsRepForall()
public void sAbsBApply()
public void sAbsSplit()
public void sAbsTApply()
public void sAbsCApply()
public void sAbsCAttempt()
public void sAbsRApply()
public void sAbsRAttempt()
public void sAbsInput()
public void sAbsAction()
public void sAbsNApply()
public void sAbsNAttempt()
public boolean containsSAbsRepCN()
public boolean containsSAbsRepForall()
public boolean containsSAbsBApply()
public boolean containsSAbsSplit()
public boolean containsSAbsTApply()
public boolean containsSAbsCApply()
public boolean containsSAbsCAttempt()
public boolean containsSAbsRApply()
public boolean containsSAbsRAttempt()
public boolean containsSAbsInput()
public boolean containsSAbsAction()
public boolean containsSAbsNApply()
public boolean containsSAbsNAttempt()
public int getSAbsRepCN()
public int getSAbsRepForall()
public int getSAbsBApply()
public int getSAbsSplit()
public int getSAbsTApply()
public int getSAbsCApply()
public int getSAbsCAttempt()
public int getSAbsRApply()
public int getSAbsRAttempt()
public int getSAbsInput()
public int getSAbsAction()
public int getSAbsNApply()
public int getSAbsNAttempt()
@PortedFrom(file="tAxiom.h", name="isSimpleForall") public static boolean isSimpleForall(DLTree p)
p - dltree representing a forallCopyright © 2016 The University of Manchester. All rights reserved.