control_vars

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 control_vars

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

All Implemented Interfaces:: CommonSymbols, SubLFile

public final class control_vars
extends SubLTranslatedFile
extends SubLTranslatedFile

Nested Class Summary

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

Field Summary
`static SubLSymbol`	$acip_subkernel_extraction$ When non-nil, the ACIP subkernel we are currently extracting.
`static SubLSymbol`	$acip_subkernel_output_stream$ When non-nil, the stream we are using for output of the ACIP subkernel we are extracting.
`static SubLSymbol`	$agenda_display_fi_warnings$
`static SubLSymbol`	$allow_backward_gafs$ Do we allow backward gafs?
`static SubLSymbol`	$allow_forward_skolemization$ Do we allow skolemization during forward inference?
`static SubLSymbol`	$allow_the_term_unification$ Controls whether the unifier treats the-terms as variables.
`static SubLSymbol`	$application_filtering_enabled$
`static SubLSymbol`	$ask_quirkP$
`static SubLSymbol`	$assertion_truth$
`static SubLSymbol`	$assume_cyc_cyclist_dialogP$ boolean; Should we assume Cyc is talking to the currently-logged-in Cyclist when generating NL in the CB interface?
`static SubLSymbol`	$auto_increment_kb$ This determines whether or not the image will change to the next KB when the close-kb transcript operation is reached.
`static SubLSymbol`	$average_all_genls_count$ An estimate of the total number of superclasses for the average collection.
`static SubLSymbol`	$average_all_isa_count$ An estimate of the total number of types for the average term.
`static SubLSymbol`	$bootstrapping_kbP$
`static SubLSymbol`	$browse_forward_inferencesP$ Whether forward inferences will be browsable.
`static SubLSymbol`	$cache_inference_results$ Do we cache the results of successful inference in the KB?.
`static SubLSymbol`	$cached_ask_result_direction$ The direction to use for cached ask results.
`static SubLSymbol`	$candidate_assertion$ used for robust assertion lookup in find-assertions-*
`static SubLSymbol`	$caught_up_on_master_transcript$ Boolean: This is used by the agenda to decide whether or not to wait before doing another read.
`static SubLSymbol`	$cb_applicable_relations_one_per_lineP$ boolean: Should applicable relations be displayed one per line?
`static SubLSymbol`	$cb_literal_query_results_one_per_lineP$ boolean: Should literal query result terms be displayed one per line?
`static SubLSymbol`	$cb_paraphrase_applicable_relationsP$ boolean: Should applicable relations be paraphrased?
`static SubLSymbol`	$cb_skolem_applicable_relationsP$ boolean: Should skolem applicable relations be displayed?
`static SubLSymbol`	$cheap_hl_module_check_cost$ The cost value used for performing cheap fully-bound HL module checks.
`static SubLSymbol`	$check_for_circular_justs$ Do we check for circularly justified assertions?
`static SubLSymbol`	$cnf_matching_predicate$ predicate used to compare two cnfs when searching for an assertion (or axiom) in the kb
`static SubLSymbol`	$collect_justification_compilationsP$ compile successful inference chains into macro rules?
`static SubLSymbol`	$communication_mode$
`static SubLSymbol`	$complete_extent_minimization$ Do we allow use of the 'complete extent' HL inference modules?
`static SubLSymbol`	$compute_inference_results$
`static SubLSymbol`	$conflicts_from_invalid_deductions$ Do we treat semantically invalid deductions as conflicts?
`static SubLSymbol`	$current_cache$
`static SubLSymbol`	$curried_kbq_lookupP$ Whether to use #$sentenceParameterValueInSpecification, #$microtheoryParameterValueInSpecification, and #$inferenceModeParameterValueInSpecification for lookup
`static SubLSymbol`	$cyc_image_id$ A string consisting of `--' which uniquely identifies every separate Cyc image
`static SubLSymbol`	$cyc_package$
`static SubLSymbol`	$dbm_cache_loading_finishedP$
`static SubLSymbol`	$dbm_cache_loading_startedP$
`static SubLSymbol`	$dbm_init_file_loadedP$ Has the db meta query init file successfully loaded, or not?
`static SubLSymbol`	$default_removal_cost_cutoff$
`static SubLSymbol`	$ebl_trace$ tracing level for ebl module [0..5]
`static SubLSymbol`	$evaluatable_backchain_enabled$ Do we backchain on evaluatable predicates?
`static SubLSymbol`	$expensive_hl_module_check_cost$ The cost value used for performing expensive fully-bound HL module checks.
`static SubLSymbol`	$expensive_hl_module_singleton_generate_cost$ The cost value used for performing expensive HL module generations.
`static SubLSymbol`	$external_inference_enabled$ Determines whether or not External HL module inferencing is enabled.
`static SubLSymbol`	$filter_deductions_for_trivially_derivable_gafs$ Do we ignore deductions for gafs which are already trivially derivable?
`static SubLFloat`	`$float29$0_1`
`static SubLFloat`	`$float30$0_5`
`static SubLFloat`	`$float31$1_0`
`static SubLFloat`	`$float32$1_5`
`static SubLSymbol`	$forward_inference_removal_cost_cutoff$ How expensive a removal do we allow during forward inference (NIL for no restriction).
`static SubLSymbol`	$gaf_matching_predicate$ predicate used to compare two gaf formulas when searching for an assertion (or axiom) in the kb
`static SubLSymbol`	$hl_failure_backchaining$ Do we backchain on HL predicates?
`static SubLSymbol`	$hl_lock$ Controls modification of the HL store
`static SubLSymbol`	$hl_module_check_cost$ The cost value used for performing fully-bound HL module checks.
`static SubLSymbol`	$hl_module_simplification_cost$ The cost value used for performing an HL module simplification step.
`static SubLSymbol`	$ignore_conflictsP$
`static SubLSymbol`	$ignore_remote_errors$ Do we ignore remote errors or handle them the same way as local errors?.
`static SubLSymbol`	$inference_answer_handler$ The handler function to use when generating the results to return from inference searches.
`static SubLSymbol`	$inference_arg$
`static SubLSymbol`	$inference_current_node_mt_scope$
`static SubLSymbol`	$inference_debugP$ Whether the inference engine is to be run in debug mode.
`static SubLSymbol`	$inference_highly_relevant_assertions$ Axioms specified by #$highlyRelevantAssertion.
`static SubLSymbol`	$inference_highly_relevant_mts$ Microtheories specified by highlyRelevantMt.
`static SubLSymbol`	$inference_literal$
`static SubLSymbol`	$inference_more_supports$
`static SubLSymbol`	$inference_propagate_mt_scope$
`static SubLSymbol`	$inference_search_strategy$
`static SubLSymbol`	$inference_sense$
`static SubLSymbol`	$inference_the_term_bindings$
`static SubLSymbol`	$init_file_loadedP$
`static SubLInteger`	`$int26$10000`
`static SubLInteger`	`$int33$38`
`static SubLInteger`	`$int34$47`
`static SubLSymbol`	$janus_extraction_deduce_specs$
`static SubLSymbol`	$janus_new_constants$
`static SubLSymbol`	$janus_operations$
`static SubLSymbol`	$janus_tag$ This tag will be inserted into every Janus operation that is logged.
`static SubLSymbol`	$janus_test_case_loggingP$
`static SubLSymbol`	$janus_test_case_runningP$
`static SubLSymbol`	$janus_testing_deduce_specs$
`static SubLSymbol`	$janus_within_somethingP$
`static SubLSymbol`	$justification_compilations$ candidate macro rules are recorded here
`static SubLSymbol`	$kb_pedigree$
`static SubLSymbol`	$kba_pred$
`static SubLSymbol`	$kbq_run_query_auto_destroy_enabledP$ When non-nil, the inferences and problem-stores generated by KBQ-RUN-QUERY are auto-destroyed.
`static SubLSymbol`	$kbq_run_query_non_continuable_enabledP$ When non-nil, the inferences generated by KBQ-RUN-QUERY are always run with :continuable? NIL since they won't ever be continued.
`static SubLSymbol`	$keyword_package$
`static SubLSymbol`	`$kw10$FORWARD`
`static SubLSymbol`	`$kw27$HEURISTIC`
`static SubLSymbol`	`$kw42$FULL`
`static SubLSymbol`	`$kw43$TINY`
`static SubLSymbol`	`$kw45$UNKNOWN`
`static SubLSymbol`	`$kw8$TRUE`
`static SubLSymbol`	$last_agenda_error_explanatory_supports$ A list - containing either one or more assertions or a list of the form (#$equals ) - the contents of which accounts for the halting of the agenda.
`static SubLSymbol`	$last_agenda_error_message$
`static SubLSymbol`	$last_agenda_op$
`static SubLList`	`$list11`
`static SubLList`	`$list15`
`static SubLList`	`$list19`
`static SubLList`	`$list4`
`static SubLSymbol`	$mapping_answer$
`static SubLSymbol`	$mapping_any_answerP$
`static SubLSymbol`	$mapping_assertion_bookkeeping_fn$
`static SubLSymbol`	$mapping_assertion_selection_fn$
`static SubLSymbol`	$mapping_data_1$
`static SubLSymbol`	$mapping_data_2$
`static SubLSymbol`	$mapping_equality_test$
`static SubLSymbol`	$mapping_finished_fn$
`static SubLSymbol`	$mapping_fn_arg$ designates non-default argument in mapping-funcall-arg
`static SubLSymbol`	$mapping_fn_arg1$ default arg1 in mapping-funcall-arg
`static SubLSymbol`	$mapping_fn_arg2$ default arg2 in mapping-funcall-arg
`static SubLSymbol`	$mapping_fn_arg3$ default arg3 in mapping-funcall-arg
`static SubLSymbol`	$mapping_fn_arg4$ default arg4 in mapping-funcall-arg
`static SubLSymbol`	$mapping_fn_arg5$ default arg5 in mapping-funcall-arg
`static SubLSymbol`	$mapping_fn_arg6$ default arg6 in mapping-funcall-arg
`static SubLSymbol`	$mapping_fn_arg7$ default arg7 in mapping-funcall-arg
`static SubLSymbol`	$mapping_fn_arg8$ default arg8 in mapping-funcall-arg
`static SubLSymbol`	$mapping_fn$ function applied in mapping-funcall-arg
`static SubLSymbol`	$mapping_gather_arg$
`static SubLSymbol`	$mapping_gather_args$
`static SubLSymbol`	$mapping_gather_key_args$
`static SubLSymbol`	$mapping_gather_key$
`static SubLSymbol`	$mapping_index_arg$
`static SubLSymbol`	$mapping_output_stream$
`static SubLSymbol`	$mapping_path$
`static SubLSymbol`	$mapping_pivot_arg$
`static SubLSymbol`	$mapping_pred$
`static SubLSymbol`	$mapping_relation$
`static SubLSymbol`	$mapping_source$
`static SubLSymbol`	$mapping_target_arg$
`static SubLSymbol`	$mapping_target$
`static SubLSymbol`	$marking_doomed_inference_ancestors$ When a goal node is rejected, do we mark all its semantically invalid ancestors as doomed, thereby cutting off large chunks of search which will fail.
`static SubLSymbol`	$maximum_hl_module_check_cost$ When non-nil, the maximum cost value allowable for fully-bound HL module checks.
`static SubLSymbol`	$meta_query_start_string$
`static SubLSymbol`	$nat_matching_predicate$ predicate used to compare two nat formulas when searching for a reified nat in the kb
`static SubLSymbol`	$negation_by_failure$ Do we allow the minimization inference methods to fire?
`static SubLSymbol`	$perform_equals_unification$ Do we use #$equals assertions within term unification?
`static SubLSymbol`	$perform_unification_occurs_check$ Do we check for and reject unifications where a variable appears in its own binding?
`static SubLSymbol`	$pgia_activeP$
`static SubLSymbol`	$prefer_forward_skolemization$ Do we prefer skolemization during forward inference? This option will make forward inference tend not to unify to existing NARTs so that new NARTs can be created if they would come into existence (see nat-lookup-pos-preference.)
`static SubLSymbol`	$proof_checker_rules$ allowable rules
`static SubLSymbol`	$proof_checking_enabled$ Are we using the inference engine as a proof-checker?
`static SubLSymbol`	$query_properties_inherited_by_recursive_queries$ The query properties that should be inherited by recursive queries.
`static SubLSymbol`	$read_require_constant_exists$ Does the #$ reader error if the referenced constant does not exist?
`static SubLSymbol`	$record_inconsistent_support_sets$ When non-nil, sets of mutually inconsistent HL supports are stored on the variable inconsistent-support-sets
`static SubLSymbol`	$removal_cost_cutoff$ How expensive a removal do we allow (NIL for no restriction).
`static SubLSymbol`	$rkf_mt$ The mt within which RKF interactions are assumed.
`static SubLSymbol`	$run_own_operationsP$
`static SubLSymbol`	$save_asked_queriesP$ Whether to save queries asked into a query transcript.
`static SubLSymbol`	$show_assertions_in_english$ boolean; Should assertions be displayed in English?
`static SubLSymbol`	$show_fet_create_instance_buttonsP$ boolean: Should collections have links to create instance with FET?
`static SubLSymbol`	$show_fet_create_spec_buttonsP$ boolean: Should collections have links to create spec with FET?
`static SubLSymbol`	$show_fet_edit_buttonsP$ boolean: Should terms have links to edit term with FET?
`static SubLSymbol`	$standard_indent_string$
`static SubLString`	`$str13$Enable_HL_predicate_backchaining`
`static SubLString`	`$str14$This_controls_whether_or_not_we_a`
`static SubLString`	`$str17$Enable_negation_by_failure`
`static SubLString`	`$str18$This_controls_whether_or_not_we_a`
`static SubLString`	`$str2$HL_Store_Lock`
`static SubLString`	`$str21$Enable_complete_extent_minimizati`
`static SubLString`	`$str22$This_controls_whether_or_not_we_a`
`static SubLString`	`$str24$Enable_unbound_predicate_rule_bac`
`static SubLString`	`$str25$This_controls_whether_or_not_we_a`
`static SubLString`	`$str37$UNKNOWN`
`static SubLString`	`$str38$_a__a__a`
`static SubLString`	`$str5$KEYWORD`
`static SubLString`	`$str51$Cache_backward_query_results`
`static SubLString`	`$str52$This_controls_whether_the_results`
`static SubLString`	`$str6$SUBLISP`
`static SubLString`	`$str7$CYC`
`static SubLString`	`$str9$_`
`static SubLSymbol`	$sublisp_package$
`static SubLSymbol`	$suppress_conflict_noticesP$
`static SubLSymbol`	`$sym0$_TABLE_AREA_`
`static SubLSymbol`	`$sym1$_HL_LOCK_`
`static SubLSymbol`	`$sym12$_HL_FAILURE_BACKCHAINING_`
`static SubLSymbol`	`$sym16$_NEGATION_BY_FAILURE_`
`static SubLSymbol`	`$sym20$_COMPLETE_EXTENT_MINIMIZATION_`
`static SubLSymbol`	`$sym23$_UNBOUND_RULE_BACKCHAIN_ENABLED_`
`static SubLSymbol`	`$sym28$INFERENCE_RETURN_BLISTS`
`static SubLSymbol`	`$sym3$WITH_LOCK_HELD`
`static SubLSymbol`	`$sym35$_AUTO_INCREMENT_KB_`
`static SubLSymbol`	`$sym36$BOOLEANP`
`static SubLSymbol`	`$sym39$_BUILD_KB_LOADED_`
`static SubLSymbol`	`$sym40$INTEGERP`
`static SubLSymbol`	`$sym41$_KB_LOADED_`
`static SubLSymbol`	`$sym44$_KB_PEDIGREE_`
`static SubLSymbol`	`$sym46$_RUN_OWN_OPERATIONS__`
`static SubLSymbol`	`$sym47$_CAUGHT_UP_ON_MASTER_TRANSCRIPT_`
`static SubLSymbol`	`$sym48$_COMMUNICATION_MODE_`
`static SubLSymbol`	`$sym49$_INIT_FILE_LOADED__`
`static SubLSymbol`	`$sym50$_CACHE_INFERENCE_RESULTS_`
`static SubLSymbol`	`$sym53$_ACIP_SUBKERNEL_EXTRACTION_`
`static SubLSymbol`	`$sym54$_ACIP_SUBKERNEL_OUTPUT_STREAM_`
`static SubLSymbol`	$table_area$
`static SubLSymbol`	$term_functional_complexity_cutoff$ The maximum function complexity of CycL allowed by the system.
`static SubLSymbol`	$term_relational_complexity_cutoff$ The maximum relation complexity of CycL allowed by the system.
`static SubLSymbol`	$the_term_inference_enabled$ Global control of whether we ever allow any the-term reasoning at all.
`static SubLSymbol`	$the_term_qua_constant$
`static SubLSymbol`	$transformation_depth_cutoff$
`static SubLSymbol`	$typical_hl_module_check_cost$ The cost value used for performing typical fully-bound HL module checks.
`static SubLSymbol`	$unbound_rule_backchain_enabled$ Do we allow backchaining using the unbound rule index.
`static SubLSymbol`	$unencapsulating_within_agenda$
`static SubLSymbol`	$unique_inference_result_bindings$
`static SubLSymbol`	$use_transcriptP$
`static SubLSymbol`	$variable_names$
`static SubLSymbol`	$within_ask$
`static SubLSymbol`	$within_assert$
`static SubLSymbol`	$within_hl_failure_backchainingP$
`static SubLSymbol`	$within_query$
`static SubLSymbol`	$within_unassert$
`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`	`browse_forward_inferencesP()`
`static SubLObject`	`cyc_image_id()` Accessor for cyc-image-id.
`static SubLObject`	`declare_control_vars_file()`
`void`	`declareFunctions()` Declares the mapping between functions and symbols for all named functions defined in the file.
`static SubLObject`	`init_control_vars_file()`
`void`	`initializeVariables()` Initializes all global variables and private internal variables for constants defined in the file.
`static SubLObject`	`kb_loaded()`
`static SubLObject`	`make_cyc_image_id()` Make a unique identifier for a Cyc image: `--'.
`static SubLObject`	`non_tiny_kb_loadedP()` Does the KB contain a nontrivial amount that is not the core (tiny) KB?
`void`	`runTopLevelForms()` Runs all top-level forms in order.
`static SubLObject`	`save_asked_queriesP()`
`static SubLObject`	`set_build_kb_loaded(SubLObject kb)`
`static SubLObject`	`set_cyc_image_id()`
`static SubLObject`	`set_kb_loaded(SubLObject kb)`
`static SubLObject`	`setup_control_vars_file()`
`static SubLObject`	`within_askP()`
`static SubLObject`	`within_assertP()`
`static SubLObject`	`within_queryP()`

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

$read_require_constant_exists$

public static SubLSymbol $read_require_constant_exists$

Does the #$ reader error if the referenced constant does not exist?

$table_area$

public static SubLSymbol $table_area$

$rkf_mt$

public static SubLSymbol $rkf_mt$

The mt within which RKF interactions are assumed.

$hl_lock$

public static SubLSymbol $hl_lock$

Controls modification of the HL store

$bootstrapping_kbP$

public static SubLSymbol $bootstrapping_kbP$

$keyword_package$

public static SubLSymbol $keyword_package$

$sublisp_package$

public static SubLSymbol $sublisp_package$

$cyc_package$

public static SubLSymbol $cyc_package$

$cnf_matching_predicate$

public static SubLSymbol $cnf_matching_predicate$

predicate used to compare two cnfs when searching for an assertion (or axiom) in the kb

$gaf_matching_predicate$

public static SubLSymbol $gaf_matching_predicate$

predicate used to compare two gaf formulas when searching for an assertion (or axiom) in the kb

$nat_matching_predicate$

public static SubLSymbol $nat_matching_predicate$

predicate used to compare two nat formulas when searching for a reified nat in the kb

$candidate_assertion$

public static SubLSymbol $candidate_assertion$

used for robust assertion lookup in find-assertions-*

$variable_names$

public static SubLSymbol $variable_names$

$assertion_truth$

public static SubLSymbol $assertion_truth$

$mapping_answer$

public static SubLSymbol $mapping_answer$

$mapping_pred$

public static SubLSymbol $mapping_pred$

$mapping_source$

public static SubLSymbol $mapping_source$

$mapping_target$

public static SubLSymbol $mapping_target$

$mapping_target_arg$

public static SubLSymbol $mapping_target_arg$

$mapping_index_arg$

public static SubLSymbol $mapping_index_arg$

$mapping_gather_arg$

public static SubLSymbol $mapping_gather_arg$

$mapping_gather_args$

public static SubLSymbol $mapping_gather_args$

$mapping_output_stream$

public static SubLSymbol $mapping_output_stream$

$mapping_equality_test$

public static SubLSymbol $mapping_equality_test$

$mapping_any_answerP$

public static SubLSymbol $mapping_any_answerP$

$mapping_relation$

public static SubLSymbol $mapping_relation$

$mapping_finished_fn$

public static SubLSymbol $mapping_finished_fn$

$mapping_path$

public static SubLSymbol $mapping_path$

$mapping_data_1$

public static SubLSymbol $mapping_data_1$

$mapping_data_2$

public static SubLSymbol $mapping_data_2$

$mapping_pivot_arg$

public static SubLSymbol $mapping_pivot_arg$

$mapping_gather_key$

public static SubLSymbol $mapping_gather_key$

$mapping_gather_key_args$

public static SubLSymbol $mapping_gather_key_args$

$mapping_assertion_selection_fn$

public static SubLSymbol $mapping_assertion_selection_fn$

$mapping_assertion_bookkeeping_fn$

public static SubLSymbol $mapping_assertion_bookkeeping_fn$

$mapping_fn$

public static SubLSymbol $mapping_fn$

function applied in mapping-funcall-arg

$mapping_fn_arg$

public static SubLSymbol $mapping_fn_arg$

designates non-default argument in mapping-funcall-arg

$mapping_fn_arg1$

public static SubLSymbol $mapping_fn_arg1$

default arg1 in mapping-funcall-arg

$mapping_fn_arg2$

public static SubLSymbol $mapping_fn_arg2$

default arg2 in mapping-funcall-arg

$mapping_fn_arg3$

public static SubLSymbol $mapping_fn_arg3$

default arg3 in mapping-funcall-arg

$mapping_fn_arg4$

public static SubLSymbol $mapping_fn_arg4$

default arg4 in mapping-funcall-arg

$mapping_fn_arg5$

public static SubLSymbol $mapping_fn_arg5$

default arg5 in mapping-funcall-arg

$mapping_fn_arg6$

public static SubLSymbol $mapping_fn_arg6$

default arg6 in mapping-funcall-arg

$mapping_fn_arg7$

public static SubLSymbol $mapping_fn_arg7$

default arg7 in mapping-funcall-arg

$mapping_fn_arg8$

public static SubLSymbol $mapping_fn_arg8$

default arg8 in mapping-funcall-arg

$kba_pred$

public static SubLSymbol $kba_pred$

$standard_indent_string$

public static SubLSymbol $standard_indent_string$

$term_functional_complexity_cutoff$

public static SubLSymbol $term_functional_complexity_cutoff$

The maximum function complexity of CycL allowed by the system. NIL means 'no limit'.

$term_relational_complexity_cutoff$

public static SubLSymbol $term_relational_complexity_cutoff$

The maximum relation complexity of CycL allowed by the system. NIL means 'no limit'.

$collect_justification_compilationsP$

public static SubLSymbol $collect_justification_compilationsP$

compile successful inference chains into macro rules?

$justification_compilations$

public static SubLSymbol $justification_compilations$

candidate macro rules are recorded here

$ebl_trace$

public static SubLSymbol $ebl_trace$

tracing level for ebl module [0..5]

$allow_forward_skolemization$

public static SubLSymbol $allow_forward_skolemization$

Do we allow skolemization during forward inference?

$prefer_forward_skolemization$

public static SubLSymbol $prefer_forward_skolemization$

Do we prefer skolemization during forward inference? This option will make forward inference tend not to unify to existing NARTs so that new NARTs can be created if they would come into existence (see nat-lookup-pos-preference.)

$perform_unification_occurs_check$

public static SubLSymbol $perform_unification_occurs_check$

Do we check for and reject unifications where a variable appears in its own binding?

$perform_equals_unification$

public static SubLSymbol $perform_equals_unification$

Do we use #$equals assertions within term unification?

$allow_backward_gafs$

public static SubLSymbol $allow_backward_gafs$

Do we allow backward gafs?

$cached_ask_result_direction$

public static SubLSymbol $cached_ask_result_direction$

The direction to use for cached ask results.

$check_for_circular_justs$

public static SubLSymbol $check_for_circular_justs$

Do we check for circularly justified assertions?

$filter_deductions_for_trivially_derivable_gafs$

public static SubLSymbol $filter_deductions_for_trivially_derivable_gafs$

Do we ignore deductions for gafs which are already trivially derivable?

$inference_debugP$

public static SubLSymbol $inference_debugP$

Whether the inference engine is to be run in debug mode.

$browse_forward_inferencesP$

public static SubLSymbol $browse_forward_inferencesP$

Whether forward inferences will be browsable. If NIL, they will be destroyed after use, along with their problem stores. If T, problem store destruction may never happen for many problem stores--BE CAREFUL

$query_properties_inherited_by_recursive_queries$

public static SubLSymbol $query_properties_inherited_by_recursive_queries$

The query properties that should be inherited by recursive queries.

$proof_checking_enabled$

public static SubLSymbol $proof_checking_enabled$

Are we using the inference engine as a proof-checker?

$proof_checker_rules$

public static SubLSymbol $proof_checker_rules$

allowable rules

$inference_propagate_mt_scope$

public static SubLSymbol $inference_propagate_mt_scope$

$inference_current_node_mt_scope$

public static SubLSymbol $inference_current_node_mt_scope$

$inference_literal$

public static SubLSymbol $inference_literal$

$inference_sense$

public static SubLSymbol $inference_sense$

$inference_arg$

public static SubLSymbol $inference_arg$

$inference_more_supports$

public static SubLSymbol $inference_more_supports$

$inference_highly_relevant_assertions$

public static SubLSymbol $inference_highly_relevant_assertions$

Axioms specified by #$highlyRelevantAssertion.

$inference_highly_relevant_mts$

public static SubLSymbol $inference_highly_relevant_mts$

Microtheories specified by highlyRelevantMt.

$within_hl_failure_backchainingP$

public static SubLSymbol $within_hl_failure_backchainingP$

$hl_failure_backchaining$

public static SubLSymbol $hl_failure_backchaining$

Do we backchain on HL predicates?

$evaluatable_backchain_enabled$

public static SubLSymbol $evaluatable_backchain_enabled$

Do we backchain on evaluatable predicates?

$negation_by_failure$

public static SubLSymbol $negation_by_failure$

Do we allow the minimization inference methods to fire?

$complete_extent_minimization$

public static SubLSymbol $complete_extent_minimization$

Do we allow use of the 'complete extent' HL inference modules?

$unbound_rule_backchain_enabled$

public static SubLSymbol $unbound_rule_backchain_enabled$

Do we allow backchaining using the unbound rule index.

$default_removal_cost_cutoff$

public static SubLSymbol $default_removal_cost_cutoff$

$removal_cost_cutoff$

public static SubLSymbol $removal_cost_cutoff$

How expensive a removal do we allow (NIL for no restriction).

$forward_inference_removal_cost_cutoff$

public static SubLSymbol $forward_inference_removal_cost_cutoff$

How expensive a removal do we allow during forward inference (NIL for no restriction).

$application_filtering_enabled$

public static SubLSymbol $application_filtering_enabled$

$marking_doomed_inference_ancestors$

public static SubLSymbol $marking_doomed_inference_ancestors$

When a goal node is rejected, do we mark all its semantically invalid ancestors as doomed, thereby cutting off large chunks of search which will fail.

$inference_search_strategy$

public static SubLSymbol $inference_search_strategy$

$unique_inference_result_bindings$

public static SubLSymbol $unique_inference_result_bindings$

$inference_answer_handler$

public static SubLSymbol $inference_answer_handler$

The handler function to use when generating the results to return from inference searches.

$hl_module_simplification_cost$

public static SubLSymbol $hl_module_simplification_cost$

The cost value used for performing an HL module simplification step.

$hl_module_check_cost$

public static SubLSymbol $hl_module_check_cost$

The cost value used for performing fully-bound HL module checks.

$cheap_hl_module_check_cost$

public static SubLSymbol $cheap_hl_module_check_cost$

The cost value used for performing cheap fully-bound HL module checks.

$typical_hl_module_check_cost$

public static SubLSymbol $typical_hl_module_check_cost$

The cost value used for performing typical fully-bound HL module checks.

$expensive_hl_module_check_cost$

public static SubLSymbol $expensive_hl_module_check_cost$

The cost value used for performing expensive fully-bound HL module checks.

$expensive_hl_module_singleton_generate_cost$

public static SubLSymbol $expensive_hl_module_singleton_generate_cost$

The cost value used for performing expensive HL module generations.

$maximum_hl_module_check_cost$

public static SubLSymbol $maximum_hl_module_check_cost$

When non-nil, the maximum cost value allowable for fully-bound HL module checks.

$average_all_isa_count$

public static SubLSymbol $average_all_isa_count$

An estimate of the total number of types for the average term.

$average_all_genls_count$

public static SubLSymbol $average_all_genls_count$

An estimate of the total number of superclasses for the average collection.

$pgia_activeP$

public static SubLSymbol $pgia_activeP$

$the_term_inference_enabled$

public static SubLSymbol $the_term_inference_enabled$

Global control of whether we ever allow any the-term reasoning at all.

$allow_the_term_unification$

public static SubLSymbol $allow_the_term_unification$

Controls whether the unifier treats the-terms as variables. Should always be globally NIL and bound to T by the-term inference methods.

$inference_the_term_bindings$

public static SubLSymbol $inference_the_term_bindings$

$the_term_qua_constant$

public static SubLSymbol $the_term_qua_constant$

$external_inference_enabled$

public static SubLSymbol $external_inference_enabled$

Determines whether or not External HL module inferencing is enabled.

$suppress_conflict_noticesP$

public static SubLSymbol $suppress_conflict_noticesP$

$ignore_conflictsP$

public static SubLSymbol $ignore_conflictsP$

$conflicts_from_invalid_deductions$

public static SubLSymbol $conflicts_from_invalid_deductions$

Do we treat semantically invalid deductions as conflicts?

$record_inconsistent_support_sets$

public static SubLSymbol $record_inconsistent_support_sets$

When non-nil, sets of mutually inconsistent HL supports are stored on the variable *inconsistent-support-sets*

$last_agenda_op$

public static SubLSymbol $last_agenda_op$

$last_agenda_error_message$

public static SubLSymbol $last_agenda_error_message$

$last_agenda_error_explanatory_supports$

public static SubLSymbol $last_agenda_error_explanatory_supports$

A list - containing either one or more assertions or a list of the form (#$equals ) - the contents of which accounts for the halting of the agenda.

$agenda_display_fi_warnings$

public static SubLSymbol $agenda_display_fi_warnings$

$ignore_remote_errors$

public static SubLSymbol $ignore_remote_errors$

Do we ignore remote errors or handle them the same way as local errors?.

$auto_increment_kb$

public static SubLSymbol $auto_increment_kb$

This determines whether or not the image will change to the next KB when the close-kb transcript operation is reached.

$cyc_image_id$

public static SubLSymbol $cyc_image_id$

A string consisting of `--' which uniquely identifies every separate Cyc image

$kb_pedigree$

public static SubLSymbol $kb_pedigree$

$use_transcriptP$

public static SubLSymbol $use_transcriptP$

$run_own_operationsP$

public static SubLSymbol $run_own_operationsP$

$caught_up_on_master_transcript$

public static SubLSymbol $caught_up_on_master_transcript$

Boolean: This is used by the agenda to decide whether or not to wait before doing another read.

$communication_mode$

public static SubLSymbol $communication_mode$

$unencapsulating_within_agenda$

public static SubLSymbol $unencapsulating_within_agenda$

$save_asked_queriesP$

public static SubLSymbol $save_asked_queriesP$

Whether to save queries asked into a query transcript.

$init_file_loadedP$

public static SubLSymbol $init_file_loadedP$

$within_assert$

public static SubLSymbol $within_assert$

$within_unassert$

public static SubLSymbol $within_unassert$

$within_ask$

public static SubLSymbol $within_ask$

$within_query$

public static SubLSymbol $within_query$

$compute_inference_results$

public static SubLSymbol $compute_inference_results$

$cache_inference_results$

public static SubLSymbol $cache_inference_results$

Do we cache the results of successful inference in the KB?.

$transformation_depth_cutoff$

public static SubLSymbol $transformation_depth_cutoff$

$show_assertions_in_english$

public static SubLSymbol $show_assertions_in_english$

boolean; Should assertions be displayed in English?

$assume_cyc_cyclist_dialogP$

public static SubLSymbol $assume_cyc_cyclist_dialogP$

boolean; Should we assume Cyc is talking to the currently-logged-in Cyclist when generating NL in the CB interface?

$show_fet_edit_buttonsP$

public static SubLSymbol $show_fet_edit_buttonsP$

boolean: Should terms have links to edit term with FET?

$show_fet_create_instance_buttonsP$

public static SubLSymbol $show_fet_create_instance_buttonsP$

boolean: Should collections have links to create instance with FET?

$show_fet_create_spec_buttonsP$

public static SubLSymbol $show_fet_create_spec_buttonsP$

boolean: Should collections have links to create spec with FET?

$cb_literal_query_results_one_per_lineP$

public static SubLSymbol $cb_literal_query_results_one_per_lineP$

boolean: Should literal query result terms be displayed one per line?

$cb_skolem_applicable_relationsP$

public static SubLSymbol $cb_skolem_applicable_relationsP$

boolean: Should skolem applicable relations be displayed?

$cb_applicable_relations_one_per_lineP$

public static SubLSymbol $cb_applicable_relations_one_per_lineP$

boolean: Should applicable relations be displayed one per line?

$cb_paraphrase_applicable_relationsP$

public static SubLSymbol $cb_paraphrase_applicable_relationsP$

boolean: Should applicable relations be paraphrased?

$meta_query_start_string$

public static SubLSymbol $meta_query_start_string$

$current_cache$

public static SubLSymbol $current_cache$

$dbm_init_file_loadedP$

public static SubLSymbol $dbm_init_file_loadedP$

Has the db meta query init file successfully loaded, or not?

$dbm_cache_loading_startedP$

public static SubLSymbol $dbm_cache_loading_startedP$

$dbm_cache_loading_finishedP$

public static SubLSymbol $dbm_cache_loading_finishedP$

$acip_subkernel_extraction$

public static SubLSymbol $acip_subkernel_extraction$

When non-nil, the ACIP subkernel we are currently extracting.

$acip_subkernel_output_stream$

public static SubLSymbol $acip_subkernel_output_stream$

When non-nil, the stream we are using for output of the ACIP subkernel we are extracting.

$janus_tag$

public static SubLSymbol $janus_tag$

This tag will be inserted into every Janus operation that is logged.

$janus_new_constants$

public static SubLSymbol $janus_new_constants$

$janus_test_case_loggingP$

public static SubLSymbol $janus_test_case_loggingP$

$janus_operations$

public static SubLSymbol $janus_operations$

$janus_extraction_deduce_specs$

public static SubLSymbol $janus_extraction_deduce_specs$

$janus_within_somethingP$

public static SubLSymbol $janus_within_somethingP$

$janus_testing_deduce_specs$

public static SubLSymbol $janus_testing_deduce_specs$

$janus_test_case_runningP$

public static SubLSymbol $janus_test_case_runningP$

$ask_quirkP$

public static SubLSymbol $ask_quirkP$

$curried_kbq_lookupP$

public static SubLSymbol $curried_kbq_lookupP$

Whether to use #$sentenceParameterValueInSpecification, #$microtheoryParameterValueInSpecification, and #$inferenceModeParameterValueInSpecification for lookup

$kbq_run_query_auto_destroy_enabledP$

public static SubLSymbol $kbq_run_query_auto_destroy_enabledP$

When non-nil, the inferences and problem-stores generated by KBQ-RUN-QUERY are auto-destroyed.

$kbq_run_query_non_continuable_enabledP$

public static SubLSymbol $kbq_run_query_non_continuable_enabledP$

When non-nil, the inferences generated by KBQ-RUN-QUERY are always run with :continuable? NIL since they won't ever be continued.

$sym0$_TABLE_AREA_

public static final SubLSymbol $sym0$_TABLE_AREA_

$sym1$_HL_LOCK_

public static final SubLSymbol $sym1$_HL_LOCK_

$str2$HL_Store_Lock

public static final SubLString $str2$HL_Store_Lock

$sym3$WITH_LOCK_HELD

public static final SubLSymbol $sym3$WITH_LOCK_HELD

$list4

public static final SubLList $list4

$str5$KEYWORD

public static final SubLString $str5$KEYWORD

$str6$SUBLISP

public static final SubLString $str6$SUBLISP

$str7$CYC

public static final SubLString $str7$CYC

$kw8$TRUE

public static final SubLSymbol $kw8$TRUE

$str9$_

public static final SubLString $str9$_

$kw10$FORWARD

public static final SubLSymbol $kw10$FORWARD

$list11

public static final SubLList $list11

$sym12$_HL_FAILURE_BACKCHAINING_

public static final SubLSymbol $sym12$_HL_FAILURE_BACKCHAINING_

$str13$Enable_HL_predicate_backchaining

public static final SubLString $str13$Enable_HL_predicate_backchaining

$str14$This_controls_whether_or_not_we_a

public static final SubLString $str14$This_controls_whether_or_not_we_a

$list15

public static final SubLList $list15

$sym16$_NEGATION_BY_FAILURE_

public static final SubLSymbol $sym16$_NEGATION_BY_FAILURE_

$str17$Enable_negation_by_failure

public static final SubLString $str17$Enable_negation_by_failure

$str18$This_controls_whether_or_not_we_a

public static final SubLString $str18$This_controls_whether_or_not_we_a

$list19

public static final SubLList $list19

$sym20$_COMPLETE_EXTENT_MINIMIZATION_

public static final SubLSymbol $sym20$_COMPLETE_EXTENT_MINIMIZATION_

$str21$Enable_complete_extent_minimizati

public static final SubLString $str21$Enable_complete_extent_minimizati

$str22$This_controls_whether_or_not_we_a

public static final SubLString $str22$This_controls_whether_or_not_we_a

$sym23$_UNBOUND_RULE_BACKCHAIN_ENABLED_

public static final SubLSymbol $sym23$_UNBOUND_RULE_BACKCHAIN_ENABLED_

$str24$Enable_unbound_predicate_rule_bac

public static final SubLString $str24$Enable_unbound_predicate_rule_bac

$str25$This_controls_whether_or_not_we_a

public static final SubLString $str25$This_controls_whether_or_not_we_a

$int26$10000

public static final SubLInteger $int26$10000

$kw27$HEURISTIC

public static final SubLSymbol $kw27$HEURISTIC

$sym28$INFERENCE_RETURN_BLISTS

public static final SubLSymbol $sym28$INFERENCE_RETURN_BLISTS

$float29$0_1

public static final SubLFloat $float29$0_1

$float30$0_5

public static final SubLFloat $float30$0_5

$float31$1_0

public static final SubLFloat $float31$1_0

$float32$1_5

public static final SubLFloat $float32$1_5

$int33$38

public static final SubLInteger $int33$38

$int34$47

public static final SubLInteger $int34$47

$sym35$_AUTO_INCREMENT_KB_

public static final SubLSymbol $sym35$_AUTO_INCREMENT_KB_

$sym36$BOOLEANP

public static final SubLSymbol $sym36$BOOLEANP

$str37$UNKNOWN

public static final SubLString $str37$UNKNOWN

$str38$_aaa

public static final SubLString $str38$_a__a__a

$sym39$_BUILD_KB_LOADED_

public static final SubLSymbol $sym39$_BUILD_KB_LOADED_

$sym40$INTEGERP

public static final SubLSymbol $sym40$INTEGERP

$sym41$_KB_LOADED_

public static final SubLSymbol $sym41$_KB_LOADED_

$kw42$FULL

public static final SubLSymbol $kw42$FULL

$kw43$TINY

public static final SubLSymbol $kw43$TINY

$sym44$_KB_PEDIGREE_

public static final SubLSymbol $sym44$_KB_PEDIGREE_

$kw45$UNKNOWN

public static final SubLSymbol $kw45$UNKNOWN

$sym46$_RUN_OWN_OPERATIONS__

public static final SubLSymbol $sym46$_RUN_OWN_OPERATIONS__

$sym47$_CAUGHT_UP_ON_MASTER_TRANSCRIPT_

public static final SubLSymbol $sym47$_CAUGHT_UP_ON_MASTER_TRANSCRIPT_

$sym48$_COMMUNICATION_MODE_

public static final SubLSymbol $sym48$_COMMUNICATION_MODE_

$sym49$_INIT_FILE_LOADED__

public static final SubLSymbol $sym49$_INIT_FILE_LOADED__

$sym50$_CACHE_INFERENCE_RESULTS_

public static final SubLSymbol $sym50$_CACHE_INFERENCE_RESULTS_

$str51$Cache_backward_query_results

public static final SubLString $str51$Cache_backward_query_results

$str52$This_controls_whether_the_results

public static final SubLString $str52$This_controls_whether_the_results

$sym53$_ACIP_SUBKERNEL_EXTRACTION_

public static final SubLSymbol $sym53$_ACIP_SUBKERNEL_EXTRACTION_

$sym54$_ACIP_SUBKERNEL_OUTPUT_STREAM_

public static final SubLSymbol $sym54$_ACIP_SUBKERNEL_OUTPUT_STREAM_

Method Detail

browse_forward_inferencesP

public static final SubLObject browse_forward_inferencesP()

make_cyc_image_id

public static final SubLObject make_cyc_image_id()

Make a unique identifier for a Cyc image: `--'.

set_cyc_image_id

public static final SubLObject set_cyc_image_id()

cyc_image_id

public static final SubLObject cyc_image_id()

Accessor for *cyc-image-id*.

set_build_kb_loaded

public static final SubLObject set_build_kb_loaded(SubLObject kb)

kb_loaded

public static final SubLObject kb_loaded()

Returns:: nil or integerp; Return the current KB version.

set_kb_loaded

public static final SubLObject set_kb_loaded(SubLObject kb)

non_tiny_kb_loadedP

public static final SubLObject non_tiny_kb_loadedP()

Does the KB contain a nontrivial amount that is not the core (tiny) KB?

save_asked_queriesP

public static final SubLObject save_asked_queriesP()

within_askP

public static final SubLObject within_askP()

within_queryP

public static final SubLObject within_queryP()

within_assertP

public static final SubLObject within_assertP()

declare_control_vars_file

public static final SubLObject declare_control_vars_file()

init_control_vars_file

public static final SubLObject init_control_vars_file()

setup_control_vars_file

public static final SubLObject setup_control_vars_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 control_vars

me

myName

$read_require_constant_exists$

$table_area$

$rkf_mt$

$hl_lock$

$bootstrapping_kbP$

$keyword_package$

$sublisp_package$

$cyc_package$

$cnf_matching_predicate$

$gaf_matching_predicate$

$nat_matching_predicate$

$candidate_assertion$

$variable_names$

$assertion_truth$

$mapping_answer$

$mapping_pred$

$mapping_source$

$mapping_target$

$mapping_target_arg$

$mapping_index_arg$

$mapping_gather_arg$

$mapping_gather_args$

$mapping_output_stream$

$mapping_equality_test$

$mapping_any_answerP$

$mapping_relation$

$mapping_finished_fn$

$mapping_path$

$mapping_data_1$

$mapping_data_2$

$mapping_pivot_arg$

$mapping_gather_key$

$mapping_gather_key_args$

$mapping_assertion_selection_fn$

$mapping_assertion_bookkeeping_fn$

$mapping_fn$

$mapping_fn_arg$

$mapping_fn_arg1$

$mapping_fn_arg2$

$mapping_fn_arg3$

$mapping_fn_arg4$

$mapping_fn_arg5$

$mapping_fn_arg6$

$mapping_fn_arg7$

$mapping_fn_arg8$

$kba_pred$

$standard_indent_string$

$term_functional_complexity_cutoff$

$term_relational_complexity_cutoff$

$collect_justification_compilationsP$

$justification_compilations$

$ebl_trace$

$allow_forward_skolemization$

$prefer_forward_skolemization$

$perform_unification_occurs_check$

$perform_equals_unification$

$allow_backward_gafs$

$cached_ask_result_direction$

$check_for_circular_justs$

$filter_deductions_for_trivially_derivable_gafs$

$inference_debugP$

$browse_forward_inferencesP$

$query_properties_inherited_by_recursive_queries$

$proof_checking_enabled$

$proof_checker_rules$

$inference_propagate_mt_scope$

$inference_current_node_mt_scope$

$inference_literal$

$inference_sense$

$inference_arg$

$inference_more_supports$

$inference_highly_relevant_assertions$

$inference_highly_relevant_mts$

$within_hl_failure_backchainingP$

$hl_failure_backchaining$

$evaluatable_backchain_enabled$

$negation_by_failure$

com.cyc.cycjava.cycl
Class control_vars