Skip to main content
SpringerLink
Log in

On the concept of generic object: A nonmonotonic reasoning approach and examples

  • Conference paper
  • First Online:
Logics in Artificial Intelligence (JELIA 1994)

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

Included in the following conference series:

  • 133 Accesses

Abstract

In this paper we discuss the logical and commonsense intuitions behind the concept of generic object and the possibility of characterizing this concept by means of both classical first-order logic and circumscription. We also show that circumscription can be used in the characterization of the concept of generic point of a curve, as it appears in algebraic geometry. Finally, we show that several occurrences of the concept of generic object in computer science and mathematics can be shaped according to the same pattern of definition.

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. Aho, A.V. and Ullman, J.D. “Universality of Data Retrieval Languages”. Proc. 6th ACM Symposium on Principles of Programming Languages (San Antonio, Texas), 1979, 110–120.

    Google Scholar 

  2. Abiteboul, S. and Vianu, V. “Procedural Languages for Database Queries and Updates”, J. Computer and Systems Sciences, 41, 1990, 181–229.

    Google Scholar 

  3. Abiteboul, S. and Vianu, V. “Generic Computation and its Complexity”, Proceedings STOC'91, ACM, 209–219.

    Google Scholar 

  4. Armstrong, W.W. “Dependency Structures of Database Relationships”. Proc. IFIP 74, North Holland, 1974, 580–583.

    Google Scholar 

  5. Bertossi, L.E. and Reiter, R. “Circumscription and Generic Mathematical Objects”. Working Notes of the 4th International Workshop on Nonmonotonic Reasoning, Vermont, May 1992, AT&T and AAAI. To appear in Fundamenta Informaticae.

    Google Scholar 

  6. Cardelli, L. and Wegner, P. “On Understanding Types, Data Abstraction, and Polymorphism”. ACM Computing Surveys, 17, 4, 1985, 471–522.

    Google Scholar 

  7. Chang, C.C. and Keisler, J. “Model Theory”. North-Holland, 1978.

    Google Scholar 

  8. Cohen, P.A. “Set Theory and the Continuum Hypothesis”. Benjamin, 1966.

    Google Scholar 

  9. Etherington, D.W., Krauss, S. and Perlis, D. “Nonmonotonicity and the Scope of Reasoning”. Artificial Intelligence 52, 1991, 221–261.

    Google Scholar 

  10. Fagin, R. “Functional Dependencies in a Relational Database and Propositional Logic”. Revision of IBM Research Report RJ 1776, San Jose, California, 1976.

    Google Scholar 

  11. Ginsberg, M. “Negative Subgoals with Free Variables”. Journal of Logic Programming, 11, 1991.

    Google Scholar 

  12. Hull, R. and Yap, C.K. “The Format Model: A Theory of Database Organization”, J. ACM, 31, 3, 1984, 518–537.

    Google Scholar 

  13. Hodges, W. “Logical Features of Horn Clauses”. Handbook of Logic in Artificial Intelligence and Logic Programming, vol. 1, 449–503, Oxford University Press, 1993.

    Google Scholar 

  14. Keisler, J.H. “Fundamentals of Model Theory”. In Handbook of Mathematical Logic, Barwise, J. (ed.), North-Holland, 1977.

    Google Scholar 

  15. Lifschitz, V. “Circumscription”. In “Handbook of Logic in Artificial Intelligence and Logic Programming”, Oxford University Press. To appear.

    Google Scholar 

  16. Lifschitz, V. “Closed-World Databases and Circumscription”. Artificial Intelligence, 27, 1985, 229–235.

    Google Scholar 

  17. Lifschitz, V. “Computing Circumscription”. Proc. 9th IJCAI 1985, Morgan Kaufmann Publishers, 1985, 121–127.

    Google Scholar 

  18. Lloyd, J.W. “Foundations of Logic Programming”. Springer, 2nd edition, 1987.

    Google Scholar 

  19. Maier, D. “The Theory of Relational Databases”. Computer Science Press, 1983.

    Google Scholar 

  20. Makowsky, J.A. “Why Horn Formulas Matter in Computer Science: Initial Structures and Generic Examples”. Journal of Computer and Systems Sciences 34, 1987, 266–292.

    Google Scholar 

  21. McCarthy, J. “Circumscription — a form of non-monotonic reasoning”. Artificial Intelligence, 13, 1980, 27–39.

    Google Scholar 

  22. Mehlhorn, K. “Algorithms and Data Structures”. Springer, vol. 1, 1984.

    Google Scholar 

  23. Reiter, R. “On Closed World Data Bases”. In ‘Logic and Data Bases', Gallaire, H. and Minker, J. (eds.), Plenum Press, 1978, 55–76.

    Google Scholar 

  24. Reiter, R. “Nonmonotonic Reasoning”. Annual Reviews in Computer Science, vol. 2, 1987.

    Google Scholar 

  25. Robinson, A. “On the Metamathematics of Algebra”. North Holland, 1951.

    Google Scholar 

  26. Robinson, A. “Théorie Métamathématique des Idéaux”. Gauthier-Villars, Paris, 1955.

    Google Scholar 

  27. Robinson, A. “Forcing in Model Theory”. Symposia Mathematica, vol. 5, Academic Press, New York, 1971, 69–82.

    Google Scholar 

  28. Robinson, A. “Introduction to Model Theory and to the Metamathematics of Algebra”. North-Holland, 1974.

    Google Scholar 

  29. Sagiv, Y., Delobel, C., Parker, D.S. and Fagin, R. “An Equivalence between Relational Database Dependencies and a Fragment of Propositional Logic”. Journal of the ACM, 48, 3, 1981, 435–453.

    Google Scholar 

  30. Semple, J.G. and Kneebone, G.T. “Algebraic Curves”. Oxford University Press, 1959.

    Google Scholar 

  31. Seidenberg, A. “Elements of the Theory of Algebraic Curves”. Addison-Wesley, 1968.

    Google Scholar 

  32. Thom, R. “Structural Stability and Morphogenesis”, W.A. Benjamin, Inc., 1975.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Ciencia de la Computacion, Pontificia Universidad Catolica de Chile, Escuela de Ingenieria, Casilla 306, Santiago 22, Chile

    Leopolde E. Bertossi

  2. Department of Computer Science, University of Toronto, M5S 1A4, Toronto, Canada

    Raymond Reiter

  3. The Canadian Institute for Advanced Research, Canada

    Raymond Reiter

Authors
  1. Leopolde E. Bertossi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Raymond Reiter
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Craig MacNish David Pearce Luís Moniz Pereira

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bertossi, L.E., Reiter, R. (1994). On the concept of generic object: A nonmonotonic reasoning approach and examples. In: MacNish, C., Pearce, D., Pereira, L.M. (eds) Logics in Artificial Intelligence. JELIA 1994. Lecture Notes in Computer Science, vol 838. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021983

Download citation

  • DOI: https://doi.org/10.1007/BFb0021983

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48657-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation