In the present paper we introduce nonmonotonic belief set operators and selection operators to formalize and to analyze multiple belief sets in an abstract setting. We define and investigate formal properties of belief set operators as absorption, congruence, supradeductivity and weak belief monotony. Furthermore, it is shown that for each belief set operator satisfying strong belief cumulativity there exists a largest monotonic logic underlying it, thus generalizing a result for nonmonotonic inference operations. Finally, we study abstract properties of selective inference operations connected to belief set operators and which are used to choose one of the possible views.
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||International Conference on Formal and Applied Practical Reasoning, FAPR 1996|
|Period||3/06/96 → 7/06/96|
- Belief sets
- Knowledge representation
- Nonmonotonic inference