{"id":"W2972833528","doi":"10.1007/978-3-030-30446-1_13","title":"Learning Minimal DFA: Taking Inspiration from RPNI to Improve SAT Approach","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Heuristics; Computer science; Boolean satisfiability problem; Solver; Inference; Problem solver; Theoretical computer science; Algorithm; Artificial intelligence; Programming language","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001654386,0.001141046,0.001518828,0.001703667,0.001021831,0.001809826,0.003741641,0.001601762,0.01652312],"category_scores_gemma":[0.0122737,0.0007729285,0.002144778,0.001765226,0.001163569,0.004697819,0.003284349,0.004315455,0.005193865],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00123288,"about_ca_system_score_gemma":0.001866689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003990324,"about_ca_topic_score_gemma":0.01337505,"domain_scores_codex":[0.9983813,0.0004555236,0.0001127143,0.0004948969,0.0004274015,0.0001282091],"domain_scores_gemma":[0.9950163,0.002614319,0.0001472468,0.001474982,0.0006092144,0.0001380782],"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.0003306222,0.0003126467,0.002605732,0.0006610108,0.0001637228,0.0001439967,0.000234438,0.08620818,0.004990702,0.1180631,0.05581088,0.7304749],"study_design_scores_gemma":[0.00007685627,0.0001236189,0.0005616235,0.0001451397,0.00009267675,0.0001613528,0.00007532691,0.6106529,0.003232111,0.3656757,0.01917181,0.00003084772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01203723,0.0008087914,0.9643613,0.0009997217,0.0002729436,0.0001625381,0.001518262,0.006404082,0.01343524],"genre_scores_gemma":[0.1525359,0.0004316417,0.829286,0.0009977102,0.0003185193,0.0002946403,0.006137205,0.00141697,0.008581304],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01652312,"threshold_uncertainty_score":0.05527538,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01384735410966071,"score_gpt":0.2415003400873089,"score_spread":0.2276529859776482,"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."}}