Generalized Possibilistic Logic

  • Didier Dubois
  • Henri Prade
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6929)


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.


Modal Logic Logic Programming Logic Formula Possibility Distribution Possibilistic Logic 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Banerjee, M., Dubois, D.: A simple modal logic for reasoning about revealed beliefs. In: Sossai, C., Chemello, G. (eds.) ECSQARU 2009. LNCS (LNAI), vol. 5590, pp. 805–816. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  2. 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
  3. 3.
    Boldrin, L., Sossai, C.: Local possibilistic logic. Journal of Applied Non-Classical Logics 7(3), 309–333 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 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
  5. 5.
    Dubois, D., Prade, H.: Possibilistic logic: a retrospective and prospective view. Fuzzy Sets and Systems 144, 3–23 (2004)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 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. 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
  8. 8.
    Zadeh, L.A.: Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets and Systems 1, 3–28 (1978)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Zadeh, L.A.: PRUF: A meaning representation language for natural languages. Int. J. of Man-Machine Studies 10, 395–460 (1978)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Didier Dubois
    • 1
  • Henri Prade
    • 1
  1. 1.IRIT, Université Paul SabatierToulouse Cedex 09France

Personalised recommendations