{"id":"W1972387650","doi":"10.1016/j.jal.2011.01.001","title":"Reasoning about conditional probabilities in a higher-order-logic theorem prover","year":2011,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Conditional probability; Automated theorem proving; Probabilistic logic; Bayes' theorem; Law of total probability; Theoretical computer science; Computer science; Mathematics; Conditional mutual information; Probability theory; Discrete mathematics; Gas meter prover; Regular conditional probability; Algorithm; Posterior probability; Artificial intelligence; Bayesian probability; Mathematical proof; Programming language; Statistics","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.001591872,0.0001390484,0.0002464816,0.0001870571,0.00006914206,0.00006122953,0.0007910937,0.0000972094,0.0001502555],"category_scores_gemma":[0.0001351272,0.0001041224,0.00006621458,0.0003903313,0.0001526639,0.0005095723,0.0001057872,0.0003482092,0.00002170261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000117377,"about_ca_system_score_gemma":0.0001313791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003206016,"about_ca_topic_score_gemma":0.000001076091,"domain_scores_codex":[0.998517,0.0001050899,0.0005598796,0.0002095281,0.0003590184,0.0002494449],"domain_scores_gemma":[0.9988264,0.0001006067,0.0005420966,0.0002782105,0.0001836357,0.00006906223],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006781166,0.0001152529,0.0001814604,0.00001650039,0.000009740918,0.00001360219,0.001278485,0.0001742367,0.0004945505,0.9935147,0.00006776497,0.004065924],"study_design_scores_gemma":[0.0004960442,0.0002495394,0.01958438,0.00003866343,0.000006504593,0.00007944484,0.0001651264,0.001720344,0.002027263,0.9747453,0.0007251721,0.0001622359],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07499764,0.0002508696,0.6926169,0.0005758643,0.001124923,0.0007009855,0.00000290878,0.0001187685,0.2296111],"genre_scores_gemma":[0.4755204,0.000008052639,0.5240535,0.0002743723,0.00007401847,0.00001729881,5.126747e-7,0.000004865795,0.00004699988],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4005228,"threshold_uncertainty_score":0.4245988,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06770647973216208,"score_gpt":0.2773710722070462,"score_spread":0.2096645924748841,"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."}}