Skip to main content
SpringerLink
Log in

Inscription — A rule of conjecture

  • Non-Standard Logics
  • Conference paper
  • First Online:
EPIA 89 (EPIA 1989)

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

Included in the following conference series:

  • 112 Accesses

Abstract

Conjectural reasoning, introduced by McCarthy's circumscription is one of the most important non standard methods of inference. It allows the generation of plausible conclusions, plausibility being defined on the basis of a minimization criterion.

Inscription — a dual of circumscription — is another method for “jumping to conclusions” based on a maximization criterion suitable for inductive reasoning.

Examples of circumscription and inscription and an application of inscription to inductive reasoning are presented.

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. McCarthy J., “Circumscription — A form of non-monotonic reasoning”, Artificial Intelligence 13, pp. 27–39, 1980.

    Google Scholar 

  2. McCarthy J., “Applications of Circumscription to Formalizing Common-sense knowledge”, Artificial Intelligence 28, pp. 89–116, 1986.

    Google Scholar 

  3. Hanks S. e McDermott D., “Default reasoning, nonmonotonic logics, and the frame problem”, Proceedings of the Fifth National Conference on Artificial Intelligence, pp. 328–333, 1986.

    Google Scholar 

  4. Genesereth M.J. and Nilsson N.J., Logical Foundations of Artificial Intelligence, Los Altos, CA: Morgan Kaufmann, 1987.

    Google Scholar 

  5. Shoham Y., “Nonmonotonic Logics: Meaning and Utility”, Proceedings of the Tenth International Joint Conference on Artificial Intelligence, pp. 388–392, Milan, Italy, 1987.

    Google Scholar 

  6. Besnard P. and Siegel P., “The Preferential-Models Approach to Non-Monotonic Logics”, Non-Standard Logics for Automated Reasoning, Ed. Smets, Mamdani, Dubois, and Prad. New York: Academic Press, pp. 137–161, 1988.

    Google Scholar 

  7. Reiter R., “On Closed World Databases”, Logic and Databases. Ed H. Gallaire and J. Minker, pp 55–76. New York: Plenum Press, 1978.

    Google Scholar 

  8. Bossu G., and Siegel P., “Saturation, Non Monotonic Reasoning, and The Closed World Assumption”, Artificial Intelligence 25, pp. 13–63, 1985.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Instituto Superior Técnico, Technical University of Lisbon, Av. Rovisco Pais, 1000, Lisboa, Portugal

    Carlos Pinto-Ferreira & João Pavão Martins

Authors
  1. Carlos Pinto-Ferreira
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. João Pavão Martins
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. P. Martins E. M. Morgado

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pinto-Ferreira, C., Martins, J.P. (1989). Inscription — A rule of conjecture. In: Martins, J.P., Morgado, E.M. (eds) EPIA 89. EPIA 1989. Lecture Notes in Computer Science, vol 390. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51665-4_81

Download citation

  • DOI: https://doi.org/10.1007/3-540-51665-4_81

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51665-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation