Probabilistic logics and probabilistic networks
A fundamental question in classical logics is that of inference, in particular if premises \(\varphi_1,\dots,\varphi_n\) entail a conclusion \(\psi.\) This book investigates this question in the framework of probabilistic logic. For probabilities \(X_1,\dots,X_n,Y\subseteq[0,1]\), the question treated is which probability/ies \(Y\) make \[ \varphi_1^{X_1},\dots,\varphi_n^{X_n}{\mathrel|\joinrel\approx}\,\psi^Y \] true, where \(\chi^X\) is interpreted as ``the probability of \(\chi\) lies in \(X\). The authors refer to this schema as the \textit{Fundamental Question of Probabilistic Logic}. Structurally, the book consists of two main parts; the first part (Chapter 2 to Chapter 7), the second part (Chapter 8 to Chapter 14) and a conclusion (Chapter 15). In the first part, the authors show how the above schema can be interpreted in several probabilistic frameworks: standard probabilistic semantics, probabilistic argumentation, evidential probability, statistical inference, Bayesian statistical inference and objective Bayesian epistemology. The second part shows how Bayesian and credal networks are in a canonical way calculi for these five frameworks. Summing up, the authors give the following simple recipe (page 85): {\parindent5mm \begin{itemize}\item[1)] Formulate a question as in the above schema. \item[2)] Decide upon appropriate semantics. \item[3)] Construct a network for the left-hand side of the above schema. \item[4)] Use the machinery presented in in this book to solve the question posed in the first step. \end{itemize}} The underlying theme of this book is to give a framework unifying various approaches of combining probability and logic with the goal of practical applications.
- The entropy-limit (conjecture) for \(\Sigma_2\)-premisses
- A triple uniqueness of the maximum entropy approach
- Towards the entropy-limit conjecture
- Towards classifying propositional probabilistic logics
- Introduction: Combining probability and logic
- Confirmation as partial entailment: a representation theorem in inductive logic
- From Bayesian epistemology to inductive logic
- Application of probabilistic logic for the semantic retrieval of commodities on the internet
- Updating a progic
- Rules of proof for maximal entropy inference
- Determining maximal entropy functions for objective Bayesian inductive logic
- Probability logics. Probability-based formalization of uncertain reasoning
- Bayesian programming
- Probabilistic inference and monadic second order logic
- Bayesian networks. A probabilistic logic approach
- Probabilistic Logic Networks
- Possible semantics for a common framework of probabilistic logics
- \(n\)-tuple algebra-based probabilistic logic
- scientific article; zbMATH DE number 3918277 (Why is no real title available?)
- The logic of empirical theories revisited
- Probabilistic reasoning and probabilistic neural networks
- scientific article; zbMATH DE number 48812 (Why is no real title available?)
- Modelling phenomena and dynamic logic of phenomena
- Probabilistic logic via capacities
- Why frequentists and Bayesians need each other
- On the probability and cost of ignorance, inconsistency, nonsense and more
- Towards a Bayesian theory of second-order uncertainty: lessons from non-standard logics
- Logical relations in a statistical problem
- Logical perspectives on the foundations of probability
- Generalizing probabilistic material implication and Bayesian conditionals
- Making decisions with evidential probability and objective Bayesian calibration inductive logics
- A battle in the statistics wars: a simulation-based comparison of Bayesian, frequentist and Williamsonian methodologies
- A gentle approach to imprecise probability
- Conditional probabilities as degrees of similarity and as degrees of entailment
- A decidable class of inferences in first-order objective Bayesian inductive logic
- Degrees of truthlikeness, independence, equality and order in probabilistic propositional knowledge representation
- Where do we stand on maximal entropy?
- Conditioning and interpretation shifts
- Reasoning about uncertain conditionals
- Demystifying dilation
This page was built for publication: Probabilistic logics and probabilistic networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2638162)
