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 条
  • [1] Formal reasoning about synthetic biology using higher-order-logic theorem proving
    Abed, Sa'ed
    Rashid, Adnan
    Hasan, Osman
    IET SYSTEMS BIOLOGY, 2020, 14 (05) : 271 - 283
  • [2] A LOGIC WITH HIGHER ORDER CONDITIONAL PROBABILITIES
    Ognjanovic, Zoran
    Ikodinovic, Nebojsa
    PUBLICATIONS DE L INSTITUT MATHEMATIQUE-BEOGRAD, 2007, 82 (96): : 141 - 154
  • [3] The Higher-Order-Logic Formath
    Audenaert, Pieter
    BULLETIN OF THE BELGIAN MATHEMATICAL SOCIETY-SIMON STEVIN, 2008, 15 (02) : 335 - 367
  • [4] Formalization of bond graph using higher-order-logic theorem proving
    Qasim, Ujala
    Rashid, Adnan
    Hasan, Osman
    ISA TRANSACTIONS, 2022, 128 : 453 - 469
  • [5] Implementing a program logic of objects in a higher-order logic theorem prover
    Hofmann, M
    Tang, F
    THEOREM PROVING IN HIGHER ORDER LOGICS, PROCEEDINGS, 2000, 1869 : 268 - 282
  • [6] A First-Order Logic for Reasoning About Higher-Order Upper and Lower Probabilities
    Savic, Nenad
    Doder, Dragan
    Ognjanovic, Zoran
    SYMBOLIC AND QUANTITATIVE APPROACHES TO REASONING WITH UNCERTAINTY, ECSQARU 2017, 2017, 10369 : 491 - 500
  • [7] Formalization of the Telegrapher’s Equations using Higher-Order-Logic Theorem Proving
    Deniz, Elif
    Rashid, Adnan
    Hasan, Osman
    Tahar, Sofiène
    Journal of Applied Logics, 2024, 11 (02): : 197 - 236
  • [8] Formal Analysis of the Biological Circuits using Higher-order-logic Theorem Proving
    Abed, Sa'ed
    Rashid, Adnan
    Hasan, Osman
    PROCEEDINGS OF THE 35TH ANNUAL ACM SYMPOSIUM ON APPLIED COMPUTING (SAC'20), 2020, : 3 - 7
  • [9] FORMALIZATION OF THE TELEGRAPHER'S EQUATIONS USING HIGHER-ORDER-LOGIC THEOREM PROVING
    Deniz, Elif
    Rashid, Adnan
    Hasan, Osman
    Tahar, Sofiene
    JOURNAL OF APPLIED LOGICS-IFCOLOG JOURNAL OF LOGICS AND THEIR APPLICATIONS, 2024, 11 (02):
  • [10] A LOGIC FOR REASONING ABOUT PROBABILITIES
    FAGIN, R
    HALPERN, JY
    MEGIDDO, N
    INFORMATION AND COMPUTATION, 1990, 87 (1-2) : 78 - 128