Skip to main content

A model-based approach to consistency-checking

  • Communications Session 3B Knowledge Representation
  • Conference paper
  • First Online:

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

Abstract

We propose a model-based approach to incremental consistency checking in default theorem proving. We show that the crucial task of consistency checking can benefit from keeping models in order to restrict the attention to ultimately necessary consistency checks. This is supported by the concept of default lemmata that allow for an additional avoidance of redundancy.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W. Bibel. Automated Theorem Proving. Vieweg Verlag, Braunschweig, 1987.

    Google Scholar 

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

    Google Scholar 

  3. J. Delgrande, T. Schaub, and W. Jackson. Alternative approaches to default logic. Artificial Intelligence, 70(1–2):167–237, 1994.

    Google Scholar 

  4. D. Loveland. Automated Theorem Proving: A Logical Basis. North-Holland, 1978.

    Google Scholar 

  5. W. Łukaszewicz. Considerations on default logic—an alternative approach. Computational Intelligence, 4:1–16, 1988.

    Google Scholar 

  6. A. Mikitiuk and M. Truszczyński. Rational default logic and disjunctive logic programming. In A. Nerode and L. Pereira, eds, Second Workshop on Logic Programming and Non-monotonic Reasoning., pages 283–299. MIT Press, 1993.

    Google Scholar 

  7. D. Poole. A logical framework for default reasoning. Artificial Intelligence, 36:27–47, 1988.

    Google Scholar 

  8. R. Reiter. A logic for default reasoning. Artificial Intelligence, 13(1–2):81–132, 1980.

    Google Scholar 

  9. A. Rothschild. Algorithmische Untersuchungen zu Defaultlogiken. Diplomarbeit, FB Informatik, TH Darmstadt, Germany, 1993.

    Google Scholar 

  10. T. Schaub. On constrained default theories. In B. Neumann, editor, Proceedings of the European Conference on Artificial Intelligence, pages 304–308. John Wiley & sons, 1992.

    Google Scholar 

  11. T. Schaub. A new methodology for query-answering in default logics via structure-oriented theorem proving. Journal of Automated Reasoning, 15(1):95–165, 1995.

    Google Scholar 

  12. C. Schwind. A tableaux-based theorem prover for a decidable subset of default logic. In M. Stickel, editor, Proceedings of the Conference on Automated Deduction. Springer, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Zbigniew W. Raś Maciek Michalewicz

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brüning, S., Schaub, T. (1996). A model-based approach to consistency-checking. In: Raś, Z.W., Michalewicz, M. (eds) Foundations of Intelligent Systems. ISMIS 1996. Lecture Notes in Computer Science, vol 1079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61286-6_156

Download citation

  • DOI: https://doi.org/10.1007/3-540-61286-6_156

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61286-5

  • Online ISBN: 978-3-540-68440-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics