{"id":"W2105146990","doi":"10.1145/1614431.1614437","title":"Higher-order term indexing using substitution trees","year":2009,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Search engine indexing; Substitution (logic); Decidability; Computer science; Preorder; Term (time); Undecidable problem; Correctness; Order (exchange); Generalization; Lexicographical order; Rewriting; Set (abstract data type); Theoretical computer science; Mathematics; Algorithm; Discrete mathematics; Programming language; Combinatorics; Information retrieval","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001626343,0.0001835353,0.0001686214,0.0002035996,0.0004444297,0.0001953538,0.0005726845,0.0001010377,0.00003939531],"category_scores_gemma":[0.00001337267,0.0001645891,0.00009943661,0.0006024371,0.00005516857,0.0004717284,0.000009152091,0.0001864615,0.0000759739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001093813,"about_ca_system_score_gemma":0.00009482567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002354367,"about_ca_topic_score_gemma":0.000006382041,"domain_scores_codex":[0.9986019,0.00007719655,0.0002794498,0.000404466,0.0003700073,0.0002670217],"domain_scores_gemma":[0.9991528,0.0001337086,0.0001026561,0.0003768886,0.0001508341,0.00008314662],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001156892,0.0002727078,0.0001247976,0.000006986056,0.00002936106,0.00002012708,0.0001849909,0.434296,0.0002401383,0.4875365,0.00001702078,0.07725973],"study_design_scores_gemma":[0.001055531,0.0005011277,0.02708503,0.00001985814,0.000033818,0.0001407559,0.00002353786,0.1865266,0.0003388112,0.7817532,0.001927711,0.0005941003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006181455,0.00007820076,0.9905441,0.00106375,0.0006796174,0.0001836367,0.00000144757,0.0003203355,0.0009474513],"genre_scores_gemma":[0.9021199,0.00000323671,0.09703092,0.0005963216,0.00008897176,0.000007975159,0.00001004852,0.000005958651,0.0001366292],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8959385,"threshold_uncertainty_score":0.6711747,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05282286613692782,"score_gpt":0.2922538593864074,"score_spread":0.2394309932494795,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}