An algorithm for insertion into a lattice: Application to type classification | SpringerLink
Skip to main content

An algorithm for insertion into a lattice: Application to type classification

  • Data Organizations For Extended DBMSs
  • Conference paper
  • First Online:
Foundations of Data Organization and Algorithms (FODO 1989)

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

Abstract

The focus of this paper is on updates of a type hierarchy structured as a lattice. We propose below algorithms for inserting a new type into a specific lattice of types used in the knowledge base system MOSAICO [Mi87]. Such a structure is closely related to the concept of complete objects as defined in [Di88] and to the Concept Lattices studied in [Wi82].

This research was partially supported by a grant of the french PRC BD3 and was initiated while the author was on leave at IASI-CNR

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

7 References

  1. S. Abiteboul, C. Beeri, “On the power of languages for the manipulation of complex objects,” INRIA research report, No 846, May 1988.

    Google Scholar 

  2. G. Attardi et Al., “Taxonomic reasoning,” Proc. of ECAI Conference, Brighton, July 1986.

    Google Scholar 

  3. F. Bancilhon, “A Calculus for Complex Objects,” Proc. of ACM PODS, Boston, March 1986.

    Google Scholar 

  4. F. Bancilhon, “Object Oriented Database Systems,” Proc. of ACM PODS, Austin, Texas, March 1988.

    Google Scholar 

  5. G. Birkhoff, “Lattice Theory,” Colloquium Publications, Volume 25, American Mathematical Society, Providence, RI, 1940, Third (revised) edition, 1979.

    Google Scholar 

  6. M. Bouzeghoub, “MORSE: a functional query language and its semantic data model,” Proc. of 84 Trends and Applications of Databases Conference, IEEE-NBS, Gaithersburg, USA, 1984.

    Google Scholar 

  7. Brachman R. J., Schmolze J.G., “An overview of the KL-ONE Knowledge Representation System,” Cognitive Science 9, 1985.

    Google Scholar 

  8. L. Cardelli, “A Semantics of Multiple Inheritance,” in Lecture Notes in Comp. Science, No 173, Springer Verlag, 1984.

    Google Scholar 

  9. Codd, E.F., “A relational model for large shared data banks,” Comm. ACM 13:6, pp377–387, 1970.

    Google Scholar 

  10. E. Diday, “The symbolic approach in clustering and related methods of data analysis”, H.H. Bock (editor, Elsevier Science Publishers B.V. (north-Holland), 1988, pp. 673–683.

    Google Scholar 

  11. J. Gallier, “Logic for Computer Science,” Harper and Row, Publishers, New York, 1986.

    Google Scholar 

  12. Hull R., R. King, “Semantic Database Modeling: Survey, Applications, and Research Issues,” ACM Computing Survey, Vol. 19, No. 3, Sept. 1987.

    Google Scholar 

  13. Special Issue on Architectures for Knowledge Based Systems”, Comm. of ACM, Vol. 28 n. 9, Sept. 1985.

    Google Scholar 

  14. C. Lecluse, P. Richard, F. Velez, “O 2, an object oriented data model,” Proc. of SIGMOD conference, Chicago, 1988.

    Google Scholar 

  15. M. Missikoff, “MOKA: An User-friendly Front-End for Knowledge Acquisition,” Int'l Workshop on Database Machines and Artificial Intelligence, Minowbrook (N.Y.), July 1987.

    Google Scholar 

  16. R. Michalsky, R.E. Stepp, “Automated construction of classifications: conceptual clustering versus numerical taxonomy,” IEEE trans. on Pattern analysis and Machine Intelligence, Vol. 5, No. 4, 1983.

    Google Scholar 

  17. Special issue on “Nested relations,” Data engineering, (Z.M. Ozsoyoglu editor) Vol. 11, No. 3, Sept. 1988.

    Google Scholar 

  18. D.S. Touretzky, “The Mathematics of Inheritance Systems,” Morgan Kaufmann Publ., 1986.

    Google Scholar 

  19. R. Wille, “Restructuring lattice theory: an approach based on hierarchies of concepts,” Proc. of the symposium on ordered sets (I. Rival editor), Reidel, Dordrecht-Boston, 1982, pp. 445–470.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Witold Litwin Hans-Jörg Schek

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Missikoff, M., Scholl, M. (1989). An algorithm for insertion into a lattice: Application to type classification. In: Litwin, W., Schek, HJ. (eds) Foundations of Data Organization and Algorithms. FODO 1989. Lecture Notes in Computer Science, vol 367. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51295-0_119

Download citation

  • DOI: https://doi.org/10.1007/3-540-51295-0_119

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51295-0

  • Online ISBN: 978-3-540-46186-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics