{"id":"W4400169040","doi":"10.1007/978-3-031-63498-7_25","title":"A Formal Model to Prove Instantiation Termination for E-matching-Based Axiomatisations","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Logic, programming, and type systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Programming language; Completeness (order theory); Satisfiability modulo theories; Quantifier elimination; Matching (statistics); Theoretical computer science; Automated theorem proving; Solver; Quantifier (linguistics); Set (abstract data type); Proof assistant; Semantics (computer science); Satisfiability; Boolean satisfiability problem; Algorithm; Artificial intelligence; Mathematical proof; Mathematics","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.006182384,0.0009984119,0.0008696636,0.002049741,0.001546833,0.003939295,0.004076459,0.003226799,0.01182465],"category_scores_gemma":[0.01535528,0.0013986,0.003655195,0.001352302,0.007213543,0.007573868,0.006102159,0.007329929,0.00263582],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003108736,"about_ca_system_score_gemma":0.003621863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004014179,"about_ca_topic_score_gemma":0.003514316,"domain_scores_codex":[0.9947849,0.001487102,0.0005160855,0.0008089266,0.001940895,0.0004620623],"domain_scores_gemma":[0.9867032,0.009282583,0.0005327269,0.001952079,0.001228538,0.0003008265],"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.00004882989,0.0001101196,0.0002436189,0.0001391793,0.00002671302,0.0002040451,0.0002954467,0.0199058,0.003595127,0.9613018,0.002157431,0.01197174],"study_design_scores_gemma":[0.0001458013,0.00009203116,0.0001126656,0.0001323258,0.00005700585,0.0002418463,0.00008024919,0.2692637,0.01293084,0.689892,0.02699061,0.00006089923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003547271,0.00007590444,0.9886486,0.0007080226,0.0001100588,0.0001373734,0.0001173796,0.001414894,0.005240609],"genre_scores_gemma":[0.1540488,0.0002818922,0.8333547,0.0009881452,0.0001979531,0.0006288075,0.0005691394,0.0008391376,0.009091452],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01182465,"threshold_uncertainty_score":0.03955746,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02373044645063604,"score_gpt":0.269077801340415,"score_spread":0.245347354889779,"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."}}