## Belief Functions and Default Reasoning (2000)

### Cached

### Download Links

- [aass.oru.se]
- [iridia0.ulb.ac.be]
- [aass.oru.se]
- [iridia0.ulb.ac.be]
- [iridia0.ulb.ac.be]
- [aass.oru.se]
- DBLP

### Other Repositories/Bibliography

Citations: | 38 - 3 self |

### BibTeX

@MISC{Benferhat00belieffunctions,

author = {S. Benferhat and A. Saffiotti and P. Smets},

title = {Belief Functions and Default Reasoning},

year = {2000}

}

### Years of Citing Articles

### OpenURL

### Abstract

We present a new approach to deal with default information based on the theory of belief functions. Our semantic structures, inspired by Adams' epsilon semantics, are epsilon-belief assignments, where mass values are either close to 0 or close to 1. In the first part of this paper, we show that these structures can be used to give a uniform semantics to several popular non-monotonic systems, including Kraus, Lehmann and Magidor's system P, Pearl's system Z, Brewka's preferred sub-theories, Geffner's conditional entailment, Pinkas' penalty logic, possibilistic logic and the lexicographic approach. In the second part, we use epsilon-belief assignments to build a new system, called LCD, and show that this system correctly addresses the well-known problems of specificity, irrelevance, blocking of inheritance, ambiguity, and redundancy.