{"id":"W2949059408","doi":"10.48550/arxiv.0909.3273","title":"Decomposition of the NVALUE constraint","year":2009,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"","keywords":"Local consistency; Heuristics; Consistency (knowledge bases); Decomposition; Constraint (computer-aided design); Decomposition method (queueing theory); Mathematical optimization; Computer science; Range (aeronautics); Upper and lower bounds; Global optimization; Benders' decomposition; Constraint programming; Theoretical computer science; Constraint satisfaction; Mathematics; Discrete mathematics; Artificial intelligence; Engineering","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.002737347,0.001031877,0.0008932154,0.001378201,0.001041376,0.002971822,0.001544181,0.001093185,0.008113994],"category_scores_gemma":[0.01042257,0.0006497725,0.001239574,0.00173551,0.002473076,0.004176941,0.003346434,0.003142007,0.001171979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001417306,"about_ca_system_score_gemma":0.001345851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002572764,"about_ca_topic_score_gemma":0.002639865,"domain_scores_codex":[0.9975253,0.000711547,0.0001281065,0.0004986284,0.0007324878,0.0004039661],"domain_scores_gemma":[0.9949157,0.002218403,0.0005605707,0.0009703629,0.0009409171,0.0003941235],"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.0001006582,0.00005627782,0.0009024937,0.0001906012,0.00005261637,0.0003596933,0.0004040168,0.07759615,0.004364213,0.8694637,0.004831805,0.04167781],"study_design_scores_gemma":[0.0000261125,0.00004189341,0.0002411793,0.00009331638,0.00003146032,0.0002082938,0.0001920415,0.1694305,0.002867761,0.8087099,0.01813141,0.00002615105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02709734,0.0003589226,0.9440346,0.000512867,0.000114624,0.00009181222,0.000268135,0.0002454877,0.02727624],"genre_scores_gemma":[0.4211689,0.0007226653,0.5523967,0.0004390109,0.0001712901,0.0003494016,0.0009321324,0.0008237599,0.02299625],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008113994,"threshold_uncertainty_score":0.02714396,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02780240486610733,"score_gpt":0.2749630706695686,"score_spread":0.2471606658034613,"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."}}