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 条
  • [21] Can a higher-order and a first-order theorem prover cooperate?
    Benzmüller, C
    Sorge, V
    Jamnik, M
    Kerber, M
    LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, PROCEEDINGS, 2005, 3452 : 415 - 431
  • [22] αleanTAP: A Declarative Theorem Prover for First-Order Classical Logic
    Near, Joseph P.
    Byrd, William E.
    Friedman, Daniel P.
    LOGIC PROGRAMMING, PROCEEDINGS, 2008, 5366 : 238 - 252
  • [23] A mechanically verified, sound and complete theorem prover for first order logic
    Ridge, T
    Margetson, J
    THEOREM PROVING IN HIGHER ORDER LOGICS, PROCEEDINGS, 2005, 3603 : 294 - 309
  • [24] Mechanizing reasoning about large finite tables in a rewrite based theorem prover
    Kapur, D
    Subramaniam, M
    ADVANCES IN COMPUTING SCIENCE-ASIAN' 98, 1998, 1538 : 22 - 42
  • [25] Extending a High-Performance Prover to Higher-Order Logic
    Vukmirovic, Petar
    Blanchette, Jasmin
    Schulz, Stephan
    TOOLS AND ALGORITHMS FOR THE CONSTRUCTION AND ANALYSIS OF SYSTEMS, PT II, TACAS 2023, 2023, 13994 : 111 - 129
  • [26] Multi-agent Logics for Reasoning About Higher-Order Upper and Lower Probabilities
    Doder, Dragan
    Savic, Nenad
    Ognjanovic, Zoran
    JOURNAL OF LOGIC LANGUAGE AND INFORMATION, 2020, 29 (01) : 77 - 107
  • [27] Multi-agent Logics for Reasoning About Higher-Order Upper and Lower Probabilities
    Dragan Doder
    Nenad Savić
    Zoran Ognjanović
    Journal of Logic, Language and Information, 2020, 29 : 77 - 107
  • [28] Inheritance in higher order logic: Modeling and reasoning
    Huisman, M
    Jacobs, B
    THEOREM PROVING IN HIGHER ORDER LOGICS, PROCEEDINGS, 2000, 1869 : 301 - 319
  • [29] iProver - An instantiation-based theorem prover for first-order logic
    Korovin, Konstantin
    AUTOMATED REASONING, PROCEEDINGS, 2008, 5195 : 292 - 298
  • [30] EMMY - A REFUTATIONAL THEOREM PROVER FOR 1ST-ORDER LOGIC WITH EQUATIONS
    DERUYYER, A
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 488 : 439 - 441