{"id":"W3093584058","doi":"10.1007/s00354-020-00112-0","title":"Learning Disjunctive Logic Programs from Nondeterministic Interpretation Transitions","year":2020,"lang":"en","type":"article","venue":"New Generation Computing","topic":"Logic, Reasoning, and Knowledge","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Inductive logic programming; Computer science; Nondeterministic algorithm; Logic program; Dynamic logic (digital electronics); Artificial intelligence; Logic programming; Multimodal logic; Theoretical computer science; Programming language; State (computer science); Interpretation (philosophy); Description logic","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.001652414,0.0008425419,0.0007174357,0.0008839719,0.0004907647,0.002196858,0.001842743,0.001321973,0.004359954],"category_scores_gemma":[0.01409576,0.0007535963,0.001172501,0.0007593207,0.00123169,0.005527142,0.002019593,0.003758655,0.000570816],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00133584,"about_ca_system_score_gemma":0.001483488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001984028,"about_ca_topic_score_gemma":0.006077692,"domain_scores_codex":[0.9985701,0.0004420965,0.00007655863,0.000476096,0.0003041042,0.0001309599],"domain_scores_gemma":[0.9864352,0.0118295,0.0004110468,0.0005826767,0.0005598255,0.0001815471],"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.001470427,0.0008401771,0.008940266,0.0005932806,0.0001817298,0.0006139789,0.0006814282,0.3207446,0.006580819,0.1075171,0.008415267,0.543421],"study_design_scores_gemma":[0.00006545644,0.00006723274,0.000371127,0.00003182235,0.00003392023,0.00006471792,0.00007745049,0.8420203,0.0028694,0.1533616,0.001024757,0.00001228684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1862926,0.00055414,0.8019723,0.001832381,0.0001034162,0.000193968,0.0007463666,0.002483245,0.00582153],"genre_scores_gemma":[0.8373441,0.000240379,0.1574915,0.0003481569,0.00008470906,0.0001499214,0.001308614,0.000195912,0.002836639],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004359954,"threshold_uncertainty_score":0.01458549,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04480490933102638,"score_gpt":0.2609039098683966,"score_spread":0.2160990005373702,"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."}}