Skip to main content
SpringerLink
Log in

A tableau-based characterisation for default logic

  • Contributed Papers
  • Conference paper
  • First Online:
Symbolic and Quantitative Approaches to Uncertainty (ECSQARU 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 548))

Abstract

This paper has two objectives:

  • We first give a necessary and sufficient criterion for the existence of extension of default theories in the general case.

  • Second, we present a new, efficient and clear method for computing extensions and deriving formulae of default theory in the general case. It is based on the semantic tableaux method [Smullyan 1968] and works for default theories with a finite set of defaults that are formulated over a decidable subset of first-order logic. We prove that all extensions (if any) of a default theory can be produced by constructing the semantic tableau of one formula built from the general laws and the default consequences.

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. Besnard P., Quiniou R., Quinton P. 1983. A Theorem-Prover for a decidable subset of default logic. Proceedings of the AAAI-83: 27–30.

    Google Scholar 

  2. Besnard P, Siegel P. 1988. Supposition-based logic for automated nonmonotonic reasoning. Proc. 9th Conf. on Automated Deduction, Argonne, Il.

    Google Scholar 

  3. Bossu G., Siegel P. 1985. Saturation, Nonmonotonic reasoning and the Closed-World Assumption. Artificial Intelligence 25, 1: 13–63.

    Google Scholar 

  4. Brown F. M. 1986. A commonsense theory of nonmonotonic reasoning. Proc. 8th Conf. on Automated Deduction, Oxford. Lecture Notes in Computer Science, Vol. 230, Springer Verlag: 209–228.

    Google Scholar 

  5. Etherington D. W. 1987. Formalizing Nonmonotonic Reasoning Systems. Artificial Intelligence, 31, 1: 81–132.

    Google Scholar 

  6. Gueirreiro R. A., Casanova M. A., Hermely A. S. 1990. Contributions to a Proof Theory for Generic Defaults. Proceedings of the 9th European Conference on Artificial Intelligence, ECAI — 90: 213–218.

    Google Scholar 

  7. Lafon E., Schwind C. 1988. A Theorem Prover for Action Performance. Proceedings of the 8th European Conference on Artificial Intelligence, ECAI-88: 541–546.

    Google Scholar 

  8. Lukaszewicz W. 1988. Considerations on Default Logic — An Alternative Approach. Computational Intelligence 4: 1–16.

    Google Scholar 

  9. Schwind C. 1985. Un démonstrateur de théorèmes pour des logiques modales et temporelles en PROLOG. 5ème Congrès AFCET Reconnaissance des formes et Intelligence Artificielle, Grenoble, France: 897–913.

    Google Scholar 

  10. Schwind C. 1990. A tableau-based theorem prover for a decidable subset of default logic. Proceedings of the 10th International Conference on Automated Deduction, CADE 10, Springer Verlag: 541–546.

    Google Scholar 

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

    Google Scholar 

  12. Smullyan R. 1968. First-Order Logic. Springer Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculté des Sciences de Luminy, Groupe d'Intelligence Artificielle, CNRS, 163 Avenue de Luminy, Case 901, 13288, Marseille, Cedex 9, France

    Camilla B. Schwind & Vincent Risch

Authors
  1. Camilla B. Schwind
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vincent Risch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Rudolf Kruse Pierre Siegel

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schwind, C.B., Risch, V. (1991). A tableau-based characterisation for default logic. In: Kruse, R., Siegel, P. (eds) Symbolic and Quantitative Approaches to Uncertainty. ECSQARU 1991. Lecture Notes in Computer Science, vol 548. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54659-6_107

Download citation

  • DOI: https://doi.org/10.1007/3-540-54659-6_107

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54659-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation