Skip to main content
SpringerLink
Log in
Book cover

International Conference on Automated Deduction

CADE 1984: 7th International Conference on Automated Deduction pp 414–425Cite as

Applications of Protected Circumscription

  • Conference paper

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

Abstract

We examine applications of an extension of circumscription that allows protection of certain objects against being included in the circumscription process. We show that this allows a clean handling of incomplete information in problems from artificial intelligence and databases.

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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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.

Bibliography

  • Clark, K. [1978] “Negation as Failure”, In: Logic and Databases, (Gallaire, H. and Minker, J., Eds.) Plenum Press, NY 1978, 293–322.

    Google Scholar 

  • Davis, M. [1980] “The Mathematics of Non-Monotonic Reasoning”. Artificial Intelligence 13 (1980), 73–80.

    Article  MathSciNet  MATH  Google Scholar 

  • McCarthy, J. [1980] “Circumscription—A Form of Non-Monotonic Reasoning”. Artificial Intelligence 13 (1980), 27–39.

    Article  MathSciNet  MATH  Google Scholar 

  • McDermott, D., and Doyle, J. [1980] “Non-Monotonic Logic I” Artificial Intelligence 13 (1980), 41–72.

    Article  MathSciNet  MATH  Google Scholar 

  • Minker, J. [1982] “On Indefinite Databases and the Clmed-World Assumption”. Springer-Voting Lecture Notes in Computer Science, v.138, 292–308. Sixth Conference on Automated Deduction. New York, NY. 1982.

    Article  Google Scholar 

  • Minker, J., and Perlis, D. [1984] “On the Semantics of Circumscription”. Technical Report, Univ. of Marylsad, 1984.

    Google Scholar 

  • Reiter, R. [1980] “A Logic for Default Reasoning”. Artificial Intelligence 13 (1980), 81–132.

    Article  MathSciNet  MATH  Google Scholar 

  • Reiter, R. [1978] “On Closed World Databases”. In: Logic sad Data Bases, (Gailaire, H. and Minker, J., eds.) Plenum, 1978, 55–76.

    Google Scholar 

  • Reiter, R. [1982] “Circumscription Implies Predicate Completion (Sometimes)”. Proceedings of AAAI-82, 418–420.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of Maryland, College Park, MD, 20742

    Jack Minker & Donald Perlis

Authors
  1. Jack Minker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Donald Perlis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. SRI International, 333 Ravenswood Avenue, Menlo Park, CA, 94025, USA

    R. E. Shostak

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Minker, J., Perlis, D. (1984). Applications of Protected Circumscription. In: Shostak, R.E. (eds) 7th International Conference on Automated Deduction. CADE 1984. Lecture Notes in Computer Science, vol 170. Springer, New York, NY. https://doi.org/10.1007/978-0-387-34768-4_24

Download citation

  • DOI: https://doi.org/10.1007/978-0-387-34768-4_24

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-96022-7

  • Online ISBN: 978-0-387-34768-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation