{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001519442,0.0009366812,0.0005777061,0.001430399,0.0007800648,0.002583507,0.001787835,0.001240926,0.006181991],"category_scores_gemma":[0.004706141,0.0004115245,0.001336195,0.001490655,0.002171813,0.00525406,0.001686531,0.002932772,0.001191089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001544689,"about_ca_system_score_gemma":0.001013493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001990163,"about_ca_topic_score_gemma":0.00318344,"domain_scores_codex":[0.9989618,0.0002001227,0.00008878342,0.0001593005,0.0004317751,0.0001581076],"domain_scores_gemma":[0.998396,0.0007776679,0.0002433627,0.0001714833,0.000345812,0.00006562756],"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.00002176155,0.00002298868,0.0002012726,0.0001188882,0.00001288642,0.0001208776,0.0002071514,0.006133209,0.001432362,0.9731723,0.002034404,0.01652198],"study_design_scores_gemma":[0.00002123334,0.00002435092,0.00009884072,0.00005215648,0.0000323934,0.0001145814,0.00008053186,0.06869248,0.002562313,0.9159338,0.01236795,0.00001946531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008749605,0.0002245738,0.9802889,0.0005998889,0.0001124397,0.0001116689,0.0004369396,0.0004762522,0.008999857],"genre_scores_gemma":[0.3352852,0.0007415125,0.6518755,0.0009930538,0.0003114175,0.0006515348,0.001397832,0.0005426183,0.008201261],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006181991,"threshold_uncertainty_score":0.02068079,"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."}}