{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004465878,0.002048076,0.0016003,0.002484258,0.001692802,0.002472368,0.003499936,0.002393642,0.0139441],"category_scores_gemma":[0.01553384,0.00128428,0.001564704,0.00299863,0.002284253,0.00484886,0.004800221,0.004640057,0.004025497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001391171,"about_ca_system_score_gemma":0.004233249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003718434,"about_ca_topic_score_gemma":0.005126897,"domain_scores_codex":[0.9964265,0.0009027517,0.0002475328,0.0008240305,0.001337991,0.0002611584],"domain_scores_gemma":[0.9896327,0.006507957,0.0006882658,0.00157651,0.001394559,0.0002000329],"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.0003010734,0.0002854401,0.0007662361,0.0004491704,0.0001120784,0.0001742936,0.0003741006,0.08063663,0.01066613,0.1088059,0.01991966,0.7775093],"study_design_scores_gemma":[0.0002895103,0.0001507089,0.0002627879,0.0000990366,0.00008483571,0.0003298123,0.0001408605,0.8073325,0.01915893,0.1485053,0.02352422,0.0001214986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001052808,0.00005818997,0.9960323,0.0001211724,0.00003042905,0.0001173404,0.00005086603,0.001507509,0.00102948],"genre_scores_gemma":[0.02323912,0.00008133803,0.9738446,0.0001180441,0.00003543467,0.0002369648,0.0002426435,0.0005584662,0.001643356],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0139441,"threshold_uncertainty_score":0.04664761,"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."}}