el_utilities

Overview

Package

Class

Use

Tree

Deprecated

Index

Help

PREV CLASS NEXT CLASS

FRAMES NO FRAMES

SUMMARY: NESTED | FIELD | CONSTR | METHOD

DETAIL: FIELD | CONSTR | METHOD

com.cyc.cycjava.cycl
Class el_utilities

java.lang.Object
  com.cyc.tool.subl.util.SubLTrampolineFile
      com.cyc.tool.subl.util.SubLTranslatedFile
          com.cyc.cycjava.cycl.el_utilities

All Implemented Interfaces:: CommonSymbols, SubLFile

public final class el_utilities
extends SubLTranslatedFile
extends SubLTranslatedFile

Nested Class Summary
`static class`	`el_utilities.$cyc_const_general_existential_operator_p$UnaryFunction`
`static class`	`el_utilities.$el_conjunction_p$UnaryFunction`
`static class`	`el_utilities.$el_disjunction_p$UnaryFunction`
`static class`	`el_utilities.$el_formula_p$UnaryFunction`
`static class`	`el_utilities.$el_implicit_meta_literal_sentence_p$UnaryFunction`
`static class`	`el_utilities.$el_meets_pragmatic_requirement_p$UnaryFunction`
`static class`	`el_utilities.$el_negation_p$UnaryFunction`
`static class`	`el_utilities.$expand_subl_fn_p$UnaryFunction`
`static class`	`el_utilities.$formula_with_sequence_termP$UnaryFunction`
`static class`	`el_utilities.$forward_non_trigger_literal_litP$UnaryFunction`
`static class`	`el_utilities.$gafP$UnaryFunction`
`static class`	`el_utilities.$kappa_predicate_p$UnaryFunction`
`static class`	`el_utilities.$scoping_relation_expressionP$UnaryFunction`

Nested classes/interfaces inherited from class com.cyc.tool.subl.util.SubLTranslatedFile
`SubLTranslatedFile.SubL`

Field Summary
`static SubLObject`	`$const0$not`
`static SubLObject`	`$const1$or`
`static SubLObject`	`$const10$thereExistExactly`
`static SubLObject`	`$const100$Lambda`
`static SubLObject`	`$const102$EverythingPSC`
`static SubLObject`	`$const103$microtheoryDesignationArgnum`
`static SubLObject`	`$const104$sentenceDesignationArgnum`
`static SubLObject`	`$const107$Predicate`
`static SubLObject`	`$const108$Function_Denotational`
`static SubLObject`	`$const112$termPhrases`
`static SubLObject`	`$const114$regexStringMatch`
`static SubLObject`	`$const116$trueSentence_CaseInsensitive`
`static SubLObject`	`$const127$CycLFormula`
`static SubLObject`	`$const128$CycLSentence`
`static SubLObject`	`$const13$was`
`static SubLObject`	`$const137$True`
`static SubLObject`	`$const138$False`
`static SubLObject`	`$const14$hasAlwaysBeen`
`static SubLObject`	`$const15$willBe`
`static SubLObject`	`$const16$willAlwaysBe`
`static SubLObject`	`$const17$was_Metric`
`static SubLObject`	`$const18$willBe_Metric`
`static SubLObject`	`$const19$ExpandSubLFn`
`static SubLObject`	`$const2$and`
`static SubLObject`	`$const20$SubLQuoteFn`
`static SubLObject`	`$const21$Quote`
`static SubLObject`	`$const22$exceptFor`
`static SubLObject`	`$const23$exceptWhen`
`static SubLObject`	`$const24$abnormal`
`static SubLObject`	`$const25$pragmaticRequirement`
`static SubLObject`	`$const26$meetsPragmaticRequirement`
`static SubLObject`	`$const27$querySentence`
`static SubLObject`	`$const3$implies`
`static SubLObject`	`$const30$TheList`
`static SubLObject`	`$const32$TheEmptyList`
`static SubLObject`	`$const33$TheEmptySet`
`static SubLObject`	`$const34$TheSet`
`static SubLObject`	`$const35$TheSetOf`
`static SubLObject`	`$const38$SpecsFn`
`static SubLObject`	`$const4$equiv`
`static SubLObject`	`$const5$xor`
`static SubLObject`	`$const51$ExistentialQuantifier`
`static SubLObject`	`$const6$forAll`
`static SubLObject`	`$const69$ist`
`static SubLObject`	`$const7$thereExists`
`static SubLObject`	`$const71$InstanceNamedFn`
`static SubLObject`	`$const8$thereExistAtLeast`
`static SubLObject`	`$const83$isa`
`static SubLObject`	`$const84$Thing`
`static SubLObject`	`$const85$quotedIsa`
`static SubLObject`	`$const86$genls`
`static SubLObject`	`$const87$genlPreds`
`static SubLObject`	`$const88$genlInverse`
`static SubLObject`	`$const89$genlMt`
`static SubLObject`	`$const9$thereExistAtMost`
`static SubLObject`	`$const90$resultIsa`
`static SubLObject`	`$const91$resultGenl`
`static SubLObject`	`$const92$termOfUnit`
`static SubLObject`	`$const93$equals`
`static SubLObject`	`$const94$holdsIn`
`static SubLObject`	`$const95$trueSentence`
`static SubLObject`	`$const96$forwardNonTriggerLiteral`
`static SubLObject`	`$const97$evaluate`
`static SubLObject`	`$const99$Kappa`
`static SubLSymbol`	$cyc_const_binary_logical_ops$ used in the syntax checker
`static SubLSymbol`	$cyc_const_bounded_existentials$
`static SubLSymbol`	$cyc_const_exception_operators$ used in the precanonicalizer
`static SubLSymbol`	$cyc_const_metric_tense_operators$
`static SubLSymbol`	$cyc_const_pragmatic_requirement_operators$ used in the precanonicalizer
`static SubLSymbol`	$cyc_const_quaternary_logical_ops$ used in the syntax checker
`static SubLSymbol`	$cyc_const_quintary_logical_ops$ used in the syntax checker
`static SubLSymbol`	$cyc_const_regular_quantifiers$
`static SubLSymbol`	$cyc_const_tense_operators$
`static SubLSymbol`	$cyc_const_ternary_logical_ops$ used in the syntax checker
`static SubLSymbol`	$cyc_const_unary_logical_ops$ used in the syntax checker
`static SubLSymbol`	$cyc_const_variable_arity_logical_ops$ used in the syntax checker
`static SubLSymbol`	`$kw136$POS`
`static SubLSymbol`	`$kw28$IGNORE`
`static SubLSymbol`	`$kw31$INCLUDE`
`static SubLSymbol`	`$kw72$HELLO_YOU_SILLY_COMPILER`
`static SubLSymbol`	`$kw73$REGULARIZE`
`static SubLSymbol`	`$kw74$FALSE`
`static SubLSymbol`	`$kw75$TRUE`
`static SubLList`	`$list11`
`static SubLList`	`$list12`
`static SubLList`	`$list129`
`static SubLList`	`$list130`
`static SubLList`	`$list141`
`static SubLList`	`$list142`
`static SubLList`	`$list41`
`static SubLList`	`$list43`
`static SubLList`	`$list48`
`static SubLList`	`$list53`
`static SubLList`	`$list54`
`static SubLList`	`$list60`
`static SubLList`	`$list63`
`static SubLString`	`$str105$Tried_to_recursively_determine_th`
`static SubLString`	`$str111$termPhrases_CaseInsensitive`
`static SubLString`	`$str115$regexStringMatch_CaseInsensitive`
`static SubLString`	`$str117$_S_is_not_well_formed_`
`static SubLString`	`$str131$You_re_calling_the_function___A__`
`static SubLString`	`$str132$__Replace_all_calls_to_it_with___`
`static SubLString`	`$str133$__Notify__A_if_you_receive_this_w`
`static SubLString`	`$str134$continue_anyway`
`static SubLString`	`$str139$Invalid_attempt_to_reuse_memoizat`
`static SubLString`	`$str37$A_KB_dependent_numerical_quantifi`
`static SubLString`	`$str42$Returns_whether_EXPRESSION_is_fre`
`static SubLString`	`$str49$_1`
`static SubLString`	`$str55$unexpected_subl_escape_type__s`
`static SubLString`	`$str57$not_a_known_quantifier___s`
`static SubLString`	`$str58$not_quantified_sentence___s`
`static SubLSymbol`	`$sym101$RELEVANT_MT_IS_EVERYTHING`
`static SubLSymbol`	`$sym106$VAR_SPEC_`
`static SubLSymbol`	`$sym109$EXPAND_JOIN_LEFT`
`static SubLSymbol`	`$sym110$TRUE_SENTENCE_CASE_INSENSITIVE_EXPANSION`
`static SubLSymbol`	`$sym113$ALPHABETIC_STRING_`
`static SubLSymbol`	`$sym118$DOTTED_LIST_P`
`static SubLSymbol`	`$sym119$SCOPING_RELATION_EXPRESSION_`
`static SubLSymbol`	`$sym120$FORMULA_WITH_SEQUENCE_NON_VAR_`
`static SubLSymbol`	`$sym121$EL_IMPLICATION_P`
`static SubLSymbol`	`$sym122$SCOPING_RELATION_P`
`static SubLSymbol`	`$sym123$CYCL_QUOTED_TERM_P`
`static SubLSymbol`	`$sym124$EXPAND_SUBL_FN_P`
`static SubLSymbol`	`$sym125$FAST_ESCAPE_QUOTE_TERM_P`
`static SubLSymbol`	`$sym126$FORMULA_QUANTIFIED_VARS_INT`
`static SubLSymbol`	`$sym135$EL_VARIABLE_`
`static SubLSymbol`	`$sym140$EQUALS_EL_MEMOIZED_`
`static SubLSymbol`	`$sym29$EL_RELATION_EXPRESSION_`
`static SubLSymbol`	`$sym36$LISTP`
`static SubLSymbol`	`$sym39$CYC_VAR_`
`static SubLSymbol`	`$sym40$GROUND_`
`static SubLSymbol`	`$sym44$EL_FORMULA_P`
`static SubLSymbol`	`$sym45$OPTIMIZE_EL_FORMULA_VARIABLE_NAME`
`static SubLSymbol`	`$sym46$EL_VAR_`
`static SubLSymbol`	`$sym47$EL_SENTENCE_P`
`static SubLSymbol`	`$sym50$INVALID_VARIABLE_NAME_CHAR`
`static SubLSymbol`	`$sym52$SUBL_ESCAPE_P`
`static SubLSymbol`	`$sym56$OPAQUIFY_SUBL_ESCAPE`
`static SubLSymbol`	`$sym59$EL_LIST_P`
`static SubLSymbol`	`$sym61$CDOLIST`
`static SubLSymbol`	`$sym62$EL_LIST_ITEMS`
`static SubLSymbol`	`$sym64$CDOLIST_NUMBERED`
`static SubLSymbol`	`$sym65$EL_SET_P`
`static SubLSymbol`	`$sym66$CONSP`
`static SubLSymbol`	`$sym67$ELF_P`
`static SubLSymbol`	`$sym68$MAKE_EL_FORMULA`
`static SubLSymbol`	`$sym70$LIST_WITHOUT_REPETITION_P`
`static SubLSymbol`	`$sym76$EL_NEGATION_P`
`static SubLSymbol`	`$sym77$ISA_LIT_`
`static SubLSymbol`	`$sym78$TOU_LIT_`
`static SubLSymbol`	`$sym79$EQUALS_LIT_`
`static SubLSymbol`	`$sym80$EVALUATE_LIT_`
`static SubLSymbol`	`$sym81$AB_LIT_`
`static SubLSymbol`	`$sym82$EL_MEETS_PRAGMATIC_REQUIREMENT_P`
`static SubLSymbol`	`$sym98$CYCL_LITERAL_P`
`static SubLFile`	`me`
`static java.lang.String`	`myName`

Fields inherited from class com.cyc.tool.subl.util.SubLTranslatedFile
`EMPTY_SUBL_OBJECT_ARRAY`

Fields inherited from interface com.cyc.tool.subl.jrtl.nativeCode.subLisp.CommonSymbols
ANSWER_TAG, APPEND_KEYWORD, APPEND_STACK_TRACES_TO_ERROR_MESSAGES, AREF, ASSEMBLE_FIXNUMS_TO_INTEGER, ATOM, BIGNUMP, BINARY_KEYWORD, BINDING_TYPE, BOOLEANP, CAAR, CADR, CAND, CAR, CCATCH, CDEC, CDESTRUCTURING_BIND, CDO, CDO_ALL_SYMBOLS, CDO_EXTERNAL_SYMBOLS, CDO_SYMBOLS, CDOHASH, CDOLIST, CDOTIMES, CDR, CHAR, CHAR_E_SYMBOL, CHAR_EQUAL_SYMBOL, CHAR_GREATER_THAN_OR_EQUAL_SYMBOL, CHAR_GREATER_THAN_SYMBOL, CHAR_GT_SYMBOL, CHAR_GTE_SYMBOL, CHAR_LESS_THAN_OR_EQUAL_SYMBOL, CHAR_LESS_THAN_SYMBOL, CHAR_LT_SYMBOL, CHAR_LTE_SYMBOL, CHAR_NE_SYMBOL, CHAR_NOT_EQUAL_SYMBOL, CHARACTERP, CHECK_TYPE, CINC, CLET, CMULTIPLE_VALUE_BIND, CNOT, CONS, CONSP, CONSTANT, COR, CPOP, CPROGV, CPUSH, CPUSHNEW, CREATE_KEYWORD, CSETF, CSETQ, CSOME, CTIME, CUNWIND_PROTECT, CVS_ID, DEBUG_IO, DECLAIM, DECLARE, DEFCONSTANT, DEFINE, DEFLEXICAL, DEFMACRO, DEFPARAMETER, DEFVAR, DIRECTION_KEYWORD, DYNAMIC, EIGHT_INTEGER, EIGHTEEN_INTEGER, ELEMENT_TYPE_KEYWORD, ELEVEN_INTEGER, END_KEYWORD, ENFORCE_MUST, ENFORCE_TYPE, EQ, EQL, EQUAL, EQUALP, ERROR, ERROR_KEYWORD, ERROR_OUTPUT, EVAL, EXTERNAL_FORMAT_KEYWORD, EXTERNAL_KEYWORD, FIF, FIFTEEN_INTEGER, FIRST, FIVE_INTEGER, FIXNUMP, FLOATP, FOUR_INTEGER, FOURTEEN_INTEGER, FUNCTION, FUNCTION_SPEC_P, FUNCTIONP, FUNLESS, FWHEN, GET, GETHASH, GETHASH_WITHOUT_VALUES, GUID_P, HASH_TABLE_ITERATOR_P, HASH_TABLE_P, IDENTITY, IF_DOES_NOT_EXIST_KEYWORD, IF_EXISTS_KEYWORD, IGNORE, INITIALIZATION_TYPE, INITIALIZER, INPUT_KEYWORD, INPUT_STREAM_P, INTEGERP, INTERNAL_KEYWORD, IO_KEYWORD, KEYWORDP, KILL_KEYWORD, LAMBDA_SYMBOL, LEXICAL, LIST, LISTP, LISTS, LOCK_P, LONG_BIGNUM_P, MACRO_ENV, MACRO_FORM, MEDIUM_BIGNUM_P, MEMBER, MINUS_ONE_INTEGER, MULTIPLE_VALUE_LIST, MUST, NCONC, NEW_VERSION_KEYWORD, NIL, NINE_INTEGER, NINETEEN_INTEGER, NREVERSE, NTH, NTH_VALUE, NULL, NULL_INPUT, NULL_OUTPUT, NUM_E_SYMBOL, NUM_GT_SYMBOL, NUM_GTE_SYMBOL, NUM_LT_SYMBOL, NUM_LTE_SYMBOL, NUM_NE_SYMBOL, NUMBERP, ONE_HUNDRED_THIRTY_SEVEN_INTEGER, ONE_HUNDRED_TWENTY_SEVEN_INTEGER, ONE_INTEGER, ONE_THOUSAND_INTEGER, OPTIONAL_SYMBOL, OTHERWISE, OUTPUT_KEYWORD, OUTPUT_STREAM_P, OVERWRITE_KEYWORD, PACKAGEP, PCASE, PCOND, PIF, PROBE_KEYWORD, PROCESS_TO_END, PROCESSP, PROCLAIM, PROGN, PUNLESS, PWHEN, QUERY_IO, QUIT, QUOTE, RENAME_AND_DELETE_KEYWORD, REST_SYMBOL, RET, RET_NIL, RET_T, RETURN_TAG, REVERSE, RW_LOCK_P, SECOND, SEQUENCEP, SEVEN_INTEGER, SEVENTEEN_INTEGER, SHORT_BIGNUM_P, SHOW_STACK_TRACES, SIX_INTEGER, SIXTEEN_INTEGER, SIXTY_FOUR_INTEGER, SORT, SSS, STANDARD_INPUT, STANDARD_OUTPUT, START_KEYWORD, STREAMP, STRING_E_SYMBOL, STRING_EQUAL_SYMBOL, STRING_GREATER_THAN_OR_EQUAL_SYMBOL, STRING_GREATER_THAN_SYMBOL, STRING_GT_SYMBOL, STRING_GTE_SYMBOL, STRING_LESS_THAN_OR_EQUAL_SYMBOL, STRING_LESS_THAN_SYMBOL, STRING_LT_SYMBOL, STRING_LTE_SYMBOL, STRING_NE_SYMBOL, STRING_NOT_EQUAL_SYMBOL, STRINGP, STRUCTURE_P, SUPERSEDE_KEYWORD, SUSPEND_TYPE_CHECKING, SYMBOL_FUNCTION, SYMBOL_VALUE, SYMBOLP, T, TEN_INTEGER, TERMINAL_IO, TEXT_KEYWORD, THIRTEEN_INTEGER, THIRTY_FOUR_INTEGER, THIRTY_THREE_INTEGER, THIRTY_TWO_INTEGER, THREE_INTEGER, TRACE_OUTPUT, TRUE, TWELVE_INTEGER, TWENTY_INTEGER, TWO_HUNDRED_FIFTY_FOUR_INTEGER, TWO_HUNDRED_FORTY_FOUR_INTEGER, TWO_INTEGER, UNDECLARED, UNPROVIDED, VALUES, VECTOR, VECTORP, WITH_ERROR_HANDLER, WITH_STATIC_AREA, WITH_THREAD_PRIVATE_AREA, WITH_WORKING_AREA, WORLD, ZERO_DOUBLE, ZERO_INTEGER

Fields inherited from interface com.cyc.tool.subl.jrtl.nativeCode.subLisp.CommonSymbols

ANSWER_TAG, APPEND_KEYWORD, APPEND_STACK_TRACES_TO_ERROR_MESSAGES, AREF, ASSEMBLE_FIXNUMS_TO_INTEGER, ATOM, BIGNUMP, BINARY_KEYWORD, BINDING_TYPE, BOOLEANP, CAAR, CADR, CAND, CAR, CCATCH, CDEC, CDESTRUCTURING_BIND, CDO, CDO_ALL_SYMBOLS, CDO_EXTERNAL_SYMBOLS, CDO_SYMBOLS, CDOHASH, CDOLIST, CDOTIMES, CDR, CHAR, CHAR_E_SYMBOL, CHAR_EQUAL_SYMBOL, CHAR_GREATER_THAN_OR_EQUAL_SYMBOL, CHAR_GREATER_THAN_SYMBOL, CHAR_GT_SYMBOL, CHAR_GTE_SYMBOL, CHAR_LESS_THAN_OR_EQUAL_SYMBOL, CHAR_LESS_THAN_SYMBOL, CHAR_LT_SYMBOL, CHAR_LTE_SYMBOL, CHAR_NE_SYMBOL, CHAR_NOT_EQUAL_SYMBOL, CHARACTERP, CHECK_TYPE, CINC, CLET, CMULTIPLE_VALUE_BIND, CNOT, CONS, CONSP, CONSTANT, COR, CPOP, CPROGV, CPUSH, CPUSHNEW, CREATE_KEYWORD, CSETF, CSETQ, CSOME, CTIME, CUNWIND_PROTECT, CVS_ID, DEBUG_IO, DECLAIM, DECLARE, DEFCONSTANT, DEFINE, DEFLEXICAL, DEFMACRO, DEFPARAMETER, DEFVAR, DIRECTION_KEYWORD, DYNAMIC, EIGHT_INTEGER, EIGHTEEN_INTEGER, ELEMENT_TYPE_KEYWORD, ELEVEN_INTEGER, END_KEYWORD, ENFORCE_MUST, ENFORCE_TYPE, EQ, EQL, EQUAL, EQUALP, ERROR, ERROR_KEYWORD, ERROR_OUTPUT, EVAL, EXTERNAL_FORMAT_KEYWORD, EXTERNAL_KEYWORD, FIF, FIFTEEN_INTEGER, FIRST, FIVE_INTEGER, FIXNUMP, FLOATP, FOUR_INTEGER, FOURTEEN_INTEGER, FUNCTION, FUNCTION_SPEC_P, FUNCTIONP, FUNLESS, FWHEN, GET, GETHASH, GETHASH_WITHOUT_VALUES, GUID_P, HASH_TABLE_ITERATOR_P, HASH_TABLE_P, IDENTITY, IF_DOES_NOT_EXIST_KEYWORD, IF_EXISTS_KEYWORD, IGNORE, INITIALIZATION_TYPE, INITIALIZER, INPUT_KEYWORD, INPUT_STREAM_P, INTEGERP, INTERNAL_KEYWORD, IO_KEYWORD, KEYWORDP, KILL_KEYWORD, LAMBDA_SYMBOL, LEXICAL, LIST, LISTP, LISTS, LOCK_P, LONG_BIGNUM_P, MACRO_ENV, MACRO_FORM, MEDIUM_BIGNUM_P, MEMBER, MINUS_ONE_INTEGER, MULTIPLE_VALUE_LIST, MUST, NCONC, NEW_VERSION_KEYWORD, NIL, NINE_INTEGER, NINETEEN_INTEGER, NREVERSE, NTH, NTH_VALUE, NULL, NULL_INPUT, NULL_OUTPUT, NUM_E_SYMBOL, NUM_GT_SYMBOL, NUM_GTE_SYMBOL, NUM_LT_SYMBOL, NUM_LTE_SYMBOL, NUM_NE_SYMBOL, NUMBERP, ONE_HUNDRED_THIRTY_SEVEN_INTEGER, ONE_HUNDRED_TWENTY_SEVEN_INTEGER, ONE_INTEGER, ONE_THOUSAND_INTEGER, OPTIONAL_SYMBOL, OTHERWISE, OUTPUT_KEYWORD, OUTPUT_STREAM_P, OVERWRITE_KEYWORD, PACKAGEP, PCASE, PCOND, PIF, PROBE_KEYWORD, PROCESS_TO_END, PROCESSP, PROCLAIM, PROGN, PUNLESS, PWHEN, QUERY_IO, QUIT, QUOTE, RENAME_AND_DELETE_KEYWORD, REST_SYMBOL, RET, RET_NIL, RET_T, RETURN_TAG, REVERSE, RW_LOCK_P, SECOND, SEQUENCEP, SEVEN_INTEGER, SEVENTEEN_INTEGER, SHORT_BIGNUM_P, SHOW_STACK_TRACES, SIX_INTEGER, SIXTEEN_INTEGER, SIXTY_FOUR_INTEGER, SORT, SSS, STANDARD_INPUT, STANDARD_OUTPUT, START_KEYWORD, STREAMP, STRING_E_SYMBOL, STRING_EQUAL_SYMBOL, STRING_GREATER_THAN_OR_EQUAL_SYMBOL, STRING_GREATER_THAN_SYMBOL, STRING_GT_SYMBOL, STRING_GTE_SYMBOL, STRING_LESS_THAN_OR_EQUAL_SYMBOL, STRING_LESS_THAN_SYMBOL, STRING_LT_SYMBOL, STRING_LTE_SYMBOL, STRING_NE_SYMBOL, STRING_NOT_EQUAL_SYMBOL, STRINGP, STRUCTURE_P, SUPERSEDE_KEYWORD, SUSPEND_TYPE_CHECKING, SYMBOL_FUNCTION, SYMBOL_VALUE, SYMBOLP, T, TEN_INTEGER, TERMINAL_IO, TEXT_KEYWORD, THIRTEEN_INTEGER, THIRTY_FOUR_INTEGER, THIRTY_THREE_INTEGER, THIRTY_TWO_INTEGER, THREE_INTEGER, TRACE_OUTPUT, TRUE, TWELVE_INTEGER, TWENTY_INTEGER, TWO_HUNDRED_FIFTY_FOUR_INTEGER, TWO_HUNDRED_FORTY_FOUR_INTEGER, TWO_INTEGER, UNDECLARED, UNPROVIDED, VALUES, VECTOR, VECTORP, WITH_ERROR_HANDLER, WITH_STATIC_AREA, WITH_THREAD_PRIVATE_AREA, WITH_WORKING_AREA, WORLD, ZERO_DOUBLE, ZERO_INTEGER

Method Summary
`static SubLObject`	`arg_types_prescribe_tacit_term_listP(SubLObject rel, SubLObject pos)` Do the arg-types applicable to arg of relation require the arg to be a SubL list? Note that SubL lists are deprecated except for special cases in the CycL grammar itself.
`static SubLObject`	`arg_types_prescribe_unreifiedP(SubLObject rel, SubLObject pos)` do the arg-types applicable to arg of relation require the arg to be an unreified function?
`static SubLObject`	`asent_and_sense_to_literal(SubLObject asent, SubLObject sense)`
`static SubLObject`	`asent_and_truth_to_literal(SubLObject asent, SubLObject truth)`
`static SubLObject`	`atomic_sentenceP(SubLObject object)`
`static SubLObject`	`binary_lit_p(SubLObject literal)`
`static SubLObject`	`closedP(SubLObject expression, SubLObject varP)` is EXPRESSION free of any free variables? (includes ground? check for efficiency)
`static SubLObject`	`contains_subformula_p(SubLObject object)`
`static SubLObject`	`copy_clause(SubLObject clause)` Returns a copy of CLAUSE.
`static SubLObject`	`copy_expression(SubLObject expression)` Returns a copy of EXPRESSION.
`static SubLObject`	`copy_formula(SubLObject formula)` Returns a copy of the EL formula FORMULA.
`static SubLObject`	`copy_sentence(SubLObject sentence)` Returns a copy of the EL sentence SENTENCE
`static SubLObject`	`cyc_const_binary_logical_op_p(SubLObject object)`
`static SubLObject`	`cyc_const_bounded_existential_operator_p(SubLObject object)`
`static SubLObject`	`cyc_const_exception_operator_p(SubLObject object)`
`static SubLObject`	`cyc_const_existential_p(SubLObject object)`
`static SubLObject`	`cyc_const_general_existential_operator_p(SubLObject object)`
`static SubLObject`	`cyc_const_general_implication_operator_p(SubLObject object)` Return T iff OBJECT is a Cyc EL implication operator (#$implies or #$equiv).
`static SubLObject`	`cyc_const_generalized_tense_operator_p(SubLObject object)`
`static SubLObject`	`cyc_const_logical_operator_p(SubLObject object)`
`static SubLObject`	`cyc_const_metric_tense_operator_p(SubLObject object)`
`static SubLObject`	`cyc_const_pragmatic_requirement_operator_p(SubLObject object)`
`static SubLObject`	`cyc_const_quantifier_p(SubLObject object)`
`static SubLObject`	`cyc_const_quaternary_logical_op_p(SubLObject object)`
`static SubLObject`	`cyc_const_quintary_logical_op_p(SubLObject object)`
`static SubLObject`	`cyc_const_regular_quantifier_p(SubLObject object)`
`static SubLObject`	`cyc_const_sentential_relation_p(SubLObject object)`
`static SubLObject`	`cyc_const_tense_operator_p(SubLObject object)`
`static SubLObject`	`cyc_const_ternary_logical_op_p(SubLObject object)`
`static SubLObject`	`cyc_const_unary_logical_op_p(SubLObject object)`
`static SubLObject`	`cyc_const_universal_p(SubLObject object)`
`static SubLObject`	`cyc_const_variable_arity_logical_op_p(SubLObject object)`
`static SubLObject`	`cycl_subl_symbol_symbol(SubLObject object)` When OBJECT is a cycl-subl-symbol-p, returns the SubL symbol part.
`static SubLObject`	`cycl_universal_p(SubLObject object)` Like @xref el-universal-p but admits more terms as variables, e.g.
`static SubLObject`	`declare_el_utilities_file()`
`void`	`declareFunctions()` Declares the mapping between functions and symbols for all named functions defined in the file.
`static SubLObject`	`designated_mt(SubLObject literal)`
`static SubLObject`	`designated_sentence(SubLObject literal)`
`static SubLObject`	`el_atomic_sentenceP(SubLObject formula)`
`static SubLObject`	`el_binary_formula_p(SubLObject object)`
`static SubLObject`	`el_bounded_existential_p(SubLObject object)`
`static SubLObject`	`el_conjunction_p(SubLObject object)`
`static SubLObject`	`el_disjunction_p(SubLObject object)`
`static SubLObject`	`el_empty_list_p(SubLObject obj)`
`static SubLObject`	`el_empty_set_p(SubLObject object)`
`static SubLObject`	`el_error(SubLObject level, SubLObject format_str, SubLObject arg1, SubLObject arg2, SubLObject arg3)`
`static SubLObject`	`el_exception_p(SubLObject object)` Assumes that all exception operators are binary.
`static SubLObject`	`el_existential_exact_p(SubLObject object)`
`static SubLObject`	`el_existential_max_p(SubLObject object)`
`static SubLObject`	`el_existential_min_p(SubLObject object)`
`static SubLObject`	`el_existential_p(SubLObject object)`
`static SubLObject`	`el_extensional_set_p(SubLObject object)`
`static SubLObject`	`el_formula_arityGE(SubLObject el_formula, SubLObject v_arity, SubLObject seqvar_handling)`
`static SubLObject`	`el_formula_p(SubLObject object)`
`static SubLObject`	`el_formula_with_operator_p(SubLObject formula, SubLObject operator)`
`static SubLObject`	`el_formula_without_sequence_termP(SubLObject formula)`
`static SubLObject`	`el_formulaP(SubLObject formula)`
`static SubLObject`	`el_general_implication_p(SubLObject object)`
`static SubLObject`	`el_implication_p(SubLObject object)`
`static SubLObject`	`el_implicit_meta_literal_sentence_p(SubLObject object)`
`static SubLObject`	`el_logical_operator_formula_p(SubLObject object)`
`static SubLObject`	`el_meets_pragmatic_requirement_p(SubLObject object)` Assumes that #$meetsPragmaticRequirement is a binary operator.
`static SubLObject`	`el_negation_p(SubLObject object)`
`static SubLObject`	`el_negative_sentences(SubLObject sentences)` Returns all the negations in SENTENCES, which is a list of EL sentences.
`static SubLObject`	`el_non_atomic_sentenceP(SubLObject formula)`
`static SubLObject`	`el_non_empty_set_p(SubLObject object)`
`static SubLObject`	`el_positive_sentences(SubLObject sentences)` Returns all the sentences in SENTENCES that are not negations.
`static SubLObject`	`el_pragmatic_requirement_p(SubLObject object)`
`static SubLObject`	`el_relation_expressionP(SubLObject object)`
`static SubLObject`	`el_sequence_p(SubLObject object)`
`static SubLObject`	`el_unary_formula_p(SubLObject object)`
`static SubLObject`	`el_universal_p(SubLObject object)`
`static SubLObject`	`elf_p(SubLObject object)`
`static SubLObject`	`epsilon_p(SubLObject object)`
`static SubLObject`	`evaluate_litP(SubLObject literal, SubLObject varP)`
`static SubLObject`	`expand_subl_fn_p(SubLObject object)`
`static SubLObject`	`expression_arity(SubLObject relational_expression, SubLObject seqvar_handling)`
`static SubLObject`	`first_in_sequence(SubLObject sequence)` returns the first element of SEQUENCE.
`static SubLObject`	`formula_arity(SubLObject formula, SubLObject seqvar_handling)` returns the arity of FORMULA (the number of arguments).
`static SubLObject`	`formula_arityE(SubLObject formula, SubLObject v_arity, SubLObject seqvar_handling)`
`static SubLObject`	`formula_arityG(SubLObject formula, SubLObject v_arity, SubLObject seqvar_handling)`
`static SubLObject`	`formula_arityGE(SubLObject formula, SubLObject v_arity, SubLObject seqvar_handling)`
`static SubLObject`	`formula_arityL(SubLObject formula, SubLObject v_arity, SubLObject seqvar_handling)`
`static SubLObject`	`formula_denoting_collectionP(SubLObject collection)`
`static SubLObject`	`formula_length(SubLObject formula, SubLObject seqvar_handling)`
`static SubLObject`	`formula_non_var_symbols(SubLObject formula, SubLObject varP)`
`static SubLObject`	`formula_with_sequence_non_varP(SubLObject formula)`
`static SubLObject`	`formula_with_sequence_termP(SubLObject formula)`
`static SubLObject`	`formula_with_sequence_varP(SubLObject formula)`
`static SubLObject`	`forward_non_trigger_literal_litP(SubLObject literal)`
`static SubLObject`	`funcall_formula_arg(SubLObject function, SubLObject formula, SubLObject argnum)` Calls FUNCTION on the ARGNUMth arg of FORMULA, unless that arg position is opaque.
`static SubLObject`	`function_specP(SubLObject v_term, SubLObject var_func)`
`static SubLObject`	`genls_litP(SubLObject lit)`
`static SubLObject`	`groundP(SubLObject expression, SubLObject varP)` Returns whether EXPRESSION is free of any variables?
`static SubLObject`	`hl_ground_tree_p(SubLObject tree)`
`static SubLObject`	`hl_relation_expressionP(SubLObject object)`
`static SubLObject`	`holds_in_litP(SubLObject literal)`
`static SubLObject`	`ignore_sequence_vars(SubLObject formula)` e.g.
`static SubLObject`	`init_el_utilities_file()`
`void`	`initializeVariables()` Initializes all global variables and private internal variables for constants defined in the file.
`static SubLObject`	`isa_hl_var_hl_var_litP(SubLObject lit)`
`static SubLObject`	`isa_litP(SubLObject lit)`
`static SubLObject`	`ist_of_atomic_sentence_int(SubLObject sentence, SubLObject pred)`
`static SubLObject`	`ist_of_atomic_sentence_p(SubLObject sentence)`
`static SubLObject`	`ist_sentence_p(SubLObject sentence)`
`static SubLObject`	`ist_sentence_with_chlmt_p(SubLObject sentence)`
`static SubLObject`	`kappa_asent_p(SubLObject object)`
`static SubLObject`	`kappa_predicate_p(SubLObject object)`
`static SubLObject`	`lambda_function_p(SubLObject object)`
`static SubLObject`	`list_to_elf(SubLObject list)` Returns an EL formula constructed from the list LIST.
`static SubLObject`	`literal_arg(SubLObject literal, SubLObject argnum, SubLObject seqvar_handling)` returns the ARGNUMth argument of LITERAL.
`static SubLObject`	`literal_arg0(SubLObject literal, SubLObject seqvar_handling)` Returns the 0th argument (the predicate) of LITERAL.
`static SubLObject`	`literal_arg1(SubLObject literal, SubLObject seqvar_handling)` Returns the 1st argument of LITERAL.
`static SubLObject`	`literal_arg2(SubLObject literal, SubLObject seqvar_handling)` Returns the 2nd argument of LITERAL.
`static SubLObject`	`literal_args(SubLObject literal, SubLObject seqvar_handling)` Returns the arguments of LITERAL.
`static SubLObject`	`literal_arity(SubLObject literal, SubLObject seqvar_handling)` returns the arity of a literal (the number of arguments).
`static SubLObject`	`literal_atomic_sentence(SubLObject literal)` Returns the atomic formula within LITERAL.
`static SubLObject`	`literal_free_sequence_variables(SubLObject literal, SubLObject old_bound_vars, SubLObject varP)`
`static SubLObject`	`literal_free_variables(SubLObject literal, SubLObject old_bound_vars, SubLObject varP, SubLObject include_sequence_varsP)`
`static SubLObject`	`literal_predicate(SubLObject literal, SubLObject seqvar_handling)` Returns the predicate (the 0th argument) of LITERAL.
`static SubLObject`	`literal_sense(SubLObject literal)`
`static SubLObject`	`literal_truth(SubLObject literal)`
`static SubLObject`	`literal_variables(SubLObject relation, SubLObject varP, SubLObject include_sequence_varsP)`
`static SubLObject`	`literals_free_variables(SubLObject literals, SubLObject bound_vars, SubLObject varP, SubLObject include_sequence_varsP)`
`static SubLObject`	`make_binary_formula(SubLObject operator, SubLObject arg1, SubLObject arg2)` returns a new binary formula with the operator OPERATOR and the two arguments ARG1 and ARG2.
`static SubLObject`	`make_conjunction(SubLObject args)` returns a new conjunction.
`static SubLObject`	`make_disjunction(SubLObject args)` returns a new disjunction.
`static SubLObject`	`make_el_formula(SubLObject operator, SubLObject args, SubLObject sequence_var)` returns a new EL formula with the operator OPERATOR, the arguments ARGS, and the optional sequence variable SEQUENCE-VAR.
`static SubLObject`	`make_el_literal(SubLObject predicate, SubLObject args, SubLObject sequence_var)` returns a new EL sentence with the operator PREDICATE and the arguments ARGS.
`static SubLObject`	`make_formula(SubLObject operator, SubLObject args, SubLObject sequence_var)` returns a new EL formula with the operator OPERATOR, the arguments ARGS, and the optional sequence variable SEQUENCE-VAR.
`static SubLObject`	`make_ist_sentence(SubLObject mt, SubLObject sentence)`
`static SubLObject`	`make_negation(SubLObject sentence)` returns the negation of SENTENCE.
`static SubLObject`	`make_regularly_quantified_sentence(SubLObject quantifier, SubLObject var, SubLObject subsent)`
`static SubLObject`	`make_ternary_formula(SubLObject operator, SubLObject arg1, SubLObject arg2, SubLObject arg3)` returns a new ternary formula with the operator OPERATOR and the three arguments ARG1, ARG2, and ARG3.
`static SubLObject`	`make_unary_formula(SubLObject operator, SubLObject arg)` returns a new unary formula with the operator OPERATOR and the single argument ARG.
`static SubLObject`	`make_universal(SubLObject var, SubLObject sentence)` returns a new universally quantified sentence of the form (#$forAll `).`
`static SubLObject`	`map_formula_args(SubLObject func, SubLObject formula, SubLObject map_seqvarP)` Execute FUNC on each argument (in order) of FORMULA, unless it is an opaque argument.
`static SubLObject`	`maybe_add_sequence_var_to_end(SubLObject seqvar, SubLObject formula)`
`static SubLObject`	`mt_designating_literalP(SubLObject literal)`
`static SubLObject`	`mt_designation_argnum(SubLObject literal)`
`static SubLObject`	`naut_free_sequence_variables(SubLObject naut, SubLObject old_bound_vars, SubLObject varP)`
`static SubLObject`	`nmap_formula_args(SubLObject func, SubLObject formula, SubLObject map_seqvarP)` A destructive version of @xref map-formula-args.
`static SubLObject`	`nmap_formula_terms(SubLObject func, SubLObject formula, SubLObject map_seqvarP)` A destructive version of @xref map-formula-terms.
`static SubLObject`	`no_free_variablesP(SubLObject expression, SubLObject varP)` is EXPRESSION free of any free variables? (excludes ground? check for efficiency)
`static SubLObject`	`nreplace_formula_arg(SubLObject argnum, SubLObject new_arg, SubLObject formula)` Replaces the ARGNUMth argument of FORMULA with NEW-ARG.
`static SubLObject`	`occurs_as_sequence_variableP(SubLObject var, SubLObject sentence)`
`static SubLObject`	`pass_through_if_bounded_existential(SubLObject function, SubLObject formula)`
`static SubLObject`	`pass_through_if_conjunction(SubLObject function, SubLObject formula)`
`static SubLObject`	`pass_through_if_disjunction(SubLObject function, SubLObject formula)`
`static SubLObject`	`pass_through_if_junction(SubLObject function, SubLObject formula)`
`static SubLObject`	`pass_through_if_logical_op_or_quantified(SubLObject function, SubLObject formula)`
`static SubLObject`	`pass_through_if_logical_op(SubLObject function, SubLObject formula)`
`static SubLObject`	`pass_through_if_negation(SubLObject function, SubLObject formula)`
`static SubLObject`	`pass_through_if_quantified(SubLObject function, SubLObject formula)`
`static SubLObject`	`pass_through_if_regularly_quantified(SubLObject function, SubLObject formula)`
`static SubLObject`	`pass_through_if_relation_syntax(SubLObject function, SubLObject formula)`
`static SubLObject`	`possibly_atomic_sentence_p(SubLObject object)` A quick test for whether OBJECT could possibly be an atomic CycL sentence.
`static SubLObject`	`possibly_el_quantified_sentence_p(SubLObject object)`
`static SubLObject`	`possibly_el_regularly_quantified_sentence_p(SubLObject object)`
`static SubLObject`	`possibly_fo_naut_p(SubLObject object)` A quick test for whether OBJECT could possibly be a first order naut.
`static SubLObject`	`possibly_formula_with_sequence_variablesP(SubLObject formula)` Return T iff FORMULA might have a sequence variable.
`static SubLObject`	`possibly_naut_p(SubLObject object)` A quick test for whether OBJECT could possibly be a naut.
`static SubLObject`	`possibly_sentence_p(SubLObject object)` A quick test for whether OBJECT could possibly be a CycL sentence.
`static SubLObject`	`pred_litP(SubLObject literal, SubLObject pred)`
`static SubLObject`	`predicate_specP(SubLObject v_term, SubLObject var_func)`
`static SubLObject`	`quantified_sub_sentence_argnum_for_operator(SubLObject operator)`
`static SubLObject`	`quantified_sub_sentence_argnum(SubLObject sentence)`
`static SubLObject`	`quantified_sub_sentence(SubLObject sentence)` returns the quantified subsentence in a quantified sentence.
`static SubLObject`	`quantified_var(SubLObject sentence)` returns the quantified variable in a quantified sentence.
`static SubLObject`	`quoted_isa_litP(SubLObject lit)`
`static SubLObject`	`referenced_variables(SubLObject formula, SubLObject varP)`
`static SubLObject`	`relation_expressionP(SubLObject object)`
`static SubLObject`	`relation_free_sequence_variables(SubLObject relation, SubLObject old_bound_vars, SubLObject varP)`
`static SubLObject`	`relation_free_variables(SubLObject relation, SubLObject old_bound_vars, SubLObject varP, SubLObject include_sequence_varsP)`
`static SubLObject`	`relation_variables(SubLObject literal, SubLObject varP, SubLObject include_sequence_varsP)`
`static SubLObject`	`replace_formula_arg(SubLObject argnum, SubLObject new_arg, SubLObject formula)` Replaces the ARGNUMth argument of FORMULA with NEW-ARG.
`static SubLObject`	`rest_of_sequence(SubLObject sequence)` returns (as a list or a variable) all elements but the first of SEQUENCE
`void`	`runTopLevelForms()` Runs all top-level forms in order.
`static SubLObject`	`scoped_vars(SubLObject formula, SubLObject varP)`
`static SubLObject`	`scoping_relation_expressionP(SubLObject expression)`
`static SubLObject`	`sentence_denoting_collectionP(SubLObject collection)`
`static SubLObject`	`sentence_designation_argnum(SubLObject literal)`
`static SubLObject`	`sentence_free_sequence_variables(SubLObject sentence, SubLObject bound_vars, SubLObject varP)` Returns the free variables in SENTENCE that occur as sequence variables.
`static SubLObject`	`sentence_free_term_variables(SubLObject formula, SubLObject bound_vars, SubLObject varP)` Returns the free variables in FORMULA that occur as term variables (the counterpart of sequence variables).
`static SubLObject`	`sentence_free_variables_int(SubLObject sentence, SubLObject bound_vars, SubLObject var_func, SubLObject include_sequence_varsP)`
`static SubLObject`	`sentence_free_variables(SubLObject sentence, SubLObject bound_vars, SubLObject var_func, SubLObject include_sequence_varsP)`
`static SubLObject`	`sentence_quantifier(SubLObject sentence)` If SENTENCE is a quantified sentence, returns the quantifier.
`static SubLObject`	`sentence_sequence_variables(SubLObject formula, SubLObject varP)`
`static SubLObject`	`sequence_non_var(SubLObject relation, SubLObject varP)` Returns the part of RELATION that should be a sequence variable by its syntax, but isn't.
`static SubLObject`	`sequence_term(SubLObject formula)` Returns the sequence term in FORMULA, if there is one.
`static SubLObject`	`sequence_var(SubLObject relation, SubLObject varP)` Returns the sequence variable in RELATION, if there is one.
`static SubLObject`	`setup_el_utilities_file()`
`static SubLObject`	`subl_escape_p(SubLObject object)`
`static SubLObject`	`subl_quote_p(SubLObject object)`
`static SubLObject`	`term_is_one_of_argsP(SubLObject v_term, SubLObject formula)`
`static SubLObject`	`tou_asentP(SubLObject asent)`
`static SubLObject`	`tou_litP(SubLObject lit)`
`static SubLObject`	`true_sentence_litP(SubLObject literal)`
`static SubLObject`	`true_sentence_of_atomic_sentence_p(SubLObject sentence)`
`static SubLObject`	`true_sentence_p(SubLObject sentence)`
`static SubLObject`	`unary_lit_p(SubLObject literal)`
`static SubLObject`	`unmake_binary_formula(SubLObject formula)` Assumes that FORMULA is a binary formula.
`static SubLObject`	`unmake_ternary_formula(SubLObject formula)` Assumes that FORMULA is a ternary formula.
`static SubLObject`	`user_defined_bounded_existential_operator_p(SubLObject object)`
`static SubLObject`	`user_defined_logical_operator_p(SubLObject object)`
`static SubLObject`	`valid_argnum_p(SubLObject arg)`
`static SubLObject`	`valid_arity_p(SubLObject v_arity)`
`static SubLObject`	`wf_wrt_sequence_varsP(SubLObject formula)`

Methods inherited from class com.cyc.tool.subl.util.SubLTranslatedFile
`extractFunctionNamed`

Methods inherited from class com.cyc.tool.subl.util.SubLTrampolineFile
`checkType, enforceType, extractBinaryFunc, extractCount, extractEnd, extractEndUsingSize, extractPackage, extractStart, extractUnaryFunc, main`

Methods inherited from class java.lang.Object
`equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait`

Field Detail

me

public static final SubLFile me

myName

public static final java.lang.String myName

See Also:: Constant Field Values

$cyc_const_unary_logical_ops$

public static SubLSymbol $cyc_const_unary_logical_ops$

used in the syntax checker

$cyc_const_binary_logical_ops$

public static SubLSymbol $cyc_const_binary_logical_ops$

used in the syntax checker

$cyc_const_ternary_logical_ops$

public static SubLSymbol $cyc_const_ternary_logical_ops$

used in the syntax checker

$cyc_const_quaternary_logical_ops$

public static SubLSymbol $cyc_const_quaternary_logical_ops$

used in the syntax checker

$cyc_const_quintary_logical_ops$

public static SubLSymbol $cyc_const_quintary_logical_ops$

used in the syntax checker

$cyc_const_variable_arity_logical_ops$

public static SubLSymbol $cyc_const_variable_arity_logical_ops$

used in the syntax checker

$cyc_const_regular_quantifiers$

public static SubLSymbol $cyc_const_regular_quantifiers$

$cyc_const_bounded_existentials$

public static SubLSymbol $cyc_const_bounded_existentials$

$cyc_const_tense_operators$

public static SubLSymbol $cyc_const_tense_operators$

$cyc_const_metric_tense_operators$

public static SubLSymbol $cyc_const_metric_tense_operators$

$cyc_const_exception_operators$

public static SubLSymbol $cyc_const_exception_operators$

used in the precanonicalizer

$cyc_const_pragmatic_requirement_operators$

public static SubLSymbol $cyc_const_pragmatic_requirement_operators$

used in the precanonicalizer

$const0$not

public static final SubLObject $const0$not

$const1$or

public static final SubLObject $const1$or

$const2$and

public static final SubLObject $const2$and

$const3$implies

public static final SubLObject $const3$implies

$const4$equiv

public static final SubLObject $const4$equiv

$const5$xor

public static final SubLObject $const5$xor

$const6$forAll

public static final SubLObject $const6$forAll

$const7$thereExists

public static final SubLObject $const7$thereExists

$const8$thereExistAtLeast

public static final SubLObject $const8$thereExistAtLeast

$const9$thereExistAtMost

public static final SubLObject $const9$thereExistAtMost

$const10$thereExistExactly

public static final SubLObject $const10$thereExistExactly

$list11

public static final SubLList $list11

$list12

public static final SubLList $list12

$const13$was

public static final SubLObject $const13$was

$const14$hasAlwaysBeen

public static final SubLObject $const14$hasAlwaysBeen

$const15$willBe

public static final SubLObject $const15$willBe

$const16$willAlwaysBe

public static final SubLObject $const16$willAlwaysBe

$const17$was_Metric

public static final SubLObject $const17$was_Metric

$const18$willBe_Metric

public static final SubLObject $const18$willBe_Metric

$const19$ExpandSubLFn

public static final SubLObject $const19$ExpandSubLFn

$const20$SubLQuoteFn

public static final SubLObject $const20$SubLQuoteFn

$const21$Quote

public static final SubLObject $const21$Quote

$const22$exceptFor

public static final SubLObject $const22$exceptFor

$const23$exceptWhen

public static final SubLObject $const23$exceptWhen

$const24$abnormal

public static final SubLObject $const24$abnormal

$const25$pragmaticRequirement

public static final SubLObject $const25$pragmaticRequirement

$const26$meetsPragmaticRequirement

public static final SubLObject $const26$meetsPragmaticRequirement

$const27$querySentence

public static final SubLObject $const27$querySentence

$kw28$IGNORE

public static final SubLSymbol $kw28$IGNORE

$sym29$EL_RELATION_EXPRESSION_

public static final SubLSymbol $sym29$EL_RELATION_EXPRESSION_

$const30$TheList

public static final SubLObject $const30$TheList

$kw31$INCLUDE

public static final SubLSymbol $kw31$INCLUDE

$const32$TheEmptyList

public static final SubLObject $const32$TheEmptyList

$const33$TheEmptySet

public static final SubLObject $const33$TheEmptySet

$const34$TheSet

public static final SubLObject $const34$TheSet

$const35$TheSetOf

public static final SubLObject $const35$TheSetOf

$sym36$LISTP

public static final SubLSymbol $sym36$LISTP

$str37$A_KB_dependent_numerical_quantifi

public static final SubLString $str37$A_KB_dependent_numerical_quantifi

$const38$SpecsFn

public static final SubLObject $const38$SpecsFn

$sym39$CYC_VAR_

public static final SubLSymbol $sym39$CYC_VAR_

$sym40$GROUND_

public static final SubLSymbol $sym40$GROUND_

$list41

public static final SubLList $list41

$str42$Returns_whether_EXPRESSION_is_fre

public static final SubLString $str42$Returns_whether_EXPRESSION_is_fre

$list43

public static final SubLList $list43

$sym44$EL_FORMULA_P

public static final SubLSymbol $sym44$EL_FORMULA_P

$sym45$OPTIMIZE_EL_FORMULA_VARIABLE_NAME

public static final SubLSymbol $sym45$OPTIMIZE_EL_FORMULA_VARIABLE_NAME

$sym46$EL_VAR_

public static final SubLSymbol $sym46$EL_VAR_

$sym47$EL_SENTENCE_P

public static final SubLSymbol $sym47$EL_SENTENCE_P

$list48

public static final SubLList $list48

$str49$_1

public static final SubLString $str49$_1

$sym50$INVALID_VARIABLE_NAME_CHAR

public static final SubLSymbol $sym50$INVALID_VARIABLE_NAME_CHAR

$const51$ExistentialQuantifier

public static final SubLObject $const51$ExistentialQuantifier

$sym52$SUBL_ESCAPE_P

public static final SubLSymbol $sym52$SUBL_ESCAPE_P

$list53

public static final SubLList $list53

$list54

public static final SubLList $list54

$str55$unexpected_subl_escape_type__s

public static final SubLString $str55$unexpected_subl_escape_type__s

$sym56$OPAQUIFY_SUBL_ESCAPE

public static final SubLSymbol $sym56$OPAQUIFY_SUBL_ESCAPE

$str57$not_a_known_quantifier___s

public static final SubLString $str57$not_a_known_quantifier___s

$str58$not_quantified_sentence___s

public static final SubLString $str58$not_quantified_sentence___s

$sym59$EL_LIST_P

public static final SubLSymbol $sym59$EL_LIST_P

$list60

public static final SubLList $list60

$sym61$CDOLIST

public static final SubLSymbol $sym61$CDOLIST

$sym62$EL_LIST_ITEMS

public static final SubLSymbol $sym62$EL_LIST_ITEMS

$list63

public static final SubLList $list63

$sym64$CDOLIST_NUMBERED

public static final SubLSymbol $sym64$CDOLIST_NUMBERED

$sym65$EL_SET_P

public static final SubLSymbol $sym65$EL_SET_P

$sym66$CONSP

public static final SubLSymbol $sym66$CONSP

$sym67$ELF_P

public static final SubLSymbol $sym67$ELF_P

$sym68$MAKE_EL_FORMULA

public static final SubLSymbol $sym68$MAKE_EL_FORMULA

$const69$ist

public static final SubLObject $const69$ist

$sym70$LIST_WITHOUT_REPETITION_P

public static final SubLSymbol $sym70$LIST_WITHOUT_REPETITION_P

$const71$InstanceNamedFn

public static final SubLObject $const71$InstanceNamedFn

$kw72$HELLO_YOU_SILLY_COMPILER

public static final SubLSymbol $kw72$HELLO_YOU_SILLY_COMPILER

$kw73$REGULARIZE

public static final SubLSymbol $kw73$REGULARIZE

$kw74$FALSE

public static final SubLSymbol $kw74$FALSE

$kw75$TRUE

public static final SubLSymbol $kw75$TRUE

$sym76$EL_NEGATION_P

public static final SubLSymbol $sym76$EL_NEGATION_P

$sym77$ISA_LIT_

public static final SubLSymbol $sym77$ISA_LIT_

$sym78$TOU_LIT_

public static final SubLSymbol $sym78$TOU_LIT_

$sym79$EQUALS_LIT_

public static final SubLSymbol $sym79$EQUALS_LIT_

$sym80$EVALUATE_LIT_

public static final SubLSymbol $sym80$EVALUATE_LIT_

$sym81$AB_LIT_

public static final SubLSymbol $sym81$AB_LIT_

$sym82$EL_MEETS_PRAGMATIC_REQUIREMENT_P

public static final SubLSymbol $sym82$EL_MEETS_PRAGMATIC_REQUIREMENT_P

$const83$isa

public static final SubLObject $const83$isa

$const84$Thing

public static final SubLObject $const84$Thing

$const85$quotedIsa

public static final SubLObject $const85$quotedIsa

$const86$genls

public static final SubLObject $const86$genls

$const87$genlPreds

public static final SubLObject $const87$genlPreds

$const88$genlInverse

public static final SubLObject $const88$genlInverse

$const89$genlMt

public static final SubLObject $const89$genlMt

$const90$resultIsa

public static final SubLObject $const90$resultIsa

$const91$resultGenl

public static final SubLObject $const91$resultGenl

$const92$termOfUnit

public static final SubLObject $const92$termOfUnit

$const93$equals

public static final SubLObject $const93$equals

$const94$holdsIn

public static final SubLObject $const94$holdsIn

$const95$trueSentence

public static final SubLObject $const95$trueSentence

$const96$forwardNonTriggerLiteral

public static final SubLObject $const96$forwardNonTriggerLiteral

$const97$evaluate

public static final SubLObject $const97$evaluate

$sym98$CYCL_LITERAL_P

public static final SubLSymbol $sym98$CYCL_LITERAL_P

$const99$Kappa

public static final SubLObject $const99$Kappa

$const100$Lambda

public static final SubLObject $const100$Lambda

$sym101$RELEVANT_MT_IS_EVERYTHING

public static final SubLSymbol $sym101$RELEVANT_MT_IS_EVERYTHING

$const102$EverythingPSC

public static final SubLObject $const102$EverythingPSC

$const103$microtheoryDesignationArgnum

public static final SubLObject $const103$microtheoryDesignationArgnum

$const104$sentenceDesignationArgnum

public static final SubLObject $const104$sentenceDesignationArgnum

$str105$Tried_to_recursively_determine_th

public static final SubLString $str105$Tried_to_recursively_determine_th

$sym106$VAR_SPEC_

public static final SubLSymbol $sym106$VAR_SPEC_

$const107$Predicate

public static final SubLObject $const107$Predicate

$const108$Function_Denotational

public static final SubLObject $const108$Function_Denotational

$sym109$EXPAND_JOIN_LEFT

public static final SubLSymbol $sym109$EXPAND_JOIN_LEFT

$sym110$TRUE_SENTENCE_CASE_INSENSITIVE_EXPANSION

public static final SubLSymbol $sym110$TRUE_SENTENCE_CASE_INSENSITIVE_EXPANSION

$str111$termPhrases_CaseInsensitive

public static final SubLString $str111$termPhrases_CaseInsensitive

$const112$termPhrases

public static final SubLObject $const112$termPhrases

$sym113$ALPHABETIC_STRING_

public static final SubLSymbol $sym113$ALPHABETIC_STRING_

$const114$regexStringMatch

public static final SubLObject $const114$regexStringMatch

$str115$regexStringMatch_CaseInsensitive

public static final SubLString $str115$regexStringMatch_CaseInsensitive

$const116$trueSentence_CaseInsensitive

public static final SubLObject $const116$trueSentence_CaseInsensitive

$str117$_S_is_not_well_formed_

public static final SubLString $str117$_S_is_not_well_formed_

$sym118$DOTTED_LIST_P

public static final SubLSymbol $sym118$DOTTED_LIST_P

$sym119$SCOPING_RELATION_EXPRESSION_

public static final SubLSymbol $sym119$SCOPING_RELATION_EXPRESSION_

$sym120$FORMULA_WITH_SEQUENCE_NON_VAR_

public static final SubLSymbol $sym120$FORMULA_WITH_SEQUENCE_NON_VAR_

$sym121$EL_IMPLICATION_P

public static final SubLSymbol $sym121$EL_IMPLICATION_P

$sym122$SCOPING_RELATION_P

public static final SubLSymbol $sym122$SCOPING_RELATION_P

$sym123$CYCL_QUOTED_TERM_P

public static final SubLSymbol $sym123$CYCL_QUOTED_TERM_P

$sym124$EXPAND_SUBL_FN_P

public static final SubLSymbol $sym124$EXPAND_SUBL_FN_P

$sym125$FAST_ESCAPE_QUOTE_TERM_P

public static final SubLSymbol $sym125$FAST_ESCAPE_QUOTE_TERM_P

$sym126$FORMULA_QUANTIFIED_VARS_INT

public static final SubLSymbol $sym126$FORMULA_QUANTIFIED_VARS_INT

$const127$CycLFormula

public static final SubLObject $const127$CycLFormula

$const128$CycLSentence

public static final SubLObject $const128$CycLSentence

$list129

public static final SubLList $list129

$list130

public static final SubLList $list130

$str131$You_re_calling_the_function_A

public static final SubLString $str131$You_re_calling_the_function___A__

$str132$__Replace_all_calls_to_it_with___

public static final SubLString $str132$__Replace_all_calls_to_it_with___

$str133$NotifyA_if_you_receive_this_w

public static final SubLString $str133$__Notify__A_if_you_receive_this_w

$str134$continue_anyway

public static final SubLString $str134$continue_anyway

$sym135$EL_VARIABLE_

public static final SubLSymbol $sym135$EL_VARIABLE_

$kw136$POS

public static final SubLSymbol $kw136$POS

$const137$True

public static final SubLObject $const137$True

$const138$False

public static final SubLObject $const138$False

$str139$Invalid_attempt_to_reuse_memoizat

public static final SubLString $str139$Invalid_attempt_to_reuse_memoizat

$sym140$EQUALS_EL_MEMOIZED_

public static final SubLSymbol $sym140$EQUALS_EL_MEMOIZED_

$list141

public static final SubLList $list141

$list142

public static final SubLList $list142

Method Detail

el_formula_with_operator_p

public static final SubLObject el_formula_with_operator_p(SubLObject formula,
                                                          SubLObject operator)

Returns:: boolean; t iff OBJECT is a formula whose arg0 is OPERATOR

make_ist_sentence

public static final SubLObject make_ist_sentence(SubLObject mt,
                                                 SubLObject sentence)

Returns:: el-formula-p; a new #$ist sentence of the form (#$ist MT SENTENCE).

unmake_ternary_formula

public static final SubLObject unmake_ternary_formula(SubLObject formula)

Assumes that FORMULA is a ternary formula. returns four values: the operator of FORMULA, its arg1, its arg2, and its arg3.

possibly_formula_with_sequence_variablesP

public static final SubLObject possibly_formula_with_sequence_variablesP(SubLObject formula)

Return T iff FORMULA might have a sequence variable. This is suitable for fast-fails.

sentence_free_sequence_variables

public static final SubLObject sentence_free_sequence_variables(SubLObject sentence,
                                                                SubLObject bound_vars,
                                                                SubLObject varP)

Returns the free variables in SENTENCE that occur as sequence variables.

literal_free_sequence_variables

public static final SubLObject literal_free_sequence_variables(SubLObject literal,
                                                               SubLObject old_bound_vars,
                                                               SubLObject varP)

relation_free_sequence_variables

public static final SubLObject relation_free_sequence_variables(SubLObject relation,
                                                                SubLObject old_bound_vars,
                                                                SubLObject varP)

naut_free_sequence_variables

public static final SubLObject naut_free_sequence_variables(SubLObject naut,
                                                            SubLObject old_bound_vars,
                                                            SubLObject varP)

designated_sentence

public static final SubLObject designated_sentence(SubLObject literal)

Parameters:: LITERAL - an @xref mt-designating-literal?
Returns:: el-formula-p or nil; the designated CycL sentence in LITERAL.

sentence_designation_argnum

public static final SubLObject sentence_designation_argnum(SubLObject literal)

Parameters:: LITERAL - an @xref mt-designating-literal?
Returns:: integerp or nil; which arg position of LITERAL contains the designated CycL sentence.

designated_mt

public static final SubLObject designated_mt(SubLObject literal)

Parameters:: LITERAL - an @xref mt-designating-literal?
Returns:: hlmt-p or nil; the designated microtheory in LITERAL.

mt_designation_argnum

public static final SubLObject mt_designation_argnum(SubLObject literal)

occurs_as_sequence_variableP

public static final SubLObject occurs_as_sequence_variableP(SubLObject var,
                                                            SubLObject sentence)

Returns:: boolean; t iff VAR occurs as a sequence variable in SENTENCE.

sentence_sequence_variables

public static final SubLObject sentence_sequence_variables(SubLObject formula,
                                                           SubLObject varP)

Returns:: list; a list of all the sequence variables in FORMULA.

unmake_binary_formula

public static final SubLObject unmake_binary_formula(SubLObject formula)

Assumes that FORMULA is a binary formula. returns three values: the operator of FORMULA, its arg1, and its arg2.

sentence_free_term_variables

public static final SubLObject sentence_free_term_variables(SubLObject formula,
                                                            SubLObject bound_vars,
                                                            SubLObject varP)

Returns the free variables in FORMULA that occur as term variables (the counterpart of sequence variables).

formula_denoting_collectionP

public static final SubLObject formula_denoting_collectionP(SubLObject collection)

Returns:: boolean; t iff the instances of COLLECTION are constrained to be CycL formulas.

sentence_denoting_collectionP

public static final SubLObject sentence_denoting_collectionP(SubLObject collection)

Returns:: boolean; t iff the instances of COLLECTION are constrained to be CycL sentences.

user_defined_logical_operator_p

public static final SubLObject user_defined_logical_operator_p(SubLObject object)

Returns:: boolean; t iff OBJECT is one of the user-defined bounded logical operators.

el_negation_p

public static final SubLObject el_negation_p(SubLObject object)

Returns:: boolean; t iff OBJECT is a unary formula whose arg0 is the constant #$not. The formula is not required to be well-formed.

el_disjunction_p

public static final SubLObject el_disjunction_p(SubLObject object)

Returns:: boolean; t iff OBJECT is a formula whose arg0 is the constant #$or. The formula is not required to be well-formed.

el_conjunction_p

public static final SubLObject el_conjunction_p(SubLObject object)

Returns:: boolean; t iff OBJECT is a formula whose arg0 is the constant #$and. The formula is not required to be well-formed.

el_implication_p

public static final SubLObject el_implication_p(SubLObject object)

Returns:: boolean; t iff OBJECT is an implication, i.e. a binary formula whose arg0 is #$implies. Note that OBJECT does not need to be well-formed.

cyc_const_general_implication_operator_p

public static final SubLObject cyc_const_general_implication_operator_p(SubLObject object)

Return T iff OBJECT is a Cyc EL implication operator (#$implies or #$equiv).

el_general_implication_p

public static final SubLObject el_general_implication_p(SubLObject object)

Returns:: boolean; t iff OBJECT is an implicative formula, i.e. a binary formula whose arg0 is #$implies or #$equiv. Note that OBJECT does not need to be well-formed.

el_universal_p

public static final SubLObject el_universal_p(SubLObject object)

Returns:: boolean; t iff OBJECT is a universally quantified formula, i.e. one whose arg0 is #$forAll. Note that OBJECT does not need to be well-formed.

cycl_universal_p

public static final SubLObject cycl_universal_p(SubLObject object)

Like @xref el-universal-p but admits more terms as variables, e.g. HL variables.

el_existential_p

public static final SubLObject el_existential_p(SubLObject object)

Returns:: boolean; t iff OBJECT is an existentially quantified formula, i.e. one whose arg0 is #$thereExists, whose arg1 is an el variable, and also has an arg2. Note that arg2 does not need to be well-formed.

el_existential_min_p

public static final SubLObject el_existential_min_p(SubLObject object)

Returns:: boolean; t iff OBJECT is a ternary formula whose arg0 is #$thereExistAtLeast. Note that OBJECT does not need to be well-formed.

el_existential_max_p

public static final SubLObject el_existential_max_p(SubLObject object)

Returns:: boolean; t iff OBJECT is a ternary formula whose arg0 is #$thereExistAtMost. Note that OBJECT does not need to be well-formed.

el_existential_exact_p

public static final SubLObject el_existential_exact_p(SubLObject object)

Returns:: boolean; t iff OBJECT is a ternary formula whose arg0 is #$thereExistExactly. Note that OBJECT does not need to be well-formed.

cyc_const_unary_logical_op_p

public static final SubLObject cyc_const_unary_logical_op_p(SubLObject object)

Returns:: boolean; t iff OBJECT is one of the predefined unary operators.

cyc_const_binary_logical_op_p

public static final SubLObject cyc_const_binary_logical_op_p(SubLObject object)

Returns:: boolean; t iff OBJECT is one of the predefined binary operators.

cyc_const_ternary_logical_op_p

public static final SubLObject cyc_const_ternary_logical_op_p(SubLObject object)

Returns:: boolean; t iff OBJECT is one of the predefined ternary operators.

cyc_const_quaternary_logical_op_p

public static final SubLObject cyc_const_quaternary_logical_op_p(SubLObject object)

Returns:: boolean; t iff OBJECT is one of the predefined quaternary operators.

cyc_const_quintary_logical_op_p

public static final SubLObject cyc_const_quintary_logical_op_p(SubLObject object)

Returns:: boolean; t iff OBJECT is one of the predefined quintary operators.

cyc_const_variable_arity_logical_op_p

public static final SubLObject cyc_const_variable_arity_logical_op_p(SubLObject object)

Returns:: boolean; t iff OBJECT is one of the predefined variable-arity operators.

cyc_const_existential_p

public static final SubLObject cyc_const_existential_p(SubLObject object)

Returns:: boolean; t iff OBJECT is #$thereExists.

cyc_const_universal_p

public static final SubLObject cyc_const_universal_p(SubLObject object)

Returns:: boolean; t iff OBJECT is #$forAll.

cyc_const_regular_quantifier_p

public static final SubLObject cyc_const_regular_quantifier_p(SubLObject object)

Returns:: boolean; t iff OBJECT is one of the predefined regular quantifiers.

possibly_el_regularly_quantified_sentence_p

public static final SubLObject possibly_el_regularly_quantified_sentence_p(SubLObject object)

Returns:: boolean; t iff OBJECT is a binary sentence whose arg0 is one of the predefined regular quantifiers (#$forAll or #$thereExists).

cyc_const_bounded_existential_operator_p

public static final SubLObject cyc_const_bounded_existential_operator_p(SubLObject object)

Returns:: boolean; t iff OBJECT is one of the predefined bounded existentials.

user_defined_bounded_existential_operator_p

public static final SubLObject user_defined_bounded_existential_operator_p(SubLObject object)

Returns:: boolean; t iff OBJECT is one of the user-defined bounded existential quantifiers.

el_bounded_existential_p

public static final SubLObject el_bounded_existential_p(SubLObject object)

Returns:: boolean; t iff OBJECT is a ternary formula whose arg0 is one of the predefined bounded existential quantifiers.

cyc_const_general_existential_operator_p

public static final SubLObject cyc_const_general_existential_operator_p(SubLObject object)

Returns:: boolean; t iff OBJECT is one of the predefined existentials, either regular or bounded.

cyc_const_quantifier_p

public static final SubLObject cyc_const_quantifier_p(SubLObject object)

Returns:: boolean; t iff OBJECT is one of the predefined quantifiers, either regular or bounded.

possibly_el_quantified_sentence_p

public static final SubLObject possibly_el_quantified_sentence_p(SubLObject object)

Returns:: boolean; t iff OBJECT is either a regularly quantified formula or a bounded existential formula.

cyc_const_logical_operator_p

public static final SubLObject cyc_const_logical_operator_p(SubLObject object)

Returns:: boolean; t iff OBJECT is any of the predefined logical operators.

cyc_const_tense_operator_p

public static final SubLObject cyc_const_tense_operator_p(SubLObject object)

cyc_const_metric_tense_operator_p

public static final SubLObject cyc_const_metric_tense_operator_p(SubLObject object)

cyc_const_generalized_tense_operator_p

public static final SubLObject cyc_const_generalized_tense_operator_p(SubLObject object)

cyc_const_sentential_relation_p

public static final SubLObject cyc_const_sentential_relation_p(SubLObject object)

Returns:: boolean; t iff OBJECT is any of the predefined logical operators or quantifiers, either regular or bounded.

el_logical_operator_formula_p

public static final SubLObject el_logical_operator_formula_p(SubLObject object)

Returns:: boolean; t iff OBJECT is an EL formula with a logical operator as its arg0.

el_unary_formula_p

public static final SubLObject el_unary_formula_p(SubLObject object)

Returns:: boolean; t iff OBJECT is a formula of arity 1. OBJECT is not required to be well-formed.

el_binary_formula_p

public static final SubLObject el_binary_formula_p(SubLObject object)

Returns:: boolean; t iff OBJECT is a formula of arity 2. OBJECT is not required to be well-formed.

subl_escape_p

public static final SubLObject subl_escape_p(SubLObject object)

Returns:: boolean; t iff OBJECT is an escape to SubL, which should not be analyzed recursively.

expand_subl_fn_p

public static final SubLObject expand_subl_fn_p(SubLObject object)

Returns:: boolean; t iff OBJECT is an escape to SubL using #$ExpandSubLFn

subl_quote_p

public static final SubLObject subl_quote_p(SubLObject object)

Returns:: boolean; t iff OBJECT is an escape to SubL using #$SubLQuoteFn

epsilon_p

public static final SubLObject epsilon_p(SubLObject object)

Returns:: boolean; t iff OBJECT is NIL (epsilon)

cyc_const_exception_operator_p

public static final SubLObject cyc_const_exception_operator_p(SubLObject object)

Returns:: boolean; t iff OBJECT is one of the predefined exception operators.

el_exception_p

public static final SubLObject el_exception_p(SubLObject object)

Assumes that all exception operators are binary.

Returns:: boolean; t iff OBJECT is a binary formula whose arg0 is one of the predefined exception operators.

cyc_const_pragmatic_requirement_operator_p

public static final SubLObject cyc_const_pragmatic_requirement_operator_p(SubLObject object)

Returns:: boolean; t iff OBJECT is one of the predefined exception operators.

el_pragmatic_requirement_p

public static final SubLObject el_pragmatic_requirement_p(SubLObject object)

el_meets_pragmatic_requirement_p

public static final SubLObject el_meets_pragmatic_requirement_p(SubLObject object)

Assumes that #$meetsPragmaticRequirement is a binary operator.

Returns:: boolean; t iff OBJECT is a binary formula whose arg0 is #$meetsPragmaticRequirement.

el_implicit_meta_literal_sentence_p

public static final SubLObject el_implicit_meta_literal_sentence_p(SubLObject object)

Returns:: boolean; t iff OBJECT is an EL sentence which indicates an implicit meta-literal. The two kinds of EL sentences which indicate implicit meta-literals are EL exceptions (e.g. #$exceptWhen, #$exceptFor) and pragmatic requirements (#$pragmaticRequirement).

elf_p

public static final SubLObject elf_p(SubLObject object)

Returns:: boolean; t iff OBJECT is a candidate EL formula (not necessarily well-formed). 'formula' refers to a formula in the grammar, not a formula in the logic. For example, a non-atomic term is a formula in the grammar, but not a formula in the logic. note that #$True and #$False are not considered formulas by this definition.

el_formula_p

public static final SubLObject el_formula_p(SubLObject object)

Returns:: boolean; t iff OBJECT is a candidate EL formula (not necessarily well-formed). 'formula' refers to a formula in the grammar, not a formula in the logic. For example, a non-atomic term is a formula in the grammar, but not a formula in the logic. note that #$True and #$False are not considered formulas by this definition.

possibly_fo_naut_p

public static final SubLObject possibly_fo_naut_p(SubLObject object)

A quick test for whether OBJECT could possibly be a first order naut. It is certainly not guaranteed that OBJECT is a first order naut just because this function returns t.

possibly_naut_p

public static final SubLObject possibly_naut_p(SubLObject object)

A quick test for whether OBJECT could possibly be a naut. It is certainly not guaranteed that OBJECT is a naut just because this function returns t.

possibly_sentence_p

public static final SubLObject possibly_sentence_p(SubLObject object)

A quick test for whether OBJECT could possibly be a CycL sentence. It is certainly not guaranteed that OBJECT is a CycL sentence just because this function returns t. Passing this test should guarantee that applying the sentence accessors will not trigger an error.

possibly_atomic_sentence_p

public static final SubLObject possibly_atomic_sentence_p(SubLObject object)

A quick test for whether OBJECT could possibly be an atomic CycL sentence. It is certainly not guaranteed that OBJECT is an atomic CycL sentence just because this function returns t.

contains_subformula_p

public static final SubLObject contains_subformula_p(SubLObject object)

Returns:: boolean; t iff OBJECT is an EL formula which contains an EL subformula.

el_empty_list_p

public static final SubLObject el_empty_list_p(SubLObject obj)

el_extensional_set_p

public static final SubLObject el_extensional_set_p(SubLObject object)

el_empty_set_p

public static final SubLObject el_empty_set_p(SubLObject object)

el_non_empty_set_p

public static final SubLObject el_non_empty_set_p(SubLObject object)

el_sequence_p

public static final SubLObject el_sequence_p(SubLObject object)

Returns:: boolean; t iff OBJECT is an el sequence.

groundP

public static final SubLObject groundP(SubLObject expression,
                                       SubLObject varP)

Returns whether EXPRESSION is free of any variables?

hl_ground_tree_p

public static final SubLObject hl_ground_tree_p(SubLObject tree)

closedP

public static final SubLObject closedP(SubLObject expression,
                                       SubLObject varP)

is EXPRESSION free of any free variables? (includes ground? check for efficiency)

no_free_variablesP

public static final SubLObject no_free_variablesP(SubLObject expression,
                                                  SubLObject varP)

is EXPRESSION free of any free variables? (excludes ground? check for efficiency)

sequence_term

public static final SubLObject sequence_term(SubLObject formula)

Returns the sequence term in FORMULA, if there is one. Otherwise returns NIL. For example, (sequence-term ( ?X ?Y . )) returns . However, it will not return nested sequence terms; i.e. (sequence-var (#$and ( ?X ?Y . ))) will return NIL.

sequence_var

public static final SubLObject sequence_var(SubLObject relation,
                                            SubLObject varP)

Returns the sequence variable in RELATION, if there is one. Otherwise returns NIL. For example, (sequence-var ( ?X ?Y . ?Z)) returns ?Z. However, it will not return nested sequence variables; i.e. (sequence-var (#$and ( ?X ?Y . ?Z))) will return NIL.

sequence_non_var

public static final SubLObject sequence_non_var(SubLObject relation,
                                                SubLObject varP)

Returns the part of RELATION that should be a sequence variable by its syntax, but isn't. Returns NIL if there is no such ill-formed thing in RELATION.

maybe_add_sequence_var_to_end

public static final SubLObject maybe_add_sequence_var_to_end(SubLObject seqvar,
                                                             SubLObject formula)

Returns:: formula; formula with SEQVAR added to the end, if SEQVAR is non-nil. Otherwise returns FORMULA unadulterated.

formula_with_sequence_termP

public static final SubLObject formula_with_sequence_termP(SubLObject formula)

el_formula_without_sequence_termP

public static final SubLObject el_formula_without_sequence_termP(SubLObject formula)

formula_with_sequence_varP

public static final SubLObject formula_with_sequence_varP(SubLObject formula)

formula_with_sequence_non_varP

public static final SubLObject formula_with_sequence_non_varP(SubLObject formula)

Returns:: boolean; t iff FORMULA contains something in sequence variable position, but it's not a variable.

ignore_sequence_vars

public static final SubLObject ignore_sequence_vars(SubLObject formula)

e.g. transforms ( ?X ?Y . ?Z) into ( ?X ?Y)

term_is_one_of_argsP

public static final SubLObject term_is_one_of_argsP(SubLObject v_term,
                                                    SubLObject formula)

formula_arity

public static final SubLObject formula_arity(SubLObject formula,
                                             SubLObject seqvar_handling)

returns the arity of FORMULA (the number of arguments). This will be an integer if FORMULA is an EL formula, NART or assertion, and NIL otherwise (e.g. the arity of #$True is NIL.) The operator itself does not count as an argument. If seqvar-handling is :regularize, then sequence variables count as a single argument. Hence, (#$and ) is a formula of arity 3, and (#$and . ?SEQ) is a formula of arity 4. If seqvar-handling is :ignore, then sequence variables don't count, so both of those would be arity 3. Don't pass it :include.

expression_arity

public static final SubLObject expression_arity(SubLObject relational_expression,
                                                SubLObject seqvar_handling)

formula_length

public static final SubLObject formula_length(SubLObject formula,
                                              SubLObject seqvar_handling)

Returns:: integer; the length of the formula. In other words, the number of terms. This is one greater than the arity. If seqvar-handling is :regularize, then sequence variables count as a single argument. If seqvar-handling is :ignore, then sequence variables don't count at all.

formula_arityL

public static final SubLObject formula_arityL(SubLObject formula,
                                              SubLObject v_arity,
                                              SubLObject seqvar_handling)

Returns:: boolean; T iff FORMULA's arity is less than ARITY.

formula_arityG

public static final SubLObject formula_arityG(SubLObject formula,
                                              SubLObject v_arity,
                                              SubLObject seqvar_handling)

Returns:: boolean; T iff FORMULA's arity is greater than ARITY.

formula_arityGE

public static final SubLObject formula_arityGE(SubLObject formula,
                                               SubLObject v_arity,
                                               SubLObject seqvar_handling)

Returns:: boolean; T iff FORMULA's arity is greater than or equal to ARITY.

el_formula_arityGE

public static final SubLObject el_formula_arityGE(SubLObject el_formula,
                                                  SubLObject v_arity,
                                                  SubLObject seqvar_handling)

Returns:: boolean; T iff EL-FORMULA's arity is greater than or equal to ARITY.

formula_arityE

public static final SubLObject formula_arityE(SubLObject formula,
                                              SubLObject v_arity,
                                              SubLObject seqvar_handling)

Returns:: boolean; T iff FORMULA's arity is equal to ARITY.

first_in_sequence

public static final SubLObject first_in_sequence(SubLObject sequence)

returns the first element of SEQUENCE.

rest_of_sequence

public static final SubLObject rest_of_sequence(SubLObject sequence)

returns (as a list or a variable) all elements but the first of SEQUENCE

sentence_quantifier

public static final SubLObject sentence_quantifier(SubLObject sentence)

If SENTENCE is a quantified sentence, returns the quantifier. Otherwise returns NIL.

quantified_var

public static final SubLObject quantified_var(SubLObject sentence)

returns the quantified variable in a quantified sentence. returns NIL if SENTENCE is not a quantified sentence. e.g. (quantified-var (#$forAll ?X )) would return ?X. and (quantified-var (#$thereExistExactly 539 ?EVENT )) would return ?EVENT.

quantified_sub_sentence

public static final SubLObject quantified_sub_sentence(SubLObject sentence)

returns the quantified subsentence in a quantified sentence. Yields an error if SENTENCE is not a quantified sentence. e.g. (quantified-sub-sentence (#$forAll ?X )) would return . and (quantified-sub-sentence (#$thereExistExactly 539 ?EVENT )) would return .

quantified_sub_sentence_argnum

public static final SubLObject quantified_sub_sentence_argnum(SubLObject sentence)

Returns:: nil or integerp; the argnum that contains the quantified subsentence of SENTENCE. Yields an error and returns NIL if SENTENCE is not a quantified sentence.

quantified_sub_sentence_argnum_for_operator

public static final SubLObject quantified_sub_sentence_argnum_for_operator(SubLObject operator)

cycl_subl_symbol_symbol

public static final SubLObject cycl_subl_symbol_symbol(SubLObject object)

When OBJECT is a cycl-subl-symbol-p, returns the SubL symbol part.

list_to_elf

public static final SubLObject list_to_elf(SubLObject list)

Returns an EL formula constructed from the list LIST. Currently this just returns the list itself, since we implement EL formulas as lists. You can't destructively modify the returned EL formula without affecting LIST.

make_el_formula

public static final SubLObject make_el_formula(SubLObject operator,
                                               SubLObject args,
                                               SubLObject sequence_var)

returns a new EL formula with the operator OPERATOR, the arguments ARGS, and the optional sequence variable SEQUENCE-VAR. This formula is destructible at the top level.

make_formula

public static final SubLObject make_formula(SubLObject operator,
                                            SubLObject args,
                                            SubLObject sequence_var)

returns a new EL formula with the operator OPERATOR, the arguments ARGS, and the optional sequence variable SEQUENCE-VAR. This formula is destructible at the top level.

copy_formula

public static final SubLObject copy_formula(SubLObject formula)

Returns a copy of the EL formula FORMULA.

copy_sentence

public static final SubLObject copy_sentence(SubLObject sentence)

Returns a copy of the EL sentence SENTENCE

copy_clause

public static final SubLObject copy_clause(SubLObject clause)

Returns a copy of CLAUSE.

copy_expression

public static final SubLObject copy_expression(SubLObject expression)

Returns a copy of EXPRESSION.

make_el_literal

public static final SubLObject make_el_literal(SubLObject predicate,
                                               SubLObject args,
                                               SubLObject sequence_var)

returns a new EL sentence with the operator PREDICATE and the arguments ARGS. This sentence is destructible at the top level.

make_unary_formula

public static final SubLObject make_unary_formula(SubLObject operator,
                                                  SubLObject arg)

returns a new unary formula with the operator OPERATOR and the single argument ARG.

make_binary_formula

public static final SubLObject make_binary_formula(SubLObject operator,
                                                   SubLObject arg1,
                                                   SubLObject arg2)

returns a new binary formula with the operator OPERATOR and the two arguments ARG1 and ARG2.

make_ternary_formula

public static final SubLObject make_ternary_formula(SubLObject operator,
                                                    SubLObject arg1,
                                                    SubLObject arg2,
                                                    SubLObject arg3)

returns a new ternary formula with the operator OPERATOR and the three arguments ARG1, ARG2, and ARG3.

make_negation

public static final SubLObject make_negation(SubLObject sentence)

returns the negation of SENTENCE. Does not perform any simplification. i.e. just returns (#$not ).

make_disjunction

public static final SubLObject make_disjunction(SubLObject args)

returns a new disjunction. Each member of the list ARGS is a disjunct in the new disjunction. e.g. (make-disjunction ( )) returns (#$or ).

make_conjunction

public static final SubLObject make_conjunction(SubLObject args)

returns a new conjunction. Each member of the list ARGS is a conjunct in the new conjunction. e.g. (make-conjunction ( )) returns (#$and ).

make_universal

public static final SubLObject make_universal(SubLObject var,
                                              SubLObject sentence)

returns a new universally quantified sentence of the form (#$forAll ).

make_regularly_quantified_sentence

public static final SubLObject make_regularly_quantified_sentence(SubLObject quantifier,
                                                                  SubLObject var,
                                                                  SubLObject subsent)

map_formula_args

public static final SubLObject map_formula_args(SubLObject func,
                                                SubLObject formula,
                                                SubLObject map_seqvarP)

Execute FUNC on each argument (in order) of FORMULA, unless it is an opaque argument. e.g. (map-formula-args #'func (#$and )) would return (#$and (func ) (func ) (func )). By default, FUNC is not applied to sequence variables, because they are not arguments per se; rather they are variables that can bind to argument (sub)sequences, but if map-seqvar? is t, then FUNC will be applied to sequence variables.

nmap_formula_args

public static final SubLObject nmap_formula_args(SubLObject func,
                                                 SubLObject formula,
                                                 SubLObject map_seqvarP)

A destructive version of @xref map-formula-args.

nmap_formula_terms

public static final SubLObject nmap_formula_terms(SubLObject func,
                                                  SubLObject formula,
                                                  SubLObject map_seqvarP)

A destructive version of @xref map-formula-terms.

pass_through_if_negation

public static final SubLObject pass_through_if_negation(SubLObject function,
                                                        SubLObject formula)

Returns:: 0 formula; FORMULA with FUNCTION applied to its arg1 iff FORMULA is a negation and its arg1 is not opaque.

pass_through_if_disjunction

public static final SubLObject pass_through_if_disjunction(SubLObject function,
                                                           SubLObject formula)

Returns:: 0 formula; FORMULA with FUNCTION applied to its args iff FORMULA is a disjunction and its args are not opaque.

pass_through_if_conjunction

public static final SubLObject pass_through_if_conjunction(SubLObject function,
                                                           SubLObject formula)

Returns:: 0 formula; FORMULA with FUNCTION applied to its args iff FORMULA is a conjunction and its args are not opaque.

pass_through_if_regularly_quantified

public static final SubLObject pass_through_if_regularly_quantified(SubLObject function,
                                                                    SubLObject formula)

Returns:: 0 formula; FORMULA with FUNCTION applied to its quantified subformula iff FORMULA is a regularly quantified formula and its quantified subformula is not opaque.

pass_through_if_bounded_existential

public static final SubLObject pass_through_if_bounded_existential(SubLObject function,
                                                                   SubLObject formula)

Returns:: 0 formula; FORMULA with FUNCTION applied to its quantified subformula iff FORMULA is a bounded existential formula and its quantified subformula is not opaque.

pass_through_if_junction

public static final SubLObject pass_through_if_junction(SubLObject function,
                                                        SubLObject formula)

Returns:: 0 formula; FORMULA with FUNCTION applied to its args iff FORMULA is a conjunction or disjunction and its args are not opaque.

pass_through_if_logical_op

public static final SubLObject pass_through_if_logical_op(SubLObject function,
                                                          SubLObject formula)

Returns:: 0 formula; FORMULA with FUNCTION applied to its args iff FORMULA is an EL formula with a logical operator as its arg0 and its args are not opaque.

pass_through_if_quantified

public static final SubLObject pass_through_if_quantified(SubLObject function,
                                                          SubLObject formula)

Returns:: 0 formula; FORMULA with FUNCTION applied to its quantified subformula iff FORMULA is a quantified formula and its quantified subformula is not opaque.

pass_through_if_logical_op_or_quantified

public static final SubLObject pass_through_if_logical_op_or_quantified(SubLObject function,
                                                                        SubLObject formula)

Returns:: 0 formula; FORMULA with FUNCTION applied to its quantified subformula iff FORMULA is an EL formula with a quantifier or logical operator as its arg0 and its args are not opaque.

pass_through_if_relation_syntax

public static final SubLObject pass_through_if_relation_syntax(SubLObject function,
                                                               SubLObject formula)

Returns:: 0 formula; FORMULA with FUNCTION applied to all its terms (including the arg0) iff FORMULA is an EL formula with the syntax of a relation as its arg0 and its args are not opaque.

funcall_formula_arg

public static final SubLObject funcall_formula_arg(SubLObject function,
                                                   SubLObject formula,
                                                   SubLObject argnum)

Calls FUNCTION on the ARGNUMth arg of FORMULA, unless that arg position is opaque.

replace_formula_arg

public static final SubLObject replace_formula_arg(SubLObject argnum,
                                                   SubLObject new_arg,
                                                   SubLObject formula)

Replaces the ARGNUMth argument of FORMULA with NEW-ARG. This is constructive.

nreplace_formula_arg

public static final SubLObject nreplace_formula_arg(SubLObject argnum,
                                                    SubLObject new_arg,
                                                    SubLObject formula)

Replaces the ARGNUMth argument of FORMULA with NEW-ARG. This is destructive.

literal_atomic_sentence

public static final SubLObject literal_atomic_sentence(SubLObject literal)

Returns the atomic formula within LITERAL. This will either be LITERAL itself or (if LITERAL is a negation) the atomic formula inside the negation. Assumes that LITERAL is a literal. (#$not . ?X) is not a literal.

literal_truth

public static final SubLObject literal_truth(SubLObject literal)

literal_sense

public static final SubLObject literal_sense(SubLObject literal)

literal_args

public static final SubLObject literal_args(SubLObject literal,
                                            SubLObject seqvar_handling)

Returns the arguments of LITERAL. Assumes that LITERAL is a literal. (#$not . ?X) is not a literal. If seqvar-handling is :ignore, it chops off the sequence var if there is one. If seqvar-handling is :regularize, it treats the sequence var as a regular variable. If seqvar-handling is :include, it returns it as a sequence var.

literal_arg

public static final SubLObject literal_arg(SubLObject literal,
                                           SubLObject argnum,
                                           SubLObject seqvar_handling)

returns the ARGNUMth argument of LITERAL. An ARGNUM of 0 will return the predicate. returns NIL if LITERAL is not a formula, or if ARGNUM is out of bounds or not an integer. Assumes that LITERAL is a literal. (#$not . ?X) is not a literal. If seqvar-handling is :ignore, it will return NIL if asked for the arg position where the sequence variable is. If seqvar-handling is :regularize, it will return the sequence variable if asked for its position. e.g. (literal-arg ( . ?SEQ) 2 :ignore) -> NIL but (literal-arg ( . ?SEQ) 2 :regularize) -> ?SEQ

literal_predicate

public static final SubLObject literal_predicate(SubLObject literal,
                                                 SubLObject seqvar_handling)

Returns the predicate (the 0th argument) of LITERAL. For example, (literal-predicate (#$isa #$Muffet #$Dog)) would return #$isa. Assumes that LITERAL is a literal. (#$not . ?X) is not a literal.

literal_arg0

public static final SubLObject literal_arg0(SubLObject literal,
                                            SubLObject seqvar_handling)

Returns the 0th argument (the predicate) of LITERAL. For example, (literal-arg0 (#$isa #$Muffet #$Dog)) would return #$isa. Assumes that LITERAL is a literal. (#$not . ?X) is not a literal.

literal_arg1

public static final SubLObject literal_arg1(SubLObject literal,
                                            SubLObject seqvar_handling)

Returns the 1st argument of LITERAL. For example, (literal-arg1 (#$isa #$Muffet #$Dog)) would return #$Muffet. Assumes that LITERAL is a literal. (#$not . ?X) is not a literal.

literal_arg2

public static final SubLObject literal_arg2(SubLObject literal,
                                            SubLObject seqvar_handling)

Returns the 2nd argument of LITERAL. For example, (literal-arg2 (#$isa #$Muffet #$Dog)) would return #$Dog. Assumes that LITERAL is a literal. (#$not . ?X) is not a literal.

literal_arity

public static final SubLObject literal_arity(SubLObject literal,
                                             SubLObject seqvar_handling)

returns the arity of a literal (the number of arguments). The predicate itself does not count as an argument. Assumes that LITERAL is a literal. (#$not . ?X) is not a literal. For example, the arity of (#$not (#$isa #$Dog #$Collection)) would be 2, because there are 2 arguments, #$Dog and #$Collection. The #$not, if there is one, is ignored. If seqvar-handling is :regularize, then sequence variables count as a single argument. Hence, ( ) is a literal of arity 3, and ( . ?SEQ) is a literal of arity 4. If seqvar-handling is :ignore, then sequence variables don't count, so both of those would be arity 3. Don't pass it :include.

asent_and_sense_to_literal

public static final SubLObject asent_and_sense_to_literal(SubLObject asent,
                                                          SubLObject sense)

asent_and_truth_to_literal

public static final SubLObject asent_and_truth_to_literal(SubLObject asent,
                                                          SubLObject truth)

el_negative_sentences

public static final SubLObject el_negative_sentences(SubLObject sentences)

Returns all the negations in SENTENCES, which is a list of EL sentences.

Returns:: list; a list of EL sentences, each of which begins with #$not.
See Also:: el-positive-sentences

el_positive_sentences

public static final SubLObject el_positive_sentences(SubLObject sentences)

Returns all the sentences in SENTENCES that are not negations. SENTENCES is a list of EL sentences.

Returns:: list; a list of EL sentences
See Also:: el-negative-sentences

unary_lit_p

public static final SubLObject unary_lit_p(SubLObject literal)

Returns:: boolean; t iff LITERAL has exactly one argument. Assumes that LITERAL is a literal.

binary_lit_p

public static final SubLObject binary_lit_p(SubLObject literal)

Returns:: boolean; t iff LITERAL has exactly two arguments. Assumes that LITERAL is a literal.

pred_litP

public static final SubLObject pred_litP(SubLObject literal,
                                         SubLObject pred)

Returns:: boolean; t iff LITERAL is positive and has PRED as its arg0. Returns NIL if LITERAL is negative or is not an EL formula.

isa_litP

public static final SubLObject isa_litP(SubLObject lit)

Returns:: boolean; t iff LIT is a positive binary literal whose predicate is #$isa.

isa_hl_var_hl_var_litP

public static final SubLObject isa_hl_var_hl_var_litP(SubLObject lit)

quoted_isa_litP

public static final SubLObject quoted_isa_litP(SubLObject lit)

Returns:: boolean; t iff LIT is a positive binary literal whose predicate is #$quoted-isa.

genls_litP

public static final SubLObject genls_litP(SubLObject lit)

Returns:: boolean; t iff LIT is a positive binary literal whose predicate is #$genls.

tou_litP

public static final SubLObject tou_litP(SubLObject lit)

Returns:: boolean; t iff LIT is a positive binary literal whose predicate is #$termOfUnit.

tou_asentP

public static final SubLObject tou_asentP(SubLObject asent)

Returns:: boolean; t iff ASENT is a binary atomic sentence whose predicate is #$termOfUnit.

holds_in_litP

public static final SubLObject holds_in_litP(SubLObject literal)

Returns:: boolean; t iff LITERAL is a positive binary literal whose predicate is #$holdsIn.

true_sentence_litP

public static final SubLObject true_sentence_litP(SubLObject literal)

Returns:: boolean; t iff LITERAL is a positive unary literal whose predicate is #$trueSentence.

forward_non_trigger_literal_litP

public static final SubLObject forward_non_trigger_literal_litP(SubLObject literal)

Returns:: boolean; t iff LITERAL is a positive unary literal whose predicate is #$forwardNonTriggerLiteral.

evaluate_litP

public static final SubLObject evaluate_litP(SubLObject literal,
                                             SubLObject varP)

Returns:: boolean; t iff LITERAL is a positive binary literal whose predicate is #evaluate, whose arg1 is a variable, string, or number, and whose arg2 is a nat.

ist_sentence_p

public static final SubLObject ist_sentence_p(SubLObject sentence)

ist_of_atomic_sentence_p

public static final SubLObject ist_of_atomic_sentence_p(SubLObject sentence)

Returns:: boolean; t iff SENTENCE is an #$ist around an atomic sentence

ist_of_atomic_sentence_int

public static final SubLObject ist_of_atomic_sentence_int(SubLObject sentence,
                                                          SubLObject pred)

ist_sentence_with_chlmt_p

public static final SubLObject ist_sentence_with_chlmt_p(SubLObject sentence)

true_sentence_p

public static final SubLObject true_sentence_p(SubLObject sentence)

true_sentence_of_atomic_sentence_p

public static final SubLObject true_sentence_of_atomic_sentence_p(SubLObject sentence)

Returns:: boolean; t iff SENTENCE is a #$trueSentence around an atomic sentence

kappa_asent_p

public static final SubLObject kappa_asent_p(SubLObject object)

kappa_predicate_p

public static final SubLObject kappa_predicate_p(SubLObject object)

lambda_function_p

public static final SubLObject lambda_function_p(SubLObject object)

mt_designating_literalP

public static final SubLObject mt_designating_literalP(SubLObject literal)

Returns:: boolean; t iff LITERAL is a literal whose arg0 is a #$MicrotheoryDesignatingRelation

valid_argnum_p

public static final SubLObject valid_argnum_p(SubLObject arg)

Returns:: boolean; t iff ARG could be a valid arg index for some formula, i.e. if (formula-arg ARG) is a sensible thing to try.

valid_arity_p

public static final SubLObject valid_arity_p(SubLObject v_arity)

Returns:: boolean; t iff ARG could be a valid arity for some formula.

predicate_specP

public static final SubLObject predicate_specP(SubLObject v_term,
                                               SubLObject var_func)

Returns:: boolean; t iff TERM is a predicate, a variable, or a nat whose result is a predicate.

function_specP

public static final SubLObject function_specP(SubLObject v_term,
                                              SubLObject var_func)

Returns:: boolean; t iff TERM is a denotational function, a variable, or a nat whose result is a denotational function.

el_relation_expressionP

public static final SubLObject el_relation_expressionP(SubLObject object)

Returns:: boolean; t iff OBJECT is either a naut or an EL formula with a predicate, variable, or logical operator as its arg0.

hl_relation_expressionP

public static final SubLObject hl_relation_expressionP(SubLObject object)

Returns:: boolean; t iff OBJECT is a nart.

relation_expressionP

public static final SubLObject relation_expressionP(SubLObject object)

Returns:: boolean; t iff OBJECT is either a nat or an EL formula with a predicate, variable, or logical operator as its arg0.

el_formulaP

public static final SubLObject el_formulaP(SubLObject formula)

Returns:: boolean; t iff FORMULA is an EL formula with a predicate, variable, or logical operator as its arg0.

el_atomic_sentenceP

public static final SubLObject el_atomic_sentenceP(SubLObject formula)

Returns:: boolean; t iff FORMULA is an EL formula with a predicate (or variable) as its arg0.

el_non_atomic_sentenceP

public static final SubLObject el_non_atomic_sentenceP(SubLObject formula)

Returns:: boolean; t iff FORMULA is an EL formula with a logical operator as its arg0.

atomic_sentenceP

public static final SubLObject atomic_sentenceP(SubLObject object)

Returns:: boolean; t iff OBJECT is an EL formula with a predicate as its arg0.

formula_non_var_symbols

public static final SubLObject formula_non_var_symbols(SubLObject formula,
                                                       SubLObject varP)

referenced_variables

public static final SubLObject referenced_variables(SubLObject formula,
                                                    SubLObject varP)

literal_variables

public static final SubLObject literal_variables(SubLObject relation,
                                                 SubLObject varP,
                                                 SubLObject include_sequence_varsP)

relation_variables

public static final SubLObject relation_variables(SubLObject literal,
                                                  SubLObject varP,
                                                  SubLObject include_sequence_varsP)

scoped_vars

public static final SubLObject scoped_vars(SubLObject formula,
                                           SubLObject varP)

wf_wrt_sequence_varsP

public static final SubLObject wf_wrt_sequence_varsP(SubLObject formula)

Returns:: boolean; t iff FORMULA has no ill-formed sequence variable syntax at the top level.

sentence_free_variables

public static final SubLObject sentence_free_variables(SubLObject sentence,
                                                       SubLObject bound_vars,
                                                       SubLObject var_func,
                                                       SubLObject include_sequence_varsP)

sentence_free_variables_int

public static final SubLObject sentence_free_variables_int(SubLObject sentence,
                                                           SubLObject bound_vars,
                                                           SubLObject var_func,
                                                           SubLObject include_sequence_varsP)

literals_free_variables

public static final SubLObject literals_free_variables(SubLObject literals,
                                                       SubLObject bound_vars,
                                                       SubLObject varP,
                                                       SubLObject include_sequence_varsP)

literal_free_variables

public static final SubLObject literal_free_variables(SubLObject literal,
                                                      SubLObject old_bound_vars,
                                                      SubLObject varP,
                                                      SubLObject include_sequence_varsP)

relation_free_variables

public static final SubLObject relation_free_variables(SubLObject relation,
                                                       SubLObject old_bound_vars,
                                                       SubLObject varP,
                                                       SubLObject include_sequence_varsP)

scoping_relation_expressionP

public static final SubLObject scoping_relation_expressionP(SubLObject expression)

arg_types_prescribe_unreifiedP

public static final SubLObject arg_types_prescribe_unreifiedP(SubLObject rel,
                                                              SubLObject pos)

do the arg-types applicable to arg of relation require the arg to be an unreified function?

arg_types_prescribe_tacit_term_listP

public static final SubLObject arg_types_prescribe_tacit_term_listP(SubLObject rel,
                                                                    SubLObject pos)

Do the arg-types applicable to arg of relation require the arg to be a SubL list? Note that SubL lists are deprecated except for special cases in the CycL grammar itself.

el_error

public static final SubLObject el_error(SubLObject level,
                                        SubLObject format_str,
                                        SubLObject arg1,
                                        SubLObject arg2,
                                        SubLObject arg3)

declare_el_utilities_file

public static final SubLObject declare_el_utilities_file()

init_el_utilities_file

public static final SubLObject init_el_utilities_file()

setup_el_utilities_file

public static final SubLObject setup_el_utilities_file()

declareFunctions

public void declareFunctions()

Description copied from interface: SubLFile

Declares the mapping between functions and symbols for all named functions defined in the file. Like CRTL define.

initializeVariables

public void initializeVariables()

Description copied from interface: SubLFile

Initializes all global variables and private internal variables for constants defined in the file. Like CRTL init.

runTopLevelForms

public void runTopLevelForms()

Description copied from interface: SubLFile

Runs all top-level forms in order. Like CRTL setup.

Overview

Package

Class

Use

Tree

Deprecated

Index

Help

PREV CLASS NEXT CLASS

FRAMES NO FRAMES

SUMMARY: NESTED | FIELD | CONSTR | METHOD

DETAIL: FIELD | CONSTR | METHOD

com.cyc.cycjava.cycl Class el_utilities

me

myName

$cyc_const_unary_logical_ops$

$cyc_const_binary_logical_ops$

$cyc_const_ternary_logical_ops$

$cyc_const_quaternary_logical_ops$

$cyc_const_quintary_logical_ops$

$cyc_const_variable_arity_logical_ops$

$cyc_const_regular_quantifiers$

$cyc_const_bounded_existentials$

$cyc_const_tense_operators$

$cyc_const_metric_tense_operators$

$cyc_const_exception_operators$

$cyc_const_pragmatic_requirement_operators$

$const0$not

$const1$or

$const2$and

$const3$implies

$const4$equiv

$const5$xor

$const6$forAll

$const7$thereExists

$const8$thereExistAtLeast

$const9$thereExistAtMost

$const10$thereExistExactly

$list11

$list12

$const13$was

$const14$hasAlwaysBeen

$const15$willBe

$const16$willAlwaysBe

$const17$was_Metric

$const18$willBe_Metric

$const19$ExpandSubLFn

$const20$SubLQuoteFn

$const21$Quote

$const22$exceptFor

$const23$exceptWhen

$const24$abnormal

$const25$pragmaticRequirement

$const26$meetsPragmaticRequirement

$const27$querySentence

$kw28$IGNORE

$sym29$EL_RELATION_EXPRESSION_

$const30$TheList

$kw31$INCLUDE

$const32$TheEmptyList

$const33$TheEmptySet

$const34$TheSet

$const35$TheSetOf

$sym36$LISTP

$str37$A_KB_dependent_numerical_quantifi

$const38$SpecsFn

$sym39$CYC_VAR_

$sym40$GROUND_

$list41

$str42$Returns_whether_EXPRESSION_is_fre

$list43

$sym44$EL_FORMULA_P

$sym45$OPTIMIZE_EL_FORMULA_VARIABLE_NAME

$sym46$EL_VAR_

$sym47$EL_SENTENCE_P

$list48

$str49$_1

$sym50$INVALID_VARIABLE_NAME_CHAR

$const51$ExistentialQuantifier

$sym52$SUBL_ESCAPE_P

$list53

$list54

$str55$unexpected_subl_escape_type__s

$sym56$OPAQUIFY_SUBL_ESCAPE

$str57$not_a_known_quantifier___s

$str58$not_quantified_sentence___s

$sym59$EL_LIST_P

$list60

$sym61$CDOLIST

$sym62$EL_LIST_ITEMS

$list63

$sym64$CDOLIST_NUMBERED

com.cyc.cycjava.cycl
Class el_utilities

$str131$You_re_calling_the_function_A

$str133$NotifyA_if_you_receive_this_w