{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006501762,0.001550219,0.001849604,0.00184573,0.001775551,0.007829968,0.002951683,0.003205727,0.01146738],"category_scores_gemma":[0.0346906,0.001631609,0.002304357,0.003721799,0.008519189,0.02940384,0.005714211,0.01901985,0.002371396],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003007342,"about_ca_system_score_gemma":0.003255492,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00507838,"about_ca_topic_score_gemma":0.005764894,"domain_scores_codex":[0.9915277,0.003936855,0.0002865509,0.001121559,0.00279468,0.0003326766],"domain_scores_gemma":[0.9763059,0.01490075,0.0008524057,0.005742603,0.00156363,0.0006346478],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003490749,0.000059143,0.0004069212,0.0002452461,0.00006040072,0.0001009253,0.0005120912,0.01592473,0.0005851803,0.9480636,0.008000964,0.02600594],"study_design_scores_gemma":[0.00001678311,0.00001656529,0.0001256449,0.0001041443,0.00001302602,0.00005585599,0.0001043569,0.03908613,0.0002514969,0.9419271,0.01827174,0.00002708722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009078803,0.004098162,0.932198,0.03847667,0.0005499592,0.0000616248,0.00042578,0.0003456048,0.01476558],"genre_scores_gemma":[0.3002783,0.02083149,0.6471278,0.01032447,0.004750611,0.0004246689,0.001484537,0.0011733,0.01360473],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01146738,"threshold_uncertainty_score":0.03836215,"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."}}