{"id":"W1976132254","doi":"10.1145/937555.937556","title":"A dynamic approach to characterizing termination of general logic programs","year":2003,"lang":"en","type":"article","venue":"ACM Transactions on Computational Logic","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University; University of Alberta","funders":"","keywords":"Prolog; Computer science; Dynamic logic (digital electronics); Logic program; Key (lock); Theoretical computer science; Programming language; Logic programming; Tree (set theory); Algorithm; 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.003303509,0.0009419902,0.0008223064,0.003238733,0.001309284,0.002039946,0.002276647,0.001260297,0.00235963],"category_scores_gemma":[0.008243034,0.0006653008,0.001355329,0.001898295,0.004667381,0.007413414,0.003443817,0.003509982,0.0003602813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002607128,"about_ca_system_score_gemma":0.001200585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001554095,"about_ca_topic_score_gemma":0.001294729,"domain_scores_codex":[0.9961399,0.0007931311,0.0003516232,0.0007560654,0.001519334,0.0004399274],"domain_scores_gemma":[0.9926078,0.003700568,0.0009702536,0.001227806,0.001104355,0.0003892286],"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.0001742777,0.000119264,0.004104764,0.0002896229,0.00005879783,0.0005551823,0.000952236,0.08529755,0.0195292,0.8302246,0.001326222,0.05736828],"study_design_scores_gemma":[0.00003351133,0.0001018315,0.0009435399,0.00006227821,0.00005452872,0.0004910225,0.0001321447,0.3041022,0.008047829,0.6755745,0.0103992,0.00005740227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03253062,0.0003021579,0.9600396,0.0002443331,0.00001954878,0.00009409571,0.000172892,0.0003891551,0.006207509],"genre_scores_gemma":[0.5972053,0.0005872936,0.3958777,0.0002723258,0.000159382,0.0003911329,0.0007236552,0.0003774174,0.0044058],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003303509,"threshold_uncertainty_score":0.01891607,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03058921425536587,"score_gpt":0.2715346414251692,"score_spread":0.2409454271698033,"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."}}