An Overview of Possibilistic Handling of Default Reasoning, with Experimental Studies | Synthese Skip to main content
Log in

An Overview of Possibilistic Handling of Default Reasoning, with Experimental Studies

  • Published:
Synthese Aims and scope Submit manuscript

Abstract.

This paper first provides a brief survey of a possibilistic handling of default rules. A set of default rules of the form, “generally, from α deduce β”, is viewed as the family of possibility distributions satisfying constraints expressing that the situation where α and β is true has a greater plausibility than the one where a and - β is true. When considering only the subset of linear possibility distributions, the well-known System P of postulates proposed by Kraus, Lehmann and Magidor, has been obtained. We also present two rational extensions: one based on the minimum specificity principle and the other is based on the lexicographic ordering. The second part of the paper presents an empirical study of three desirable properties for a consequence relation that capture default reasoning: Rationality, Property Inheritance and Ambiguity Preservation. An experiment is conducted to investigate 13 patterns of inference for the test of these properties. Our experimental apparatus confirms previous results on the relevance of System P, and enforces the psychological relevance of the studied properties.

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

Access this article

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Similar content being viewed by others

References

  • E.W. Adams (1975) The Logic of Conditionals Reidel Dordrecht.

    Google Scholar 

  • S. Benferhat D. Dubois H. Prade (1997) ArticleTitleNonmonotonic Reasoning, Conditional Objects and Possibility Theory Artificial Intelligence Journal 92 259–276 Occurrence Handle10.1016/S0004-3702(97)00012-X

    Article  Google Scholar 

  • S. Benferhat A. Saffiotti P. Smets (2000) ArticleTitleBelief Functions and Default Reasoning Artificial Intelligence Journal 122 IssueID1-2 1–69 Occurrence Handle10.1016/S0004-3702(00)00041-2

    Article  Google Scholar 

  • Benferhat S., S.Kaci, D. Le Berre, and M. A. Williams. (2001, ’Weakening Conflicting Information for Iterated Revision and Knowledge Integration’, Proc. of the 17th Intern. Joint Conf. on Artificial Intelligence IJCAI01, pp. 109–115.

  • R.M. DaSilva Neves J.F. Bonnefon E. Raufaste (2002) ArticleTitleAn Empirical Test of Patterns for Nonmonotonic Inference Annals of Mathematics and Artificial Intelligence. 34 107–130

    Google Scholar 

  • Dubois D., Lang J., Prade H. (1994). Possibilistic Logic. In: Gabbay D.M., Hogger C.J., Robinson J.A., Nute D.(ed). Handbook of Logic in Artificial Intelligence and Logic Programming, Vol 3. Oxford University Press, pp. 439–513.

  • R. Elio F.J. Pelletier (1993) Human Benchmarks on AI’s Benchmark Problems Proc of the 15th Conference of the Cognitive Science Society Boulder, CO. 406–411

    Google Scholar 

  • D.M. Gabbay (1985) Theoretical Foundations for Non-Monotonic Reasoning in Expert Systems K.R. Apt (Eds) Logics and Models of Concurrent Systems. Springer Verlag Berlin 439–457

    Google Scholar 

  • P. Gärdenfors D. Makinson (1994) ArticleTitleNonmonotonic Inference Based on Expectations Artificial Intelligence 65 197–245

    Google Scholar 

  • C. Hewson C. Vogel (1994) Psychological Evidence for Assumptions of Path-Based Inheritance Reasoning Proc of the 16th Conference of the Cognitive Science Society Atlanta. 403–414

    Google Scholar 

  • S. Kraus D. Lehmann M. Magidor (1990) ArticleTitleNon-Monotonic Reasoning, Preferential Models and Cumulative Logics Artificial Intelligence 44 167–207 Occurrence Handle10.1016/0004-3702(90)90101-5

    Article  Google Scholar 

  • D. Lehmann M. Magidor (1992) ArticleTitleWhat Does a Conditional Knowledge Base Entail? Artificial Intelligence 55 1–60 Occurrence Handle10.1016/0004-3702(92)90041-U

    Article  Google Scholar 

  • Pearl J. (1990). System Z: A Natural Ordering of Defaults with Tractable Applications to Default Reasoning. Proc. of Theoretical Aspects of Reasoning about Knowledge, pp. 121–135.

  • F.J. Pelletier R. Elio (1997) ArticleTitleWhat Should Reasoning Be, by Default? Computational Intelligence 13 IssueID2 165–187 Occurrence Handle10.1111/0824-7935.00037

    Article  Google Scholar 

  • R. Reiter (1980) ArticleTitleA Logic for Default Reasoning Artificial Intelligence 13 81–132 Occurrence Handle10.1016/0004-3702(80)90014-4

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Salem Benferhat.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Benferhat, S., Bonnefon, J.F. & Neves, R.d.S. An Overview of Possibilistic Handling of Default Reasoning, with Experimental Studies. Synthese 146, 53–70 (2005). https://doi.org/10.1007/s11229-005-9069-6

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11229-005-9069-6

Keywords

Navigation