{"id":"W2604296014","doi":"10.1609/aaai.v31i1.11143","title":"Getting More Out of the Exposed Structure in Constraint Programming Models of Combinatorial Problems","year":2017,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Constraint programming; Constraint (computer-aided design); Mathematical optimization; Computer science; Set (abstract data type); Key (lock); Computation; Combinatorial optimization; Theoretical computer science; Constraint satisfaction; Constraint logic programming; Mathematics; Algorithm; Stochastic programming; Artificial intelligence; Programming language","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004331424,0.0001701178,0.0002821716,0.00009035254,0.0002309463,0.0001855618,0.002051621,0.0001036494,0.00001209928],"category_scores_gemma":[0.0005005587,0.0001165544,0.0001112365,0.0002354972,0.0007478646,0.0005041853,0.0004353083,0.0002945389,6.554969e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003479535,"about_ca_system_score_gemma":0.0001675184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007217554,"about_ca_topic_score_gemma":0.00004757532,"domain_scores_codex":[0.9982741,0.00002183972,0.000682575,0.0003189301,0.0004750269,0.000227472],"domain_scores_gemma":[0.9976258,0.00005504421,0.001179951,0.0004493274,0.0006491239,0.00004079919],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00002755302,0.00009137236,0.003108123,0.00008831423,0.00001277815,1.422981e-7,0.005435238,0.002695703,0.06390702,0.8061875,0.000003090343,0.1184432],"study_design_scores_gemma":[0.0001079151,0.00008308289,0.001233795,0.0005971726,0.00000964801,0.000002092869,0.001181775,0.281135,0.5294884,0.1859879,0.000005717631,0.0001674969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.929774,0.00001638083,0.05635506,0.004556732,0.00220438,0.001833847,0.00001938881,0.0000636745,0.005176538],"genre_scores_gemma":[0.9953001,0.000006696725,0.00461343,0.00002365218,0.00002593591,0.00001067975,2.30809e-7,0.000006943931,0.00001233509],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6201995,"threshold_uncertainty_score":0.4752952,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0762784727144263,"score_gpt":0.2923125183419786,"score_spread":0.2160340456275524,"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."}}