{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009816724,0.0003724537,0.000314153,0.0002999704,0.0005352852,0.0008633723,0.002483339,0.0002101934,0.00001886407],"category_scores_gemma":[0.0001175905,0.0002792519,0.0001083423,0.0003669544,0.001328769,0.0002560956,0.0006173167,0.0006446427,0.0000795314],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000196508,"about_ca_system_score_gemma":0.0005498647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007597325,"about_ca_topic_score_gemma":0.00005973418,"domain_scores_codex":[0.9971983,0.00004232736,0.0004548071,0.001006318,0.0007765769,0.0005216785],"domain_scores_gemma":[0.9973541,0.0007550577,0.000270419,0.001243497,0.000236703,0.0001401698],"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.000001349764,0.000002704808,0.00002938671,0.000004936905,0.000004358232,0.000009607549,0.00009620848,0.01399225,0.00003091358,0.1403919,0.00005186085,0.8453845],"study_design_scores_gemma":[0.0002308475,0.00007287123,0.0004274498,0.000154711,0.000004175823,0.00008181322,2.195774e-7,0.8793085,0.000122102,0.09862799,0.02044031,0.0005290376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000008159155,0.0002550594,0.9797724,0.002109433,0.002451497,0.0002754685,0.00000244475,0.0001693163,0.01495623],"genre_scores_gemma":[0.2972412,0.0004587675,0.6906968,0.008253807,0.0009636501,0.00002320311,0.00000777321,0.00006176635,0.002293057],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8653162,"threshold_uncertainty_score":0.999966,"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."}}