Probabilistic Logic System

A Probabilistic Logic System is a Logic System that ..

• See: Probabilistic Logic Program, Dempster-Shafer Theory, Probability Theory, Deductive Logic, Formal Proof.

---

---

References

2017

• (Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/probabilistic_logic#Modern_proposals Retrieved:2017-2-5.
  • Below is a list of proposals for probabilistic and evidentiary extensions to classical and predicate logic.
    • The term "probabilistic logic" was first used 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.
    • The central concept in the theory of subjective logic are 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 various degrees of ignorance about the truth of the proposition. For the computation rof 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 as well as conditional deduction (MP) and abduction (MT).
    • 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 with the one of the coherence of partial probabilistic assignment and therefore with Dutch book phenomenon.
    • 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 Pei Wang's Non-Axiomatic Reasoning System (NARS) or 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 theory of probabilistic argumentation, probabilities are not directly attached to logical sentences. Instead it is assumed that a particular subset [math]\displaystyle{ W }[/math] of the variables [math]\displaystyle{ V }[/math] involved in the sentences defines a probability space over the corresponding sub-σ-algebra. This induces two distinct probability measures with respect to [math]\displaystyle{ V }[/math] , 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 [math]\displaystyle{ V=\{\} }[/math] ) and classical posterior probabilities (for [math]\displaystyle{ V=W }[/math]). 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.
    • The SP theory of intelligence and its realisation in the SP computer model exhibits several forms of reasoning all of which are fundamentally probabilistic. These include: one-step deductive reasoning; chains of reasoning; abductive reasoning; reasoning with probabilistic networks and trees; reasoning with rules ; nonmonotonic reasoning and reasoning with default values; Bayesian reasoning with explaining away ; causal reasoning; reasoning that is not supported by evidence; and inheritance of attributes in class-inclusion hierarchies and part-whole hierarchies. There is also potential for spatial reasoning and for what-if reasoning. This versatility all flows from the central role in the SP system of the powerful concept of multiple alignment, a concept which has been borrowed and adapted from the concept of Multiple sequence alignment in bioinformatics. This framework allows the several forms of reasoning to work together flexibly in any combination. There is further information, with download links for papers, on The SP theory of intelligence.

2017

• (Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/probabilistic_logic Retrieved:2017-2-4.
  • The aim of a probabilistic logic (also probability logic and probabilistic reasoning) is to combine the capacity of probability theory to handle uncertainty with the capacity of deductive logic to exploit structure of formal argument. The result is a richer and more expressive formalism with a broad range of possible application areas. Probabilistic logics attempt to find a natural extension of traditional logic truth tables: the results they define are derived through probabilistic expressions instead. A difficulty with probabilistic logics is that they tend to multiply the computational complexities of their probabilistic and logical components. Other difficulties include the possibility of counter-intuitive results, such as those of Dempster-Shafer theory. The need to deal with a broad variety of contexts and issues has led to many different proposals.

2007

• (De Raedt et al., 2007) ⇒ Luc De Raedt, Angelika Kimmig, and Hannu Toivonen. (2007). “ProbLog: A Probabilistic Prolog and Its Application in Link Discovery.” In: Proceedings of the 20th international joint conference on Artifical intelligence.

---