Handbook of logic in artificial intelligence and logic programming (vol. 3)
A Simple Modal Logic for Reasoning about Revealed Beliefs
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Interval-based possibilistic logic
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Three-Valued logics for incomplete information and epistemic logic
JELIA'12 Proceedings of the 13th European conference on Logics in Artificial Intelligence
Merging interval-based possibilistic belief bases
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
Towards a logic of argumentation
SUM'12 Proceedings of the 6th international conference on Scalable Uncertainty Management
A simple logic for reasoning about incomplete knowledge
International Journal of Approximate Reasoning
| Hi-index | 0.00 |
Usual propositional possibilistic logic formulas are pairs made of a classical logic formula associated with a weight thought of as a lower bound of its necessity measure. In standard possibilistic logic, only conjunctions of such weighted formulas are allowed (a weighted classical conjunction is equivalent to the conjunction of its weighted conjuncts, due to the min-decomposability of necessity measures). However, the negation and the disjunction of possibilistic logic formulas make sense as well. They were briefly introduced by the authors some years ago, in a multiple agent logic context. The present paper hints at the multitiered logic that is thus generated, and discusses its semantics in terms of families of possibility distributions. Its practical interest for expressing higher order epistemic states is emphasized.