{"id":"W4255413586","doi":"10.1007/978-3-540-45193-8_41","title":"An Efficient Bounds Consistency Algorithm for the Global Cardinality Constraint","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Kent","keywords":"Cardinality (data modeling); Consistency (knowledge bases); Local consistency; Constraint (computer-aided design); Algorithm; Computer science; Mathematics; Constraint satisfaction; Artificial intelligence; Data mining","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.00273827,0.001625047,0.002326139,0.002278608,0.001676992,0.00440951,0.0048865,0.002194833,0.01435003],"category_scores_gemma":[0.0126658,0.001555052,0.001886527,0.004140391,0.001285715,0.007883525,0.005135563,0.004727263,0.003371964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001787807,"about_ca_system_score_gemma":0.003206081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00406077,"about_ca_topic_score_gemma":0.004798632,"domain_scores_codex":[0.9963802,0.0007235319,0.0002327917,0.0008622259,0.001417666,0.0003837167],"domain_scores_gemma":[0.9935259,0.00308792,0.0003194119,0.001884868,0.001015759,0.0001662434],"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.0006937815,0.0003371834,0.00075102,0.0003730844,0.0001248247,0.0001361288,0.0003185259,0.1199633,0.01113761,0.1154224,0.02978045,0.7209617],"study_design_scores_gemma":[0.0002978218,0.000104124,0.0004309246,0.00007855133,0.0001041294,0.0001775643,0.0001300686,0.8098611,0.0151371,0.1568976,0.01672273,0.00005815058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004891372,0.0002383879,0.9877236,0.0002317849,0.00009443888,0.0001441921,0.0002530678,0.002119826,0.004303367],"genre_scores_gemma":[0.06962407,0.0002332209,0.9221663,0.0001821242,0.0001128023,0.0003025948,0.001211073,0.001130879,0.005036825],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01435003,"threshold_uncertainty_score":0.04800564,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01637634928976556,"score_gpt":0.263311045854145,"score_spread":0.2469346965643794,"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."}}