Rules of proof for maximal entropy inference

DOI10.1016/j.ijar.2022.11.016OpenAlexW4310015220MaRDI QIDQ2677855

Jürgen Landes

Publication date: 6 January 2023

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2022.11.016

zbMATH Keywords

first-order logicinductive logicmaximal entropyuncertain inferencerules of proof

Mathematics Subject Classification ID

Probability and inductive logic (03B48)

Related Items (1)

Making decisions with evidential probability and objective Bayesian calibration inductive logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Deceptive updating and minimal information methods
• The principle of maximum entropy and a problem in probability kinematics
• Qualitative probabilistic inference under varied entropy levels
• Equivocation axiom on first order languages
• Axiomatic characterizations of information measures
• Probabilism, entropies and strictly proper scoring rules
• A note on the inevitability of maximum entropy
• On the applicability of maximum entropy to inexact reasoning
• Nonmonotonic reasoning, preferential models and cumulative logics
• What does a conditional knowledge base entail?
• A method for updating that justifies minimum cross entropy
• The logic of paradox
• Common sense and maximum entropy
• Dilation for sets of probabilities
• Nonmonotonic inference based on expectations
• Invariant equivocation
• In defense of the maximum entropy inference process
• A logic for reasoning about probabilities
• Probabilistic characterisation of models of first-order theories
• The entropy-limit (conjecture) for \(\Sigma_2\)-premisses
• Three ways of being non-material
• A triple uniqueness of the maximum entropy approach
• Towards the entropy-limit conjecture
• Concerning measures in first order calculi
• Non-monotonic reasoning from an evolution-theoretic perspective: Ontic, logical and cognitive foundations
• Probabilistic logics and probabilistic networks
• Lectures on Inductive Logic
• O IS NOT ENOUGH
• Objective Bayesian probabilistic logic
• A Note on the Least Informative Model of a Theory
• Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
• Proof systems for probabilistic uncertain reasoning
• An efficient algorithm to compute maximum entropy densities
• The Uncertain Reasoner's Companion
• Probability Theory
• Information and Inaccuracy
• Objective Bayesian Nets for Integrating Consistent Datasets
• THE LOGIC OF THE EVIDENTIAL CONDITIONAL
• Pure Inductive Logic
• Maximum Entropy Inference with Quantified Knowledge
• Efficient numerical approximation of maximum entropy estimates
• Elicitation of Personal Probabilities and Expectations
• ON FILLING-IN MISSING CONDITIONAL PROBABILITIES IN CAUSAL NETWORKS
• Conditionals in nonmonotonic reasoning and belief revision. Considering conditionals as agents

This page was built for publication: Rules of proof for maximal entropy inference