{"id":"W2784087652","doi":"10.1007/978-3-319-50137-6_12","title":"The Inductive Constraint Programming Loop","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Constraint programming; Computer science; Concurrent constraint logic programming; Inductive programming; Constraint satisfaction; Exploit; Constraint (computer-aided design); Reactive programming; Scheduling (production processes); Constraint logic programming; Mathematical optimization; Programming language; Theoretical computer science; Programming paradigm; Artificial intelligence; Functional logic programming; Stochastic programming; Mathematics","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":[],"consensus_categories":[],"category_scores_codex":[0.0008006922,0.000370265,0.0002740091,0.0003716324,0.0005723042,0.0008388644,0.001978292,0.0002253791,0.00002638551],"category_scores_gemma":[0.0001365936,0.0002384988,0.0001051511,0.0003923131,0.001744051,0.0005446794,0.0007182533,0.0005911159,0.00005269706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003149341,"about_ca_system_score_gemma":0.0007415222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004970308,"about_ca_topic_score_gemma":0.00008410879,"domain_scores_codex":[0.9972023,0.00003790436,0.00042851,0.001032363,0.0007292368,0.0005696419],"domain_scores_gemma":[0.9976019,0.0006751978,0.0002979316,0.0009716614,0.0003114853,0.0001418819],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000001600548,0.000004286049,0.00002145135,0.000003420772,0.000006901614,0.00001389844,0.0001976567,0.0007714549,0.00001871779,0.1267844,0.000005224159,0.872171],"study_design_scores_gemma":[0.001075205,0.0003927885,0.0004488047,0.001101124,0.0000224308,0.0004619697,0.000002653346,0.349417,0.001381936,0.603722,0.03970383,0.002270273],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000120165,0.0001429294,0.9866018,0.002975893,0.002039348,0.0004664976,0.000002491665,0.0001691467,0.007589856],"genre_scores_gemma":[0.1320409,0.0002429698,0.8616271,0.001994815,0.001087974,0.00005312789,0.000003638179,0.00007042769,0.002879038],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8699008,"threshold_uncertainty_score":0.9725698,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01546279132236073,"score_gpt":0.2415703809151606,"score_spread":0.2261075895927998,"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."}}