Skip to main content
SpringerLink
Log in

Possibilistic Logic: From Certainty-Qualified Statements to Two-Tiered Logics – A Prospective Survey

  • Conference paper
  • First Online:
Book cover Logics in Artificial Intelligence (JELIA 2019)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 11468))

Included in the following conference series:

Abstract

Possibilistic logic (PL) is more than thirty years old. The paper proposes a survey of its main developments and applications in artificial intelligence, together with a short presentation of works in progress. PL amounts to a classical logic handling of certainty-qualified statements. Certainty is estimated in the setting of possibility theory as a lower bound of a necessity set-function. An elementary possibilistic formula is a pair made of a classical logic formula, and a certainty level belonging to a bounded scale. Basic PL handles only conjunctions of such formulas, and PL bases can be viewed as classical logic bases layered in terms of certainty. Semantics is in terms of epistemic states represented by fuzzy sets of interpretations. A PL base is associated with an inconsistency level above which formulas are safe from inconsistency. Applications include reasoning with default rules, belief revision, Bayesian possibilistic networks, information fusion, and preference modeling (in this latter case, certainty is turned into priority). Different extensions of basic PL are briefly reviewed, where levels take values in lattices, are replaced by vectors of levels, or are handled in a purely symbolic manner (without being instantiated). This latter extension may be of interest for explanation purposes. A paraconsistent treatment of inconsistency is also discussed. Still another extension allows for associating possibilistic formulas with sets of agents or sources that support them. In generalized possibilistic logic (GPL), negation and disjunction can be applied as well as conjunction, to possibilistic formulas. It may be viewed as a fragment of modal logic (such as KD45) where modalities cannot be nested. GPL can be still extended to a logic involving both objective and non-nested multimodal formulas. Applications of GPL to the modeling of ignorance, to the representation of answer set programs, to reasoning about other agents’ beliefs, and to a logic of argumentation are outlined. Generally speaking, the interest and the strength of PL relies on a sound alliance between classical logic and possibility theory which offers a rich representation setting allowing an accurate modeling of partial ignorance. The paper focuses more on ideas than on technicalities and provides references for details (Invited talk presented by the second author).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Alsinet, T., Godo, L., Sandri, S.: Two formalisms of extended possibilistic logic programming with context-dependent fuzzy unification: a comparative description. Elec. Notes Theor. Comput. Sci. 66(5), 1–21 (2002)

    Article  Google Scholar 

  2. Amgoud, L., Prade, H.: Towards a logic of argumentation. In: Hüllermeier, E., Link, S., Fober, T., Seeger, B. (eds.) SUM 2012. LNCS (LNAI), vol. 7520, pp. 558–565. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33362-0_43

    Chapter  Google Scholar 

  3. Baader, F., Knechtel, M., Peñaloza, R.: Context-dependent views to axioms and consequences of semantic web ontologies. J. Web Semant. 12, 22–40 (2012)

    Article  Google Scholar 

  4. Banerjee, M., Dubois, D.: A simple logic for reasoning about incomplete knowledge. Int. J. Approx. Reason. 55, 639–653 (2014)

    Article  MathSciNet  Google Scholar 

  5. Banerjee, M., Dubois, D., Godo, L., Prade, H.: On the relation between possibilistic logic and modal logics of belief and knowledge. J. Appl. Non-Class. Log. 27, 206–224 (2017)

    Article  MathSciNet  Google Scholar 

  6. Bauters, K., Schockaert, S., De Cock, M., Vermeir, D.: Possible and necessary answer sets of possibilistic answer set programs. In: Proceedings of the 24th IEEE International Conference on Tools for AI (ICTAI), Athens, pp. 836–843 (2012)

    Google Scholar 

  7. Belhadi, A., Dubois, D., Khellaf-Haned, F., Prade, H.: Multiple agent possibilistic logic. J. Appl. Non-Class. Logics 23, 299–320 (2013)

    Article  MathSciNet  Google Scholar 

  8. Belhadi, A., Dubois, D., Khellaf-Haned, F., Prade, H.: Reasoning with multiple-agent possibilistic logic. In: Schockaert, S., Senellart, P. (eds.) SUM 2016. LNCS (LNAI), vol. 9858, pp. 67–80. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-45856-4_5

    Chapter  Google Scholar 

  9. Ben Amor, N., Benferhat, S., Dubois, D., Mellouli, K., Prade, H.: A theoretical framework for possibilistic independence in a weakly ordered setting. Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 10, 117–155 (2002)

    Article  MathSciNet  Google Scholar 

  10. Ben Amor, N., Dubois, D., Gouider, H., Prade, H.: Possibilistic preference networks. Inf. Sci. 460–461, 401–415 (2018)

    Article  MathSciNet  Google Scholar 

  11. Benferhat, S., Bouraoui, Z.: Possibilistic DL-Lite. In: Liu, W., Subrahmanian, V.S., Wijsen, J. (eds.) SUM 2013. LNCS (LNAI), vol. 8078, pp. 346–359. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-40381-1_27

    Chapter  Google Scholar 

  12. Benferhat, S., Bouraoui, Z., Loukil, Z.: Min-based fusion of possibilistic DL-Lite knowledge bases. In: Proceedings of the IEEE/WIC/ACM International Conference on Web Intelligence (WI 2013), Atlanta, pp. 23–28 (2013)

    Google Scholar 

  13. Benferhat, S., Dubois, D., Garcia, L., Prade, H.: On the transformation between possibilistic logic bases and possibilistic causal networks. Int. J. Approx. Reas. 29, 135–173 (2002)

    Article  MathSciNet  Google Scholar 

  14. Benferhat, S., Dubois, D., Kaci, S., Prade, H.: Possibilistic merging and distance-based fusion of propositional information. Ann. Math. Artif. Intellig. 34, 217–252 (2002)

    Article  MathSciNet  Google Scholar 

  15. Benferhat, S., Dubois, D., Prade, H.: Nonmonotonic reasoning, conditional objects and possibility theory. Artif. Intell. 92(1–2), 259–276 (1997)

    Article  MathSciNet  Google Scholar 

  16. Benferhat, S., Dubois, D., Prade, H.: From semantic to syntactic approaches to information combination in possibilistic logic. In: Bouchon-Meunier, B. (ed.) Aggregation and Fusion of Imperfect Information, pp. 141–161. Physica-Verlag, Heidelberg (1998)

    Chapter  Google Scholar 

  17. Benferhat, S., Dubois, D., Prade, H.: An overview of inconsistency-tolerant inferences in prioritized knowledge bases. In: Fuzzy Sets, Logic and Reasoning about Knowledge, pp. 395–417. Kluwer (1999)

    Google Scholar 

  18. Benferhat, S., Dubois, D., Prade, H.: Possibilistic and standard probabilistic semantics of conditional knowledge bases. J. Logic Comput. 9(6), 873–895 (1999)

    Article  MathSciNet  Google Scholar 

  19. Benferhat, S., Dubois, D., Prade, H.: Kalman-like filtering in a possibilistic setting. In: Proceedings of the 14th European Conference ECAI 2000, Berlin, pp. 8–12. IOS Press (2000)

    Google Scholar 

  20. Benferhat, S., Dubois, D., Prade, H.: A computational model for belief change and fusing ordered belief bases. In: Frontiers in Belief Revision, pp. 109–134. Kluwer (2001)

    Google Scholar 

  21. Benferhat, S., Dubois, D., Prade, H., Williams, M.A.: A framework for iterated belief revision using possibilistic counterparts to Jeffrey’s rule. Fundam. Inform. 99, 147–168 (2010)

    MathSciNet  MATH  Google Scholar 

  22. Benferhat, S., El Baida, R., Cuppens, F.: A possibilistic logic encoding of access control. In: Proceedings of the 16th International FLAIRS Conference, St. Augustine, pp. 481–485. AAAI Press (2003)

    Google Scholar 

  23. Benferhat, S., Hué, J., Lagrue, S., Rossit, J.: Interval-based possibilistic logic. In: Proceedings of the 22nd IJCAI 2011, Barcelona, pp. 750–755 (2011)

    Google Scholar 

  24. Benferhat, S., Prade, H.: Encoding formulas with partially constrained weights in a possibilistic-like many-sorted propositional logic. In: Proceedings of the 9th IJCAI, Edinburgh, pp. 1281–1286 (2005)

    Google Scholar 

  25. Benferhat, S., Smaoui, S.: Hybrid possibilistic networks. Int. J. Approx. Reason. 44(3), 224–243 (2007)

    Article  MathSciNet  Google Scholar 

  26. Boldrin, L., Sossai, C.: Local possibilistic logic. J. Appl. Non-Class. Log. 7, 309–333 (1997)

    Article  MathSciNet  Google Scholar 

  27. Cayrol, C., Dubois, D., Touazi, F.: Symbolic possibilistic logic: completeness and inference methods. J. Log. Comput. 28(1), 219–244 (2018)

    Article  MathSciNet  Google Scholar 

  28. Dubois, D.: Belief structures, possibility theory and decomposable measures on finite sets. Comput. AI 5, 403–416 (1986)

    MATH  Google Scholar 

  29. Dubois, D., Fariñas del Cerro, L., Herzig, A., Prade, H.: A roadmap of qualitative independence. In: Fuzzy Sets, Logics and Reasoning about Knowledge, pp. 325–350. Kluwer (1999)

    Google Scholar 

  30. Dubois, D., Fortemps, P.: Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints. Eur. J. Oper. Res. 160, 582–598 (2005)

    Article  MathSciNet  Google Scholar 

  31. Dubois, D., Hajek, P., Prade, H.: Knowledge-driven versus data-driven logics. J. Logic Lang. Inf. 9, 65–89 (2000)

    Article  MathSciNet  Google Scholar 

  32. Dubois, D., Prade, H.: Inconsistency management from the standpoint of possibilistic logic. Int. J. Uncertain. Fuzziness Knowl.-Based Syst. 23(Suppl. 1), 15–30 (2015)

    Article  MathSciNet  Google Scholar 

  33. Dubois, D., Prade, H.: A set-valued approach to multiple source evidence. In: Benferhat, S., Tabia, K., Ali, M. (eds.) IEA/AIE 2017. LNCS (LNAI), vol. 10351, pp. 113–118. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-60045-1_14

    Chapter  Google Scholar 

  34. Dubois, D., Prade, H.: A crash course on generalized possibilistic logic. In: Ciucci, D., Pasi, G., Vantaggi, B. (eds.) SUM 2018. LNCS (LNAI), vol. 11142, pp. 3–17. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-00461-3_1

    Chapter  Google Scholar 

  35. Dubois, D., Lang, J., Prade, H.: Advances in automated reasoning using possibilistic logic. In: Extended abstracts 1st European Workshop JELIA 1988, Roscoff, pp. 95–99 (1988)

    Google Scholar 

  36. Dubois, D., Lang, J., Prade, H.: Dealing with multi-source information in possibilistic logic. In: Proceedings of the 10th European Conference on Artificial Intelligence (ECAI 1992), Vienna, pp. 38–42 (1992)

    Google Scholar 

  37. 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 U. P. (1994)

    Google Scholar 

  38. Dubois, D., Le Berre, D., Prade, H., Sabbadin, R.: Using possibilistic logic for modeling qualitative decision: ATMS-based algorithms. Fundamenta Informaticae 37, 1–30 (1999)

    MathSciNet  MATH  Google Scholar 

  39. Dubois, D., Lorini, E., Prade, H.: The strength of desires: a logical approach. Minds Mach. 27(1), 199–231 (2017)

    Article  Google Scholar 

  40. Dubois, D., Prade, H.: Fuzzy Sets and Systems - Theory and Applications. Academic Press, Cambridge (1980)

    MATH  Google Scholar 

  41. Dubois, D., Prade, H.: Possibility Theory. Plenum Press, New York and London (1988)

    Book  Google Scholar 

  42. Dubois, D., Prade, H.: The logical view of conditioning and its application to possibility and evidence theories. Int. J. Approx. Reason. 4(1), 23–46 (1990)

    Article  MathSciNet  Google Scholar 

  43. Dubois, D., Prade, H.: Epistemic entrenchment and possibilistic logic. Artif. Intell. 50, 223–239 (1991)

    Article  MathSciNet  Google Scholar 

  44. Dubois, D., Prade, H.: Belief revision and updates in numerical formalisms: an overview, with new results for the possibilistic framework. In: Proceedings of the 13th IJCAI, Chambéry, pp. 620–625 (1993)

    Google Scholar 

  45. Dubois, D., Prade, H.: Conditional objects, possibility theory and default rules. In: Conditionals: From Philosophy to Computer Science, pp. 301–336. Oxford Science Publ. (1995)

    Google Scholar 

  46. Dubois, D., Prade, H.: A synthetic view of belief revision with uncertain inputs in the framework of possibility theory. Int. J. Approx. Reason. 17, 295–324 (1997)

    Article  MathSciNet  Google Scholar 

  47. Dubois, D., Prade, H.: Possibility theory: qualitative and quantitative aspects. In: Gabbay, D.M., Smets, P. (eds.) Quantified Representation of Uncertainty and Imprecision. Handbook of Defeasible Reasoning and Uncertainty Management Systems, vol. 1, pp. 169–226. Kluwer (1998)

    Google Scholar 

  48. Dubois, D., Prade, H.: Possibilistic logic: a retrospective and prospective view. Fuzzy Sets Syst. 144, 3–23 (2004)

    Article  MathSciNet  Google Scholar 

  49. Dubois, D., Prade, H.: From Blanché’s hexagonal organization of concepts to formal concept analysis and possibility theory. Logica Universalis 6(1–2), 149–169 (2012)

    Article  MathSciNet  Google Scholar 

  50. Dubois, D., Prade, H.: Possibilistic logic. An overview. In: Gabbay, D.M., et al. (eds.) Handbook of The History of Logic. Computational Logic, vol. 9, pp. 283–342. North-Holland (2014)

    Google Scholar 

  51. Dubois, D., Prade, H.: Being consistent about inconsistency: toward the rational fusing of inconsistent propositional logic bases. In: The Road to Universal Logic, II, pp. 565–571. Birkhäuser (2015)

    Google Scholar 

  52. Dubois, D., Prade, H.: Qualitative and semi-quantitative modeling of uncertain knowledge - a discussion. In: Computational Models of Rationality, pp. 280–296. College Publ. (2016)

    Google Scholar 

  53. Dubois, D., Prade, H., Sabbadin, R.: Decision-theoretic foundations of qualitative possibility theory. Eur. J. Oper. Res. 128(3), 459–478 (2001)

    Article  MathSciNet  Google Scholar 

  54. Dubois, D., Prade, H., Schockaert, S.: Stable models in generalized possibilistic logic. In: Proceedings of the 13th International Conference Principles Knowledge Representation and Reasoning (KR 2012), Rome, pp. 519–529 (2012)

    Google Scholar 

  55. Dubois, D., Prade, H., Schockaert, S.: Generalized possibilistic logic: foundations and applications to qualitative reasoning about uncertainty. Artif. Intell. 252, 139–174 (2017)

    Article  MathSciNet  Google Scholar 

  56. Farreny, H., Prade, H.: Positive and negative explanations of uncertain reasoning in the framework of possibility theory. In: Proceedings of the 5th Conference on UAI 1989, Windsor, pp. 95–101 (1989)

    Google Scholar 

  57. Gärdenfors, P.: Knowledge in Flux. MIT Press (1988). (2nd edn, College Publications 2008)

    Google Scholar 

  58. Kaci, S., Benferhat, S., Dubois, D., Prade, H.: A principled analysis of merging operations in possibilistic logic. In: Proceedings of the 16th Conference Uncertainty in Artificial Intelligence, (UAI 2000), Stanford, pp. 24–31 (2000)

    Google Scholar 

  59. Koehler, H., Leck, U., Link, S., Prade, H.: Logical foundations of possibilistic keys. In: Fermé, E., Leite, J. (eds.) JELIA 2014. LNCS (LNAI), vol. 8761, pp. 181–195. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-11558-0_13

    Chapter  Google Scholar 

  60. Kraus, S., Lehmann, D., Magidor, M.: Nonmonotonic reasoning, preferential models and cumulative logics. Artif. Intell. 44, 167–207 (1990)

    Article  MathSciNet  Google Scholar 

  61. Lafage, C., Lang, J., Sabbadin, R.: A logic of supporters. In: Bouchon-Meunier, B., Yager, R.R., Zadeh, L.A. (eds.) Information, Uncertainty and Fusion, pp. 381–392. Kluwer (1999)

    Google Scholar 

  62. Lang, J.: Possibilistic logic: complexity and algorithms. In: Algorithms for Uncertainty and Defeasible Reasoning, pp. 179–220. Kluwer (2001)

    Google Scholar 

  63. Lehmann, D., Magidor, M.: What does a conditional knowledge base entail? AIJ 55, 1–60 (1992)

    MathSciNet  MATH  Google Scholar 

  64. Link, S., Prade, H.: Relational database schema design for uncertain data. In: Proceedings of the 25th ACM International Conference CIKM 2016, Indianapolis, pp. 1211–1220 (2016)

    Google Scholar 

  65. Nicolas, P., Garcia, L., Stéphan, I., Lefèvre, C.: Possibilistic uncertainty handling for answer set programming. Ann. Math. Artif. Intell. 47(1–2), 139–181 (2006)

    Article  MathSciNet  Google Scholar 

  66. Nieves, J.C., Osorio, M., Cortés, U.: Semantics for possibilistic disjunctive programs. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 315–320. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-72200-7_32

    Chapter  Google Scholar 

  67. Parsons, T.: The traditional square of opposition. In: Zalta, E.N. (ed.) The Stanford Encyclopedia of Philosophy, Spring 2014 edn. Stanford University (1997)

    Google Scholar 

  68. Qi, G., Ji, Q., Pan, J.Z., Du, J.: Extending description logics with uncertainty reasoning in possibilistic logic. Int. J. Intell. Syst. 26(4), 353–381 (2011)

    Article  Google Scholar 

  69. Qi, G., Liu, W., Bell, D.: A comparison of merging operators in possibilistic logic. In: Bi, Y., Williams, M.-A. (eds.) KSEM 2010. LNCS (LNAI), vol. 6291, pp. 39–50. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15280-1_7

    Chapter  Google Scholar 

  70. Qi, G., Wang, K.: Conflict-based belief revision operators in possibilistic logic. In: Proceedings of the 26th AAAI Conference on Artificial Intelligence, Toronto (2012)

    Google Scholar 

  71. Serrurier, M., Prade, H.: Introducing possibilistic logic in ILP for dealing with exceptions. Artif. Intell. 171, 939–950 (2007)

    Article  MathSciNet  Google Scholar 

  72. Shafer, G.: A Mathematical Theory of Evidence. Princeton Univ. Press, Princeton (1976)

    MATH  Google Scholar 

  73. Walley, P.: Measures of uncertainty in expert systems. Artif. Intell. 83, 1–58 (1996)

    Article  MathSciNet  Google Scholar 

  74. Yager, R.R.: An introduction to applications of possibility theory. Hum. Syst. Manag. 3, 246–269 (1983)

    Google Scholar 

  75. Zadeh, L.: Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets Syst. 1, 3–28 (1978)

    Article  MathSciNet  Google Scholar 

  76. Zhu, J., Qi, G., Suntisrivaraporn, B.: Tableaux algorithms for expressive possibilistic description logics. In: Proceedings of the IEEE/ACM International Conference Web Intelligence (WI 2013), Atlanta, pp. 227–232 (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. IRIT – CNRS, 118, Route de Narbonne, 31062, Toulouse Cedex 09, France

    Didier Dubois & Henri Prade

Authors
  1. Didier Dubois
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Henri Prade
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Henri Prade .

Editor information

Editors and Affiliations

  1. University of Calabria, Rende, Italy

    Francesco Calimeri

  2. University of Calabria, Rende, Italy

    Nicola Leone

  3. Mathematics and Computer Science, University of Calabria, Rende, Italy

    Marco Manna

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dubois, D., Prade, H. (2019). Possibilistic Logic: From Certainty-Qualified Statements to Two-Tiered Logics – A Prospective Survey. In: Calimeri, F., Leone, N., Manna, M. (eds) Logics in Artificial Intelligence. JELIA 2019. Lecture Notes in Computer Science(), vol 11468. Springer, Cham. https://doi.org/10.1007/978-3-030-19570-0_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-19570-0_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-19569-4

  • Online ISBN: 978-3-030-19570-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation