{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003737552,0.001268577,0.001396791,0.002162159,0.0008371099,0.003162483,0.002655029,0.001845821,0.007872073],"category_scores_gemma":[0.01550808,0.001179025,0.001420354,0.00477021,0.002722507,0.005025773,0.002259941,0.003320182,0.001173739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002011541,"about_ca_system_score_gemma":0.001619649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004222133,"about_ca_topic_score_gemma":0.003811402,"domain_scores_codex":[0.9967855,0.001653988,0.0001231768,0.0004198632,0.0008880498,0.0001293121],"domain_scores_gemma":[0.9913448,0.006942913,0.0002743264,0.0006868589,0.0006422593,0.0001088213],"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.00004956566,0.00005518245,0.0001849785,0.0001811303,0.00007794851,0.00005600159,0.00009488401,0.1576654,0.0004987073,0.7606208,0.007717187,0.07279814],"study_design_scores_gemma":[0.000009324796,0.00001039798,0.00005691032,0.00002727342,0.00002038295,0.00002209832,0.000008504732,0.4465678,0.0005338606,0.548992,0.003741847,0.000009663795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002304592,0.0007307308,0.9837821,0.0007187662,0.000076007,0.00004670239,0.0001198568,0.0001541334,0.01206724],"genre_scores_gemma":[0.3027583,0.002981065,0.6660151,0.0007829951,0.0004617022,0.0005009529,0.0007991837,0.0003768054,0.02532373],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007872073,"threshold_uncertainty_score":0.0263347,"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."}}