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 条
  • [41] Extending a brainiac prover to lambda-free higher-order logic
    Vukmirovic, Petar
    Blanchette, Jasmin
    Cruanes, Simon
    Schulz, Stephan
    INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER, 2022, 24 (01) : 67 - 87
  • [42] Reasoning about higher-order processes
    Amadio, RM
    Dam, M
    TAPSOFT '95: THEORY AND PRACTICE OF SOFTWARE DEVELOPMENT, 1995, 915 : 202 - 216
  • [43] F-LOGIC - A HIGHER-ORDER LANGUAGE FOR REASONING ABOUT OBJECTS, INHERITANCE, AND SCHEME
    KIFER, M
    LAUSEN, G
    PROCEEDINGS OF THE 1989 ACM SIGMOD INTERNATIONAL CONFERENCE ON THE MANAGEMENT OF DATA, 1989, 18 : 134 - 146
  • [44] A Higher-Order Indistinguishability Logic for Cryptographic Reasoning
    Baelde, David
    Koutsos, Adrien
    Lallemand, Joseph
    2023 38TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, LICS, 2023,
  • [45] A logic for reasoning with higher-order abstract syntax
    McDowell, R
    Miller, D
    12TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 1997, : 434 - 445
  • [46] Probabilities, causation, and logic programming in conditional reasoning: reply to Stenning and Van Lambalgen (2016)
    Oaksford, Mike
    Chater, Nick
    THINKING & REASONING, 2016, 22 (03) : 336 - 354
  • [47] Reasoning About Truth in First-Order Logic
    Strannegard, Claes
    Engstrom, Fredrik
    Nizamani, Abdul Rahim
    Rips, Lance
    JOURNAL OF LOGIC LANGUAGE AND INFORMATION, 2013, 22 (01) : 115 - 137
  • [48] Reasoning About Truth in First-Order Logic
    Claes Strannegård
    Fredrik Engström
    Abdul Rahim Nizamani
    Lance Rips
    Journal of Logic, Language and Information, 2013, 22 : 115 - 137
  • [49] Reasoning about taxonomies in first-order logic
    Thau, David
    Ludaescher, Bertram
    ECOLOGICAL INFORMATICS, 2007, 2 (03) : 195 - 209
  • [50] Decidable Reasoning in a First-Order Logic of Limited Conditional Belief
    Schwering, Christoph
    Lakemeyer, Gerhard
    ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, 285 : 1379 - 1387