{"id":"W2148856926","doi":"","title":"Loop formulas for logic programs with arbitrary constraint atoms","year":2008,"lang":"en","type":"article","venue":"","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Constraint (computer-aided design); Computer science; Constraint satisfaction; Constraint satisfaction problem; Set (abstract data type); Semantics (computer science); Constraint logic programming; Theoretical computer science; Loop (graph theory); Connection (principal bundle); Computation; Encoding (memory); Task (project management); Stable model semantics; Discrete mathematics; Algorithm; Mathematics; Programming language; Combinatorics; Operational semantics; Artificial intelligence","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.0001304191,0.0001725616,0.0001924049,0.0000456546,0.000201886,0.00008325103,0.0005472263,0.00007038606,0.00002301445],"category_scores_gemma":[0.00001662421,0.0001069001,0.00009394667,0.0002323753,0.0001989811,0.0003111984,0.00009472149,0.00009423029,0.00006700059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002436063,"about_ca_system_score_gemma":0.0001712997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001178819,"about_ca_topic_score_gemma":0.00002400911,"domain_scores_codex":[0.9988229,0.00001598638,0.0001651591,0.0003945405,0.0001697835,0.0004316482],"domain_scores_gemma":[0.9992318,0.00007073912,0.00006169459,0.0003682418,0.0001213219,0.0001462099],"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.00001884913,0.0002477862,0.003995669,0.00002498255,0.00003271093,0.00007751236,0.0007064845,0.000002948795,0.00003030698,0.9547218,0.001527894,0.03861304],"study_design_scores_gemma":[0.01886578,0.01721223,0.01457755,0.0003306981,0.0001316656,0.009709733,0.0008845721,0.2713664,0.02513277,0.3942665,0.2417116,0.005810494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04977654,0.0001382599,0.8618063,0.0002805163,0.0001423457,0.0006367799,9.529632e-7,0.0005058617,0.08671247],"genre_scores_gemma":[0.7897726,0.00001174517,0.2067848,0.0005484977,0.00007375647,0.00009147479,0.000005528143,0.00001009855,0.002701568],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.739996,"threshold_uncertainty_score":0.435926,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03727958682741188,"score_gpt":0.2414199814649113,"score_spread":0.2041403946374994,"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."}}