Reasoning about conditional probabilities in a higher-order-logic theorem prover

被引:7
|
作者
Hasan, Osman [1 ]
Tahar, Sofiene [1 ]
机构
[1] Concordia Univ, Dept Elect & Comp Engn, Montreal, PQ H3G 1M8, Canada
关键词
Binary channel; Bayes theorem; Formal methods; HOL theorem prover; Probabilistic analysis; Total probability law; VERIFICATION; ALGORITHMS; CHANNEL; MODEL;
D O I
10.1016/j.jal.2011.01.001
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In the field of probabilistic analysis, the concept of conditional probability plays a major role for estimating probabilities when some partial information concerning the result of the experiment is available. This paper presents a higher-order-logic definition of conditional probability and the formal verification of some classical properties of conditional probability, such as, the total probability law and Bayes' theorem. This infrastructure, implemented in the HOL theorem prover, allows us to precisely reason about conditional probabilities for probabilistic systems within the sound core of HOL and thus proves to be quite useful for the analysis of systems used in safety-critical domains, such as space, medicine and transportation. To demonstrate the usefulness of our approach, we provide the precise probabilistic analysis of the binary asymmetric channel, a widely used concept in communication theory, within the HOL theorem prover. (C) 2011 Elsevier B.V. All rights reserved.
引用
收藏
页码:23 / 40
页数:18
相关论文
共 50 条
  • [31] A model generation based theorem prover MGTP for first-order logic
    Hasegawa, Ryuzo
    Fujita, Hiroshi
    Koshimura, Miyuki
    Shirai, Yasuyuki
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2002, 2408 (PART2): : 178 - 213
  • [32] On Recurrent Neural Network Based Theorem Prover For First Order Minimal Logic
    Baghdasaryan, Ashot
    Bolibekyan, Hovhannes
    JOURNAL OF UNIVERSAL COMPUTER SCIENCE, 2021, 27 (11) : 1193 - 1202
  • [33] A focusing inverse method theorem prover for first-order linear logic
    Chaudhuri, K
    Pfenning, F
    AUTOMATED DEDUCTION - CADE-20, PROCEEDINGS, 2005, 3632 : 69 - 83
  • [34] A model generation based theorem prover MGTP for first-order logic
    Hasegawa, R
    Fujita, H
    Koshimura, M
    Shirai, Y
    COMPUTATIONAL LOGIC: LOGIC PROGRAMMING AND BEYOND, PT II: ESSAYS IN HONOUR OF ROBERT A KOWALSKI, 2002, 2408 : 178 - 213
  • [35] A first-order probabilistic logic with approximate conditional probabilities
    Ikodinovic, Nebojsa
    Raskovic, Miodrag
    Markovic, Zoran
    Ognjanovic, Zoran
    LOGIC JOURNAL OF THE IGPL, 2014, 22 (04) : 539 - 564
  • [36] HOT: A concurrent automated theorem prover based on higher-order tableaux
    Konrad, K
    THEOREM PROVING IN HIGHER ORDER LOGICS, 1998, 1479 : 245 - 261
  • [37] A logic for reasoning about coherent conditional probability: A modal fuzzy logic approach
    Marchioni, E
    Godo, L
    LOGICS IN ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 2004, 3229 : 213 - 225
  • [38] Higher order conditional probabilities and thermodynamics of binary molten alloys
    Akinlade, O
    MODERN PHYSICS LETTERS B, 1997, 11 (2-3): : 93 - 106
  • [39] Extending a brainiac prover to lambda-free higher-order logic
    Petar Vukmirović
    Jasmin Blanchette
    Simon Cruanes
    Stephan Schulz
    International Journal on Software Tools for Technology Transfer, 2022, 24 : 67 - 87
  • [40] Extending a Brainiac Prover to Lambda-Free Higher-Order Logic
    Vukmirovic, Petar
    Blanchette, Jasmin Christian
    Cruanes, Simon
    Schulz, Stephan
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PT I, 2019, 11427 : 192 - 210