---
title: "Probabilistic logic"
chunk: 2/2
source: "https://en.wikipedia.org/wiki/Probabilistic_logic"
category: "reference"
tags: "science, encyclopedia"
date_saved: "2026-05-05T03:44:54.389289+00:00"
instance: "kb-cron"
---

The term "probabilistic logic" was first used by John von Neumann in a series of Caltech lectures 1952 and 1956 paper "Probabilistic logics and the synthesis of reliable organisms from unreliable components", and subsequently in a paper by Nils Nilsson published in 1986, where the truth values of sentences are probabilities. The proposed semantical generalization induces a probabilistic logical entailment, which reduces to ordinary logical entailment when the probabilities of all sentences are either 0 or 1. This generalization applies to any logical system for which the consistency of a finite set of sentences can be established.
Gaifman and Snir have developed a globally consistent and empirically satisfactory unification of classic probability theory  and first-order logic that is suitable for inductive reasoning. Their theory assigns probabilities or degrees of beliefs to sentences consistent with the knowledge base (probability 1 for facts and axioms), consistent with the standard (Kolmogorov) probability axioms and logical deduction, and allows (Bayesian) inductive reasoning and learning in the limit. Most importantly, unlike most alternative proposals, it allows confirmation of universally quantified hypotheses. The theory has also been extended to higher-order logic. Both solutions are purely theoretical but have spawned practical approximations.
The central concept in the theory of subjective logic is opinions about some of the propositional variables involved in the given logical sentences. A binomial opinion applies to a single proposition and is represented as a 3-dimensional extension of a single probability value to express probabilistic and epistemic uncertainty about the truth of the proposition. For the computation of derived opinions based on a structure of argument opinions, the theory proposes respective operators for various logical connectives, such as e.g. multiplication (AND), comultiplication (OR), division (UN-AND) and co-division (UN-OR) of opinions, conditional deduction (MP) and abduction (MT)., as well as Bayes' theorem.
The approximate reasoning formalism proposed by fuzzy logic can be used to obtain a logic in which the models are the probability distributions and the theories are the lower envelopes. In such a logic the question of the consistency of the available information is strictly related to that of the coherence of partial probabilistic assignment and therefore with Dutch book phenomena.
Markov logic networks implement a form of uncertain inference based on the maximum entropy principle—the idea that probabilities should be assigned in such a way as to maximize entropy, in analogy with the way that Markov chains assign probabilities to finite-state machine transitions.
Systems such as Ben Goertzel's Probabilistic Logic Networks (PLN) add an explicit confidence ranking, as well as a probability to atoms and sentences.  The rules of deduction and induction incorporate this uncertainty, thus side-stepping difficulties in purely Bayesian approaches to logic (including Markov logic), while also avoiding the paradoxes of Dempster–Shafer theory.  The implementation of PLN attempts to use and generalize algorithms from logic programming, subject to these extensions.
In the field of probabilistic argumentation, various formal frameworks have been put forward. The framework of "probabilistic labellings", for example, refers to probability spaces where a sample space is a set of labellings of argumentation graphs. In the framework of "probabilistic argumentation systems" probabilities are not directly attached to arguments or logical sentences. Instead it is assumed that a particular subset 
  
    
      
        W
      
    
    {\displaystyle W}
  
 of the variables 
  
    
      
        V
      
    
    {\displaystyle V}
  
 involved in the sentences defines a probability space over the corresponding sub-σ-algebra. This induces two distinct probability measures with respect to 
  
    
      
        V
      
    
    {\displaystyle V}
  
, which are called degree of support and degree of possibility, respectively. Degrees of support can be regarded as non-additive probabilities of provability, which generalizes the concepts of ordinary logical entailment (for 
  
    
      
        V
        =
        {
        }
      
    
    {\displaystyle V=\{\}}
  
) and classical posterior probabilities (for 
  
    
      
        V
        =
        W
      
    
    {\displaystyle V=W}
  
). Mathematically, this view is compatible with the Dempster–Shafer theory.
The theory of evidential reasoning also defines non-additive probabilities of probability (or epistemic probabilities) as a general notion for both logical entailment (provability) and probability. The idea is to augment standard propositional logic by considering an epistemic operator K that represents the state of knowledge that a rational agent has about the world. Probabilities are then defined over the resulting epistemic universe Kp of all propositional sentences p, and it is argued that this is the best information available to an analyst. From this view, Dempster–Shafer theory appears to be a generalized form of probabilistic reasoning.

== See also ==

== References ==

== Further reading ==
Adams, E. W., 1998. A Primer of Probability Logic. CSLI Publications (Univ. of Chicago Press).
Bacchus, F., 1990. "Representing and reasoning with Probabilistic Knowledge. A Logical Approach to Probabilities". The MIT Press.
Carnap, R., 1950. Logical Foundations of Probability. University of Chicago Press.
Chuaqui, R., 1991. Truth, Possibility and Probability: New Logical Foundations of Probability and Statistical Inference. Number 166 in Mathematics Studies. North-Holland.
Haenni, H., Romeyn, JW, Wheeler, G., and Williamson, J. 2011. Probabilistic Logics and Probabilistic Networks, Springer.
Hájek, A., 2001, "Probability, Logic, and Probability Logic," in Goble, Lou, ed., The Blackwell Guide to Philosophical Logic, Blackwell.
Jaynes, E., 1998, "Probability Theory: The Logic of Science", pdf and Cambridge University Press 2003.
Kyburg, H. E., 1970. Probability and Inductive Logic Macmillan.
Kyburg, H. E., 1974. The Logical Foundations of Statistical Inference, Dordrecht: Reidel.
Kyburg, H. E. & C. M. Teng, 2001. Uncertain Inference, Cambridge: Cambridge University Press.
Romeiyn, J. W., 2005. Bayesian Inductive Logic. PhD thesis, Faculty of Philosophy, University of Groningen, Netherlands. [1]
Williamson, J., 2002, "Probability Logic," in D. Gabbay, R. Johnson, H. J. Ohlbach, and J. Woods, eds., Handbook of the Logic of Argument and Inference: the Turn Toward the Practical. Elsevier: 397–424.

== External links ==
Progicnet: Probabilistic Logic And Probabilistic Networks
Subjective logic demonstrations
The Society for Imprecise Probability