Skip to main content
Springer Nature Link
Log in

A framework for default logics

  • Conference paper
  • First Online:
Logics in AI (JELIA 1992)

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

Included in the following conference series:

Abstract

We present a general framework for default logics, which encompasses most of the existing variants of default logic. It allows us to compare those variants from a knowledge representation point of view. We then exploit this framework to generalize Brewka's work on cumulative default logic, and to give an operational definition of extensions. Proof theoretical and semantical aspects are investigated.

This work was partially supported by the Esprit — BRA project DRUMS.

Work by the second author was partially performed during his stay at the Queen Mary and Westfield College, London, United Kingdom.

The authors wish to thank DRUMS people for their support. Especially, J. Mengin wishes to thank Mike Clarke for his support, and Mike Hopkins and Nick Wilson for fruitful discussions.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Allen, R. Fikes, and E. Sandewall, editors. Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR'91). Morgan Kaufmann, 1991.

    Google Scholar 

  2. L. C. Aiello, editor. Proceedings of the 9th European Conference on Artificial Intelligence (ECAI 90). ECCAI, August 1990.

    Google Scholar 

  3. P. Besnard. An Introduction to Default Logic. Springer-Verlag, New York, 1989.

    Google Scholar 

  4. N. Bidoit and C. Froidevaux. Minimalism subsums default logic and circumscription in stratified logic programming. In Proceedings of LICS-87, Ithaca, pages 89–97, 1987.

    Google Scholar 

  5. N. Bidoit and C. Froidevaux. General logic databases and programs: Default logic semantics and stratification. Information and Computation, 91:15–54, 1991.

    Article  Google Scholar 

  6. E. Bonté and F. Levy. Une procédure complète de calcul des extensions pour les théories de défauts en réseaux. In Actes du 7ème Congrès AFCET-RFIA, 1989.

    Google Scholar 

  7. G. Brewka. Cumulative default logic: In defense of nonmonotonic inference rules. Artificial Intelligence, 50:183–205, 1991.

    Article  Google Scholar 

  8. P. Besnard and T. Schaub. Possible world semantics for default logic. In Proceedings of the Canadian conference on artificial intelligence, 1992. to appear.

    Google Scholar 

  9. P. Chatalic and C. Froidevaux. Graded logics: a framework for uncertain and defeasible knowledge. In Proceedings of the International Symposium on Methodologies for Intelligent Systems, 1991.

    Google Scholar 

  10. J. P. Delgrande and W. K. Jackson. Default logic revisited. In Allen et al. [AFS91], pages 118–127.

    Google Scholar 

  11. R. A. de T. Guerreiro, M. A. Casanova, and A. S. Hemerly. Contribution to a proof theory for generic defaults. In Aiello [Aie90], pages 213–218.

    Google Scholar 

  12. D. W. Etherington. Reasoning with Incomplete Information. Pitman, London, 1988.

    Google Scholar 

  13. C. Froidevaux and C. Grossetête. Graded default theories for uncertainty. In Aiello [Aie90], pages 283–288.

    Google Scholar 

  14. C. Froidevaux and J. Mengin. A framework for default logics. Rapport de Recherche 755, L.R.I., Université Paris Sud, 1992.

    Google Scholar 

  15. C. Froidevaux. Default logic for action rule-based systems. In Proceedings of the 10th European Conference on Artificial Intelligence (ECAI 92). ECCAI, 1992. to appear.

    Google Scholar 

  16. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In Proceedings of the International Conference on Logic Programming, Seattle, pages 1070–1080. MIT Press, 1988.

    Google Scholar 

  17. M. Gelfond, V. Lifschitz, H. Przymusińska, and M. Truszczyński. Disjunctive defaults. In Allen et al. [AFS91], pages 230–237.

    Google Scholar 

  18. P. J. Krause, P. Byers, S. Hajnal, and J. Cozens. The formal specification of a database extension management system. Technical Report 116, Biomedical Computing Unit, Imperial Cancer Research Fund, 1991.

    Google Scholar 

  19. R. Kruse and P. Siegel, editors. Symbolic and Quantitative Approaches for Uncertainty, European Conference ECSQAU, volume 548 of Lecture Notes in Computer Science. Springer Verlag, 1991.

    Google Scholar 

  20. F. Levy. Computing extensions of default theories. In Kruse and Siegel [KS91], pages 219–226.

    Google Scholar 

  21. J.W. Lloyd. Foundations of logic programming. Springer-Verlag, New York, 2nd edition, 1987.

    Google Scholar 

  22. W. Lukaszewicz. Considerations on default logic — an alternative approach. Computational Intelligence, 4:1–16, 1988.

    Google Scholar 

  23. D. Makinson. General theory of cumulative inference. In Proceedings of the 2nd International Workshop on Nonmonotonic Reasoning, pages 1–18, Grassau, FRG, 1989. Springer-Verlag. Lecture Notes in A.I. 346.

    Google Scholar 

  24. D. L. Poole. What the lottery paradox tells us about default reasoning. In Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning (KR'89), pages 333–340, Toronto, 1989.

    Google Scholar 

  25. R. Reiter. A logic for default reasoning. Artificial Intelligence, 13:81–132, 1980.

    Article  Google Scholar 

  26. P. Rychlik. Some variations on default logic. In Proceedings of the National Conference on Artificial Intelligence (AAAI 91), pages 373–378. AAAI, 1991.

    Google Scholar 

  27. C. Schwind. A tableau-based theorem prover for a decidable subset of default logic. In Proceedings of the 10th International Conference on Automated deduction, volume 449 of Lecture notes in computer science, pages 541–546. Springer Verlag, 1990.

    Google Scholar 

  28. T. Schaub. Assertional default theories: a semantical view. In Allen et al. [AFS91], pages 496–506.

    Google Scholar 

  29. T. Schaub. On commitment and cumulativity in default logic. In Kruse and Siegel [KS91], pages 305–309.

    Google Scholar 

  30. C. Schwind and V. Risch. A tableau-based characterization for default logic. In Kruse and Siegel [KS91], pages 310–317.

    Google Scholar 

  31. N. Wilson. Rules, belief functions and default logic. In Proceedings of the Conference on Uncertainty in Artificial Intelligence, 1990.

    Google Scholar 

  32. A. Zhang and W. Marek. On the classification and existence of structures in default logic. In J.P. Martin and E.M. Morgado, editors, Proceedings of the 4th Portuguese Conference on Artificial Intelligence, volume 390 of Lecture Notes in Computer Science. Springer-Verlag, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratoire de Recherche en Informatique, Bat. 490 - Université Paris Sud, 91405, Orsay Cedex, France

    Christine Froidevaux & Jérôme Mengin

Authors
  1. Christine Froidevaux
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jérôme Mengin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

D. Pearce G. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Froidevaux, C., Mengin, J. (1992). A framework for default logics. In: Pearce, D., Wagner, G. (eds) Logics in AI. JELIA 1992. Lecture Notes in Computer Science, vol 633. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023427

Download citation

  • DOI: https://doi.org/10.1007/BFb0023427

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55887-3

  • Online ISBN: 978-3-540-47304-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics