Skip to main content
SpringerLink
Log in
Book cover

Künstliche Intelligenz pp 96–103Cite as

Remarks on Consistency and Completeness of Circumscription

  • Conference paper

  • 118 Accesses

Part of the book series: Informatik-Fachberichte ((2252,volume 181))

Abstract

We discuss definable minimal models, the semantical counterpart of first order circumscription, examine the adequacy of Mott’s system of circumscription and show that some completeness results of Perlis and Minker fail in Mott’s system.

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

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C.C. Chang, H. Jerome Keisler: Model Theory, Amsterdam 1977

    Google Scholar 

  2. K.J. Devlin, Constructibility, Springer-Verlag, Berlin, 1984

    MATH  Google Scholar 

  3. D. Etherington, R. Mercer, R. Reiter: On the adequacy of predicate circumscription for closed-world reasoning, Comput. Intelligence 1 (1985) 11–15

    Article  Google Scholar 

  4. M. Ginsberg: A circumscriptive theorem prover (1987) (to appear)

    Google Scholar 

  5. M. Gelfond, H. Przymusinska, T. Przymusinski: The extended closed world assumption and its relationship to parallel circumscription, Proc. ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 133–139 (1986)

    Google Scholar 

  6. T. Imielinski: Results on Translating Defaults to Circumscription, AI 32 (1987) 131–146

    MathSciNet  MATH  Google Scholar 

  7. Vladimir Lifschitz: On the Satisfiability of Circumscription, Artificial Intelligence 28 (1986) 17–27

    Article  MathSciNet  MATH  Google Scholar 

  8. Vladimir Lifschitz: Computing Circumscription, Proceedings IJCAI 1985, 121–127

    Google Scholar 

  9. Peter L. Mott: A Theorem on the Consistency of Circumscription, Artificial Intelligence 31 (1987) 87–98

    Article  MathSciNet  MATH  Google Scholar 

  10. J. McCarthy: Circumscription - a form of non-monotonic reasoning, AI 13 (1980), 27–39

    MathSciNet  MATH  Google Scholar 

  11. J. McCarthy: Applications of Circumscription to Formalizing Common-Sense Knowledge, AI 28 (1986), 89–116

    MathSciNet  Google Scholar 

  12. M. P. Morreau: Circumscription, Report 85-15, Mathematisch Instituut, Universiteit van Amsterdam, 1985

    Google Scholar 

  13. Donald Perlis, Jack Minker: Completeness Results for Circum- scription, Artificial Intelligence 28 (1986) 29–42

    Article  MathSciNet  MATH  Google Scholar 

  14. Y. Shoham: A Semantical Approach to Nonmonotonic Logics, Proceedings, Logic in Computer Science 1987, 275–279

    Google Scholar 

  15. K. Schlechta: Defaults, Preorder Semantics and Circumscription, 1987 (unpublished)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Massmannstr. 4, D-1000, Berlin 41, Germany

    Karl Schlechta

Authors
  1. Karl Schlechta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fachbereich Informatik - WISBER, Universität Hamburg, Postfach 302762, D-2000, Hamburg 36, Deutschland

    Wolfgang Hoeppner

  2. EWH Koblenz, Rheinau 3-4, D-5400, Koblenz, Deutschland

    Wolfgang Hoeppner

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schlechta, K. (1988). Remarks on Consistency and Completeness of Circumscription. In: Hoeppner, W. (eds) Künstliche Intelligenz. Informatik-Fachberichte, vol 181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-74064-0_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-74064-0_10

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-642-74064-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation