{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001419088,0.0006420665,0.001094828,0.002405268,0.001130675,0.003060628,0.002222469,0.0008978068,0.006732358],"category_scores_gemma":[0.003790309,0.0006285362,0.00177599,0.004190372,0.001855438,0.006341379,0.002701911,0.001847834,0.004195236],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001269682,"about_ca_system_score_gemma":0.0020493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002448802,"about_ca_topic_score_gemma":0.002803975,"domain_scores_codex":[0.9979289,0.0002952274,0.0003082238,0.0003373174,0.000894459,0.0002358634],"domain_scores_gemma":[0.9976007,0.0006420825,0.000190449,0.0009248334,0.0005421908,0.0000997416],"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.0001807477,0.0001309289,0.001234972,0.0003736985,0.00005997381,0.0003341197,0.001113495,0.008895462,0.03008877,0.6862498,0.00640174,0.2649364],"study_design_scores_gemma":[0.00009544501,0.0002754042,0.0004450964,0.0001334294,0.0001392013,0.001041994,0.0002925653,0.1540242,0.07433981,0.6422143,0.1268315,0.0001670957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009187983,0.0002473687,0.9826521,0.0001448623,0.00009648816,0.0001071351,0.0002269152,0.00266772,0.004669501],"genre_scores_gemma":[0.1017951,0.0003685593,0.8889974,0.0001724371,0.00008062255,0.000130731,0.000724419,0.0009871729,0.006743523],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006732358,"threshold_uncertainty_score":0.02252191,"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."}}