{"id":"W2903153676","doi":"","title":"Leveraging Constraint Logic Programming for Neural Guided Program Synthesis.","year":2018,"lang":"en","type":"article","venue":"International Conference on Learning Representations","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Canadian Institute for Advanced Research; University of Toronto","funders":"","keywords":"Computer science; Logic programming; Programming language; Constraint programming; Concurrent constraint logic programming; Constraint logic programming; Logic program; Constraint satisfaction; Constraint (computer-aided design); Inductive programming; Theoretical computer science; Artificial intelligence; Functional logic programming; Programming paradigm; Mathematical optimization; 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.000452359,0.00017423,0.0001508126,0.0002064727,0.0005182873,0.0006935803,0.0008035755,0.00006324384,0.0001395616],"category_scores_gemma":[0.001129668,0.0001712309,0.0001013085,0.0002116446,0.0001611021,0.000350228,0.0001242484,0.0002757833,0.00006606172],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000592261,"about_ca_system_score_gemma":0.0001333303,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005667821,"about_ca_topic_score_gemma":0.000005243412,"domain_scores_codex":[0.9982767,0.000128358,0.0003335947,0.0005542255,0.0003622258,0.0003449322],"domain_scores_gemma":[0.9980715,0.0006536625,0.0002200696,0.0002901502,0.0006686281,0.00009596955],"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.00005046102,0.0002401875,0.009080806,0.00002566309,0.0001557826,0.00002745943,0.004904666,0.01282465,0.001242486,0.3906494,0.002430985,0.5783674],"study_design_scores_gemma":[0.0003744684,0.0003682814,0.001304787,0.0001405614,0.00001327063,0.00004277035,0.0004946864,0.977428,0.0009364016,0.006469619,0.01213614,0.0002909734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0321359,0.00001723649,0.9006863,0.01751255,0.001412418,0.00107768,0.00001149675,0.001350865,0.04579559],"genre_scores_gemma":[0.8805373,0.000002157156,0.117743,0.0002210447,0.0002249537,0.0003724718,0.0000364542,0.00001271052,0.0008498396],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9646034,"threshold_uncertainty_score":0.6982594,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1236522775266924,"score_gpt":0.3885364596589281,"score_spread":0.2648841821322356,"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."}}