Advertisement

An Overview of Possibilistic Logic and its Application to Nonmonotonic Reasoning and Data Fusion

  • S. Benferhat
  • D. Dubois
  • H. Prade
Conference paper
Part of the International Centre for Mechanical Sciences book series (CISM, volume 408)

Abstract

This paper provides a brief survey of possibilistic logic as a simple and efficient tool for handling nonmonotonic reasoning and data fusion. In nonmonotonic reasoning, Lehmann’s preferential System P is known to provide reasonable but very cautious conclusions, and in particular, preferential inference is blocked by the presence of “irrelevant” properties. When using Lehmann’s rational closure, the inference machinery, which is then more productive, may still remain too cautious. These two types of inference can be represented using a possibility theory-based semantics. The paper proposes several safe ways to overcome the cautiousness of these systems. One of these ways takes advantage of (contextual) independence assumptions of the form: the fact that δ is true (or is false) does not affect the validity of the rule “normally if α then β”. The modelling of such independence assumptions is discussed in the possibilistic framework. This paper presents a general approach for fusing several ordered belief bases provided by different sources according to various modes. More precisely, the paper provides the syntactic counterparts of different ways of aggregating possibility distributions, well-known at the semantic level.

Keywords

Possibility Distribution Default Rule Possibilistic Logic Possibility Theory Nonmonotonic Reasoning 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E.W. Adams (1975) The logic of conditionals. D. Reidel, Dordrecht.Google Scholar
  2. C. Barai, S. Kraus, J. Minker, Subrahmanian (1992) Combining knowledge bases consisting in first order theories. Computational Intelligence, 8 (1), 45–71.Google Scholar
  3. S. Benferhat (1994) Handling hard rules and default rules in possibilistic logic. In: Advances in Intelligent Computing — IPMU’94, (B. Bouchon-Meunier, R.R. Yager, L.A. Zadeh, Eds.), Lecture Notes in Computer Science, Vol. 945, Springer Verlag, Berlin, 1995, 302–310.Google Scholar
  4. S. Benferhat, D. Dubois, H. Prade (1992) Representing default rules in possibilistic logic. Proc. of the 3rd Inter. Conf. on Principles of Knowledge Representation and Reasoning (KR’92), Cambridge, MA, Oct. 25–29, 673–684.Google Scholar
  5. S. Benferhat, D. Dubois, H. Prade (1994) Expressing independence in a possibilistic framework and its application to default reasoning. Proc. of the 11th Europ. Conf. on Artificial Intelligence (ECAI’94), Amsterdam, Aug. 8–12, 150–154.Google Scholar
  6. S. Benferhat, D. Dubois, H. Prade (1996a) Beyond counter-examples to nonmonotonic formalisms: A possibility-theoretic analysis. Proc. of the 12th Europ. Conf. on Artificial Intelligence (ECAI’96) (W. Wahlster, ed.), Budapest, Hungary, Aug. 11–16, Wiley, New York, 652–656.Google Scholar
  7. S. Benferhat, D. Dubois, H. Prade (1996b) Coping with the limitations of rational inference in the framework of possibility theory. Proc. of the 12th Conf. on Uncertainty in Artificial Intelligence (E. Horvitz, F. Jensen, Eds.), Portland, Oregon, Aug. 1–4, Morgan Kaufmann, San Mateo, CA, 90–97.Google Scholar
  8. S. Benferhat, D. Dubois, H. Prade (1997a) Nonmonotonic reasoning, conditional objects and possibility theory. Artificial Intelligence, 92, 259–276.MathSciNetCrossRefMATHGoogle Scholar
  9. S. Benferhat, D. Dubois, H. Prade (1997b) From semantic to syntactic approaches to information combination in possibilistic logic. In Aggregation and Fusion of Imperfect Information, Physica Verlag, pp. 141–151.Google Scholar
  10. L. Cholvy (1998) Reasoning about merging information. In Handbook of Defeasible Reasoning and Uncertainty Management Systems, Vol. 3, 233–263.Google Scholar
  11. L.J. Cohen (1977) The Probable and the Provable. Clarendon Press, Oxford, UK.Google Scholar
  12. D. Dubois, L. Farinas del Cerro, A. Herzig, H. Prade (1994) An ordinal view of independence with application to plausible reasoning. Proc. of the 10th Conf. on Uncertainty in Artificial Intelligence (R. Lopez de Mantaras, D. Poole, Eds.), Seattle, WA, July 29–31, 195–203Google Scholar
  13. D. Dubois, L. Farinas del Cerro, A. Herzig, H. Prade (1996) A roadmap of qualitative independence. In: Tech. Report IRIT/96–44-R, IRIT, Univ. P. Sabatier, Toulouse, France.Google Scholar
  14. Dubois D., Lang J., Prade H. (1987) Theorem proving under uncertainty — A possibility theory-based approach. Proc. of the 10th Inter. Joint Conf. on Artificial Intelligence, Milano, Italy, August, 984–986.Google Scholar
  15. D. Dubois, J. Lang, H. Prade (1994) Possibilistic logic. In: Handbook of Logic in Artificial Intelligence and Logic Programming, Vol. 3 ( D.M. Gabbay, C.J. Hogger, J.A. Robinson, D. Nute, Eds. ), Oxford University Press, 439–513.Google Scholar
  16. D. Dubois, H. Prade (1987) Necessity measures and the resolution principle, IEEE Trans. Systems, Man and Cybernetics, Vol. 17, pp. 474–478.MathSciNetCrossRefMATHGoogle Scholar
  17. D. Dubois, H. Prade (with the collaboration of H. Farreny, R. Martin-Clouaire, C. Testemale) (1988) Possibility Theory — An Approach to Computerized Processing of Uncertainty. Plenum Press, New York.Google Scholar
  18. D. Dubois, and H. Prade (1990). The logical view of conditioning and its application to possibility and evidence theories. Int. J. of Approximate Reasoning, 4, 23–46.Google Scholar
  19. D. Dubois, H. Prade (1991) Possibilistic logic, preferential models, non-monotonicity and related issues. Proc. of the Inter. Joint Conf. on Artificial Intelligence (IJCAI’91), Sydney, Aug. 24–30, 419–424.Google Scholar
  20. D. Dubois, H. Prade (1995) Conditional objects, possibility theory and default rules’. In: Conditionals: From Philosophy to Computer Sciences (G. Crocco, L. Farinas del Cerro and A. Herzig, Eds. ), Oxford University Press, 301–336.Google Scholar
  21. D.M. Gabbay (1985) Theoretical foundations for non-monotonic reasoning in expert systems. In: Logics and models of Concurrent Systems (K.R. Apt, ed. ), Springer Verlag, 439–457.Google Scholar
  22. P. Gärdenfors (1988) Knowledge in Flux — Modeling the Dynamic of Epistemic States. MIT Press, Cambridge, MA.Google Scholar
  23. P. Gärdenfors, D. Makinson (1994) Nonmonotonic inference based on expectations. Artificial Intelligence, 65, 197–245.MathSciNetCrossRefMATHGoogle Scholar
  24. M. Goldszmidt, J. Pearl (1990) On the relation between rational closure and System Z. Proc. of the 3rd Inter. Workshop on Nonmonotonic Reasoning, South Lake Tahoe, 130–140.Google Scholar
  25. E. Hisdal (1978) Conditional Possibilities independence and noninteraction. Fuzzy Sets and Systems 1, 283–297.CrossRefMATHGoogle Scholar
  26. S. Kraus, D. Lehmann, M. Magidor (1990) Nonmonotonic reasoning, preferential models and cumulative logics. Artificial Intelligence, 44, 167–207.MathSciNetCrossRefMATHGoogle Scholar
  27. J. Lang (1991) Logique possibiliste: aspects formels, déduction automatique, et applications. PhD Thesis, Universite P. Sabatier, Toulouse, France, January 1991.Google Scholar
  28. D. Lehmann (1989) What does a conditional knowledge base entail ? Proc. of the 1st Inter. Conf. on Principles of Knowledge Representation and Reasoning (KR’89), Toronto, 357–367.Google Scholar
  29. D. Lehmann, M. Magidor (1992) What does a conditional knowledge base entail? Artficial Intelligence, 55, 1–60.MathSciNetCrossRefMATHGoogle Scholar
  30. D.L. Lewis (1973) Counterfactuals. Basil Blackwell Ltd, Oxford.Google Scholar
  31. J. Lin and Mendelzon (1992). Merging databases under constraints. International Journal of Cooperative Information Systems. Vol. 7 (1), 55–76.CrossRefGoogle Scholar
  32. D. Makinson (1989) General theory of cumulative inference. In: Non-Monotonic Reasoning in (M. Reinfrank, J. De Kleer, M.L. Ginsberg, E. Sandewall, Eds.),.LAI 346, Springer Verlag, Berlin, 1–18.Google Scholar
  33. S. Nahmias (1978) Fuzzy variables. Fuzzy Sets and Systems, 97–110.Google Scholar
  34. J. Pearl (1990) System Z: A natural ordering of defaults with tractable applications to default reasoning. Proc. of the 3rd Conf. on Theoretical Aspects of Reasoning About Knowledge (TARK’90), San Mateo, CA, 121–135.Google Scholar
  35. N. Rescher (1976) Plausible Reasoning: An Introduction to the Theory and Practice of Plausibilistic Inference. Van Gorcum, Amsterdam.Google Scholar
  36. Y. Shoham (1988) Reasoning About Change — Time and Causation from the Standpoint of Artificial Intelligence. MIT Press, Cambridge, MA.Google Scholar
  37. G.L.S. Shackle (1961) Decision, Order and Time in Human Affairs. Cambridge University Press, Cambridge, UK.Google Scholar
  38. W. Spohn (1988) Ordinal conditional functions: A dynamic theory of epistemic states. In: Causation in Decision, Belief Change, and Statistics ( W.L. Harper, B. Skyrms, Eds.), Kluwer Academic Publ., Dordrecht, 105–134.CrossRefGoogle Scholar
  39. R.R. Yager (1992) On the specificity of a possibility distribution. Fuzzy Sets and Systems, 50, 279–292.MathSciNetCrossRefMATHGoogle Scholar
  40. L.A. Zadeh (1978) Fuzzy sets as a basis for a theory of possibility. Fuzzy Sets and Systems, 1, 3–28.MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Wien 2000

Authors and Affiliations

  • S. Benferhat
    • 1
  • D. Dubois
    • 1
  • H. Prade
    • 1
  1. 1.Paul Sabatier UniversityToulouseFrance

Personalised recommendations