{"id":"W3085023755","doi":"10.1109/iri49571.2020.00030","title":"Data Driven Relational Constraint Programming","year":2020,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Constraint programming; Debugging; Programming language; Constraint logic programming; Constraint (computer-aided design); Relational algebra; Concurrent constraint logic programming; Relational database; Declarative programming; Constraint satisfaction; Theoretical computer science; Query language; Logic programming; Relational model; Inductive programming; Programming paradigm; Functional logic programming; Database; Artificial intelligence; 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.00006618253,0.00004952584,0.00004901855,0.00001985952,0.00005937391,0.00009237076,0.0004141727,0.00002288605,0.0003002582],"category_scores_gemma":[0.00006976943,0.00004672379,0.0000142015,0.0001828481,0.00003330211,0.0005732183,0.0002515622,0.0000661174,0.0001064742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008215326,"about_ca_system_score_gemma":0.00007559756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001986242,"about_ca_topic_score_gemma":0.000005806818,"domain_scores_codex":[0.9993778,0.000017579,0.0001218043,0.0002577993,0.0001380842,0.00008687061],"domain_scores_gemma":[0.999534,0.0000343885,0.00003459725,0.0002716882,0.00003482877,0.00009048994],"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.000001486455,0.00001362769,0.00323144,0.000004072848,0.00001336333,0.00000638108,0.0003004893,0.002244238,0.0000714817,0.5576854,0.003870161,0.4325579],"study_design_scores_gemma":[0.000150137,0.00001439423,0.001961487,0.000002220341,0.000001898685,0.00001006464,0.00003645763,0.9502275,0.00001619167,0.0001453797,0.04735593,0.00007837301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00009473607,0.000004707884,0.9756953,0.01550834,0.00007302127,0.00008993591,0.000006672186,0.0002730667,0.008254262],"genre_scores_gemma":[0.3318235,0.000002046336,0.6666782,0.001352645,0.00004081044,0.000001783652,0.00004768085,0.000002396476,0.00005096791],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9479832,"threshold_uncertainty_score":0.3287617,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08184727823465124,"score_gpt":0.2746068948584566,"score_spread":0.1927596166238054,"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."}}