Generalized Possibilistic Logic
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 multi-tiered 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.
KeywordsModal Logic Logic Programming Logic Formula Possibility Distribution Possibilistic Logic
Unable to display preview. Download preview PDF.
- 2.Benferhat, S., Hué, J., Lagrue, S., Rossit, J.: Interval-based possibilistic logic. In: Proc. 22nd Inter. Joint Conf. on Artif. Intellig (IJCAI 2011), Barcelona (July 16-22, 2011)Google Scholar
- 4.Dubois, D., Lang, J., Prade, H.: Possibilistic logic. In: Gabbay, D.M., et al. (eds.) Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 3, pp. 439–513. Oxford University Press, Oxford (1994)Google Scholar
- 6.Dubois, D., Prade, H.: Toward multiple-agent extensions of possibilistic logic. In: Proc. IEEE Inter. Conf. on Fuzzy Systems (FUZZ-IEEE 2007), London (UK), pp. 187–192 (July 23-26, 2007)Google Scholar
- 7.Dubois, D., Prade, H., Schockaert, S.: Rules and meta-rules in the framework of possibility theory and possibilistic logic. Scientia Iranica,18, Special issue dedicated to the 90th birthday of L. A. Zadeh (to appear, 2011)Google Scholar