Skip to main content

Conditioned Circumscription: Translating Defaults to Circumscription

  • Conference paper
GWAI-90 14th German Workshop on Artificial Intelligence

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 251))

Abstract

In this article a new form of circumscription, called conditioned circumscription is developed, that permits translating arbitrary defaults to circumscription. As a consequence the deduction methods of first-order predicate logic can be applied to default logic. The circumscription policy will be fixed and by showing the equivalence of conditioned circumscription and the corresponding default theory a model-theoretic semantics for default logic is presented.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Bauer and G. Merziger. Conditioned Circumscription: Translating Defaults to Circumscription. Memo 34, Universität des Saarlandes, 1989.

    Google Scholar 

  2. Gerhard Brewka. Nonmonotonic Reasoning — From Theoretical Foundations Towards Efficient Computation. PhD thesis, Universität Hamburg, 1989.

    Google Scholar 

  3. David W. Etherington. Reasoning with Incomplete Information. Morgan Kaufmann, Los Altos, California, 1988.

    MATH  Google Scholar 

  4. Benjamin Grosof. Default reasoning as circumscription. In Non-Monotonic Reasoning Workshop, New Paltz, pages 115–124, 1984.

    Google Scholar 

  5. Tomasz Imielinski. Results on translating defaults to circumscription. AI, 31:131–146, 1987.

    MathSciNet  Google Scholar 

  6. Vladimir Lifschitz. Computing circumscription. In Proceedings of the 9th International Joint Conference on Artificial Intelligence, pages 121–127, 1985.

    Google Scholar 

  7. Vladimir Lifschitz. Pointwise circumscription. In Matthew L. Ginsberg, editor, Readings in Nonmonotonic Reasoning, pages 179–193, Morgan Kaufmann, Los Altos, California, 1987.

    Google Scholar 

  8. Witold Lukaszewicz. Considerations on default logic. In Non-Monotonic Reasoning Workshop, New Paltz, pages 165–193, 1984.

    Google Scholar 

  9. Karl Schlechta. Defaults, preorder semantics and circumscription. 1987. (unpublished)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Merziger, G., Bauer, M. (1990). Conditioned Circumscription: Translating Defaults to Circumscription. In: Marburger, H. (eds) GWAI-90 14th German Workshop on Artificial Intelligence. Informatik-Fachberichte, vol 251. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-76071-6_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-76071-6_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-53132-6

  • Online ISBN: 978-3-642-76071-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics