On the applicability of maximum entropy to inexact reasoning
From MaRDI portal
Publication:1116362
DOI10.1016/0888-613X(89)90012-1zbMath0665.68079OpenAlexW2051165274MaRDI QIDQ1116362
Jeffrey Bruce Paris, Alena Vencovská
Publication date: 1989
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0888-613x(89)90012-1
Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Measures of information, entropy (94A17)
Related Items
The information geometry of Bregman divergences and some applications in multi-expert reasoning, A foundational approach to generalising the maximum entropy inference process to the multi-agent context, Two characterizations of a minimum-information principle for possibilistic reasoning, A triple uniqueness of the maximum entropy approach, Unnamed Item, From statistical knowledge bases to degrees of belief, Logical perspectives on the foundations of probability, Rules of proof for maximal entropy inference, Inference Processes for Quantified Predicate Knowledge, Invariant equivocation, A note on the inevitability of maximum entropy, Asymptotic conditional probabilities: The non-unary case, ON FILLING-IN MISSING CONDITIONAL PROBABILITIES IN CAUSAL NETWORKS, Adaptive decision making via entropy minimization, How much do you believe!, Probabilistic characterisation of models of first-order theories, A method for updating that justifies minimum cross entropy, The entropy-limit (conjecture) for \(\Sigma_2\)-premisses, On the applicability of the ``number of possible states argument in multi-expert reasoning, A note on how Renyi entropy can create a spectrum of probabilistic merging operators, Formal frameworks for approximate reasoning, A model of belief
Cites Work
- Unnamed Item
- Unnamed Item
- Fusion, propagation, and structuring in belief networks
- Probabilistic logic
- Distributed revision of composite beliefs
- Incidence calculus: A mechanism for probabilistic reasoning
- Information Theory and Statistical Mechanics
- Combining functions for certainty degrees in consulting systems
- Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy