Skip to main content
SpringerLink
Log in
Book cover

International Conference on Conceptual Structures

ICCS 1993: Conceptual Graphs for Knowledge Representation pp 274–293Cite as

Efficient retrieval from hierarchies of objects using lattice operations

  • Conference paper
  • First Online:

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

Abstract

Managing large numbers of complex objects or descriptions requires sophisticated storage and retrieval mechanisms. Hierarchical classification techniques have proven to be useful for managing complex objects in practice. Previous classification methods have not used all the information recorded in hierarchies. We show how lattice operations can be used to navigate around a hierarchy. This is achieved by plunging the hierarchy into a boolean lattice of binary words. Greatest lower bound (GLB) and relative complementation (BUTNOT) lattice operations on the hierarchical structure (rather than the objects or descriptions themselves) are used to focus the search. Experiments show the number of objects compared when classifying objects using these techniques is significantly reduced.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hassan Aït-Kaci, Robert Boyer, Patrick Lincoln, and Roger Nasr. Efficient implementation of lattice operations. ACM Transactions on Programming Languages and Systems, 11(1):115–146, January 1989.

    Google Scholar 

  2. Hassan Aït-Kaci and Andreas Podelski. Towards a meaning of LIFE. In Jan Maluszyński and Martin Wirsing, editors, Proceedings of the 3rd International Symposium on Programming Language Implementation and Logic Programming (Passau, Germany), pages 255–274. Springer-Verlag, LNCS 528, August 1991.

    Google Scholar 

  3. Franz Baader, Bernhard Hollunder, Bernhard Nebel, Hans-Jürgen Profitlich, and Enrico Franconi. An empirical analysis of optimization techniques for terminological representation systems. In Proceedings of the 3rd International Conference on Principles of Knowledge Representation and Reasoning, Cambridge, MA, October 1992.

    Google Scholar 

  4. Robert M. Colomb. Implementing persistent Prolog: large, dynamic, shared procedures in Prolog. Ellis Horwood series in computers and their applications. Ellis Horwood, New York, 1990.

    Google Scholar 

  5. Gerard Ellis. Compiled hierarchical retrieval. In [11], pages 285–310, 1991. Also in the proceedings of the Sixth Conceptual Graphs Workshop, pages 187–207.

    Google Scholar 

  6. Gerard Ellis and Robert A. Levinson, editors. Proceedings of the First International Workshop on PEIRCE: A Conceptual Graphs Workbench, 1992. Held in association with the Seventh Annual Workshop on Conceptual Graphs, Las Cruces, New Mexico, July 8–10. Available as University of Queensland Technical Report 241, anonymous ftp ftp.cs.uq.oz.au, /pub/peirce/TR024i.ps.Z.

    Google Scholar 

  7. Shmuel Kliger and Ehud Shapiro. From decision trees to decision graphs. In S. Debray and M. Hermengildo, editors, Proceedings of the North American Conference on Logic Programming, pages 97–116. MIT Press, 1990. Austin, Texas, 29 October-1 November.

    Google Scholar 

  8. Robert A. Levinson. A Self-Organizing Retrieval System for Graphs. PhD thesis, University of Texas, May 1985.

    Google Scholar 

  9. Robert A. Levinson. Pattern associativity and the retrieval of semantic networks. Computers & Mathematics with Applications Journal, 23(2):573–600, 1992. Part 2 of special issue on Semantic Networks in Artificial Intelligence, Fritz Lehmann, Guest Editor, Pergamon Press. Also in Semantic Networks in Artificial Intelligence, F. Lehmann, ed., Pergamon Press, Oxford, 1992. Also appears as Technical Report UCSC-CRL-90-30, University of California, Computer Research Laboratory, Santa Cruz, CA 95064.

    Google Scholar 

  10. Robert A. Levinson and Richard Snyder. Adaptive pattern oriented chess. In Proceedings of AAAI-91, pages 601–605. Morgan-Kaufman, 1991.

    Google Scholar 

  11. Tim Nagle, Jan Nagle, Laurie Gerholz, and Peter Eklund, editors. Conceptual Structures: Current Research and Practice. Ellis Horwood, 1992.

    Google Scholar 

  12. James G. Schmolze and Thomas A. Lipkis. Classification in the KL-ONE knowledge representation system. In Alan Bundy, editor, Proceedings of Eighth International Joint Conference on Artificial Intelligence, Los Altos, California, 1983. William Kaufmann Inc. 8–12th August, Karlsruhe, West Germany.

    Google Scholar 

  13. John F. Sowa. Conceptual Structures: Information Processing in Mind and Machine. Addison-Wesley, Reading, MA, 1984.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Key Centre for Software Technology, Department of Computer Science, University of Queensland, QLD 4072, Brisbane, Australia

    Gerard Ellis

Authors
  1. Gerard Ellis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Guy W. Mineau Bernard Moulin John F. Sowa

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ellis, G. (1993). Efficient retrieval from hierarchies of objects using lattice operations. In: Mineau, G.W., Moulin, B., Sowa, J.F. (eds) Conceptual Graphs for Knowledge Representation. ICCS 1993. Lecture Notes in Computer Science, vol 699. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56979-0_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-56979-0_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56979-4

  • Online ISBN: 978-3-540-47848-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation