A logic-based analysis of Dempster-Shafer theory
From MaRDI portal
Publication:918733
DOI10.1016/0888-613X(90)90016-UzbMath0706.68087MaRDI QIDQ918733
Publication date: 1990
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
uncertaintyDempster-Shafer theorytheorem provingassumption-based truth maintenance systemreasoning system
Bayesian problems; characterization of Bayes procedures (62C10) Probability and inductive logic (03B48) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Classical propositional logic (03B05)
Related Items (15)
Uncertain logic processing: logic-based inference and reasoning using Dempster-Shafer models ⋮ Dempster's rule of combination is {\#}P-complete ⋮ Theory of evidence ? A survey of its mathematical foundations, applications and computational aspects ⋮ On the hardness of approximate reasoning ⋮ An elementary belief function logic ⋮ Towards a logical belief function theory ⋮ Allocation of arguments and evidence theory ⋮ The validity of Dempster-Shafer belief functions ⋮ Rejoinder to comments on ``Reasoning with belief functions: An analysis of compatibility ⋮ On the complexity of belief network synthesis and refinement ⋮ Cost-bounded argumentation ⋮ A generalization of the algorithm of Heidtmann to non-monotone formulas ⋮ A Logical Version of the Belief Function Theory ⋮ Model-based diagnostics and probabilistic assumption-based reasoning ⋮ The reliability of reasoning with unreliable arguments
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fusion, propagation, and structuring in belief networks
- Consonant approximations of belief functions
- Probabilistic logic
- Implementing Dempster's rule for hierarchical evidence
- Evidential support logic programming
- Diagnosing multiple faults
- Network-based heuristics for constraint-satisfaction problems
- A logic for default reasoning
- On the number of prime implicants
- Dempster's rule of combination is {\#}P-complete
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Computing Network Reliability in Time Polynomial in the Number of Cuts
- A Computational Approach to Approximate and Plausible Reasoning with Applications to Expert Systems
- Bounds on the Reliability of Networks
- Complexity of Finding Embeddings in a k-Tree
- An Improved Abraham-Method for Generating Disjoint Sums
- Improved Bounds for System-Failure Probability
- A Minimizing Algorithm for Sum of Disjoint Products
- A statistical viewpoint on the theory of evidence
- The Complexity of Enumeration and Reliability Problems
- Recursive Disjoint Products, Inclusion-Exclusion, and Min-Cut Approximations
- An Improved Algorithm for Network Reliability
- A computationally efficient approximation of Dempster-Shafer theory
- Upper and Lower Probabilities Generated by a Random Closed Interval
- Probability, Frequency and Reasonable Expectation
- A method for managing evidential reasoning in a hierarchical hypothesis space: a retrospective
This page was built for publication: A logic-based analysis of Dempster-Shafer theory
