A logic-based analysis of Dempster-Shafer theory
type: Item
instance of: scholarly article
title: A logic-based analysis of Dempster-Shafer theory
zbMATH Open document ID: 0706.68087
DOI: 10.1016/0888-613X(90)90016-U
author: Gregory M. Provan
published in: International Journal of Approximate Reasoning
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68T15
Mathematics Subject Classification ID: 68T35
Mathematics Subject Classification ID: 03B05
Mathematics Subject Classification ID: 62C10
Mathematics Subject Classification ID: 03B48
zbMATH DE Number: 4160164
zbMATH Keywords: uncertainty
zbMATH Keywords: theorem proving
zbMATH Keywords: assumption-based truth maintenance system
zbMATH Keywords: reasoning system
zbMATH Keywords: Dempster-Shafer theory
MaRDI profile type: Publication
cites work: An Improved Algorithm for Network Reliability
cites work: Complexity of Finding Embeddings in a k-Tree
cites work: Evidential support logic programming
cites work: An Improved Abraham-Method for Generating Disjoint Sums
cites work: Q3941433
cites work: Q5518358
cites work: On the number of prime implicants
cites work: Probability, Frequency and Reasonable Expectation
cites work: Q4094173
cites work: Diagnosing multiple faults
cites work: Network-based heuristics for constraint-satisfaction problems
cites work: Q3835053
cites work: Upper and Lower Probabilities Generated by a Random Closed Interval
cites work: Consonant approximations of belief functions
cites work: Q5750423
cites work: Improved Bounds for System-Failure Probability
cites work: A method for managing evidential reasoning in a hierarchical hypothesis space: a retrospective
cites work: A statistical viewpoint on the theory of evidence
cites work: Q3039268
cites work: Recursive Disjoint Products, Inclusion-Exclusion, and Min-Cut Approximations
cites work: A Minimizing Algorithm for Sum of Disjoint Products
cites work: Probabilistic logic
cites work: Dempster's rule of combination is {\#}P-complete
cites work: Fusion, propagation, and structuring in belief networks
cites work: A Computational Approach to Approximate and Plausible Reasoning with Applications to Expert Systems
cites work: Bounds on the Reliability of Networks
cites work: Q3200594
cites work: The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
cites work: Computing Network Reliability in Time Polynomial in the Number of Cuts
cites work: A logic for default reasoning
cites work: Q5826088
cites work: Q4131415
cites work: Implementing Dempster's rule for hierarchical evidence
cites work: Q3994497
cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
cites work: The Complexity of Enumeration and Reliability Problems
cites work: A computationally efficient approximation of Dempster-Shafer theory
description: scientific article; zbMATH DE number 4160164