We provide an overview of the theory of approximate reasoning and discuss the measurement of information in this reasoning system using specificity. It is then shown how to represent the binary propositional logic in the framework of approximate reasoning. Using the measure of specificity we show ho
β¦ LIBER β¦
Resolution principles in possibilistic logic
β Scribed by Didier Dubois; Henri Prade
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 918 KB
- Volume
- 4
- Category
- Article
- ISSN
- 0888-613X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Measuring information in possibilistic l
β
Ronald R. Yager
π
Article
π
1999
π
John Wiley and Sons
π
English
β 180 KB
π 1 views
Extending description logics with uncert
β
Guilin Qi; Qiu Ji; Jeff Z. Pan; Jianfeng Du
π
Article
π
2011
π
John Wiley and Sons
π
English
β 290 KB
Possibilistic logic provides a convenient tool for dealing with uncertainty and handling inconsistency. In this paper, we propose possibilistic description logics as an extension of description logics, which are a family of well-known ontology languages. We first give the syntax and semantics of pos
A split-combination approach to merging
β
Guilin Qi; Weiru Liu; David H. Glass; David A. Bell
π
Article
π
2007
π
Springer Netherlands
π
English
β 690 KB
The permutation principle in quantificat
β
Kit Fine
π
Article
π
1983
π
Springer Netherlands
π
English
β 259 KB
The Leibniz principle in quantum logic
β
Roberto Giuntini; Peter Mittelstaedt
π
Article
π
1989
π
Springer
π
English
β 462 KB
A superposition principle in quantum log
β
Sylvia PulmannovΓ‘
π
Article
π
1976
π
Springer
π
English
β 309 KB