{"id":"W1626677565","doi":"10.1609/aaai.v24i1.7554","title":"Propagating Conjunctions of AllDifferent Constraints","year":2010,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"Agence Nationale de la Recherche; Australian Government","keywords":"Bipartite graph; Matching (statistics); Mathematics; Propagator; Combinatorics; 3-dimensional matching; Constraint (computer-aided design); Time complexity; Graph; Discrete mathematics","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.006722483,0.001494918,0.001473938,0.002528183,0.002368465,0.002439268,0.003081683,0.001911183,0.008887435],"category_scores_gemma":[0.04117874,0.001345148,0.002146205,0.003915651,0.002624429,0.009113693,0.005211394,0.004806844,0.001247427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001552081,"about_ca_system_score_gemma":0.002911619,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003568533,"about_ca_topic_score_gemma":0.005553078,"domain_scores_codex":[0.9918167,0.002380584,0.0004772477,0.001771047,0.002788711,0.0007658505],"domain_scores_gemma":[0.9602875,0.02929171,0.00286508,0.003616746,0.003127477,0.0008114747],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00075985,0.0005532786,0.005891946,0.001626033,0.0004701293,0.001517462,0.001073967,0.1406137,0.0185698,0.3983358,0.01752866,0.4130593],"study_design_scores_gemma":[0.0001297414,0.0001596959,0.0006667113,0.0001230604,0.0001642532,0.0005990544,0.0003954638,0.5519593,0.0183109,0.4128854,0.01450879,0.00009764374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02683691,0.000334031,0.9652075,0.001112934,0.0001955821,0.0002783565,0.000268572,0.0007591799,0.005006897],"genre_scores_gemma":[0.2557012,0.0003994938,0.7363583,0.0006994772,0.00025626,0.0002383713,0.0007489031,0.0004385427,0.005159358],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008887435,"threshold_uncertainty_score":0.03555232,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04567041664019401,"score_gpt":0.2747648551204846,"score_spread":0.2290944384802906,"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."}}