{"id":"W1871992796","doi":"10.1007/978-3-319-10428-7_15","title":"The Balance Constraint Family","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science; Consistency (knowledge bases); Constraint (computer-aided design); Focus (optics); Domain (mathematical analysis); Polynomial; Local consistency; Balance (ability); Time complexity; Semantics (computer science); Upper and lower bounds; Algorithm; Decomposition; Decomposition method (queueing theory); Mathematical optimization; Theoretical computer science; Constraint satisfaction problem; Mathematics; Discrete mathematics; Artificial intelligence; Programming language","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.000847529,0.0009517246,0.0006457763,0.001451871,0.001350768,0.002510584,0.001092329,0.000836276,0.02774334],"category_scores_gemma":[0.00270705,0.0005970036,0.0007262165,0.003099415,0.001693109,0.004812531,0.00139452,0.002588189,0.007330304],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001211783,"about_ca_system_score_gemma":0.0009202877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001611597,"about_ca_topic_score_gemma":0.001269051,"domain_scores_codex":[0.9993873,0.0001278592,0.00003538358,0.0001410214,0.0002570257,0.00005145503],"domain_scores_gemma":[0.9994476,0.0002106663,0.00003669297,0.0001298442,0.0001333252,0.00004179824],"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.00001633835,0.00001004182,0.00005686717,0.00008222467,0.000008547358,0.00003556862,0.00007172413,0.001588078,0.0004363141,0.9047856,0.02397531,0.06893338],"study_design_scores_gemma":[0.000006237493,0.000006103063,0.00006339603,0.00005674735,0.000006601956,0.0001094262,0.00002543525,0.00402295,0.0004986722,0.8375719,0.1576232,0.000009343882],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.005252688,0.01178498,0.3832783,0.002625227,0.0006612194,0.00008443392,0.001253934,0.0004244092,0.5946349],"genre_scores_gemma":[0.2811341,0.03619334,0.2816253,0.002848704,0.00256922,0.0007204737,0.005254047,0.001776209,0.3878785],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.02774334,"threshold_uncertainty_score":0.09281069,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01149592655890713,"score_gpt":0.2241667942902898,"score_spread":0.2126708677313827,"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."}}