{"id":"W2003757888","doi":"10.1016/j.artint.2013.02.002","title":"Constraint propagation as information maximization","year":2013,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Constraint satisfaction problem; Constraint satisfaction dual problem; Maximization; Constraint (computer-aided design); Constraint satisfaction; Mathematics; Local consistency; Constraint logic programming; Tuple; Predicate (mathematical logic); Computation; Mathematical optimization; Semantics (computer science); Computer science; Theoretical computer science; Algorithm; Constraint programming; Artificial intelligence; Discrete mathematics","routes":{"ca_aff":true,"ca_fund":true,"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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001581446,0.0001066964,0.00007936286,0.0001569914,0.0001547538,0.0005228494,0.0002607963,0.00006365246,0.000897909],"category_scores_gemma":[0.0001902937,0.0001055603,0.0000353625,0.000455164,0.00007520119,0.003263235,0.0000552754,0.00009154292,0.004542148],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000495475,"about_ca_system_score_gemma":0.00008855707,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001333542,"about_ca_topic_score_gemma":0.00001128004,"domain_scores_codex":[0.9989498,0.00004340673,0.0004074,0.0001808509,0.0002375963,0.0001809016],"domain_scores_gemma":[0.9991312,0.00004656703,0.0001408441,0.00025181,0.0003452216,0.00008437232],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001263921,0.00001196394,0.00006731763,0.000002722038,0.000002364784,3.093412e-7,0.000404479,0.00331331,0.0003682759,0.4108432,0.00008774294,0.5848971],"study_design_scores_gemma":[0.00002847238,0.00006484957,0.0009555072,0.0000132332,0.000003162208,0.00002493536,0.0004648736,0.8388101,0.03463331,0.1239712,0.0008027941,0.0002275961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00506476,0.000003885264,0.9832853,0.002649707,0.0003797838,0.0004258834,8.680568e-7,0.0002595871,0.007930222],"genre_scores_gemma":[0.9632336,0.00001146947,0.03590124,0.0007067184,0.0000322309,0.00004904605,0.00001687964,0.000003771274,0.0000449645],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9581689,"threshold_uncertainty_score":0.9962329,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02029781473005512,"score_gpt":0.2455150153078151,"score_spread":0.22521720057776,"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."}}