{"id":"W1528564561","doi":"","title":"A fast and simple algorithm for bounds consistency of the all different constraint","year":2003,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Local consistency; Backtracking; Constraint programming; Constraint (computer-aided design); Consistency (knowledge bases); Constraint logic programming; Computer science; Constraint satisfaction; Mathematical optimization; Binary constraint; Benchmark (surveying); Constraint learning; Interleaving; Algorithm; Constraint satisfaction problem; Simple (philosophy); Mathematics; Artificial intelligence; Stochastic programming; Probabilistic logic","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.00008703204,0.00006740612,0.00009166353,0.00002561597,0.00008072084,0.00005029696,0.0001046824,0.00002654727,0.00005913679],"category_scores_gemma":[0.00003578297,0.00004362785,0.0000474602,0.00007036427,0.0001216767,0.0000725249,0.00003632037,0.00003250707,5.320277e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001168791,"about_ca_system_score_gemma":0.00005297293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006981522,"about_ca_topic_score_gemma":0.00003249881,"domain_scores_codex":[0.9994838,0.00003269737,0.0001509986,0.0001423649,0.00008581262,0.0001043028],"domain_scores_gemma":[0.9995773,0.00008729949,0.00005820955,0.0001749048,0.00006144428,0.00004081143],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[8.225294e-7,0.00004028174,0.002420324,0.00001034557,0.00002491515,2.48562e-7,0.0003121494,0.00003773516,0.0003318049,0.5672998,0.0003272676,0.4291943],"study_design_scores_gemma":[0.002943872,0.0002440232,0.03119866,0.00002977277,0.00004936523,0.0001674784,0.0008939195,0.893168,0.01277932,0.04347118,0.01453801,0.0005163852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003396079,0.00001792792,0.9917001,0.0004448273,0.0001445355,0.0002202146,0.000007991046,0.00002680984,0.004041475],"genre_scores_gemma":[0.8606446,0.000009066081,0.1386849,0.0003941196,0.000004976265,0.00001178355,0.000001339472,0.000003034183,0.0002460915],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8931303,"threshold_uncertainty_score":0.1779092,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01529265733168559,"score_gpt":0.2373962479057004,"score_spread":0.2221035905740148,"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."}}