A quasi optimal bit-vector encoding of tree hierarchies. Application to efficient type inclusion tests

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2072 LNCS, Issue , 2001, Pages 165-180

  Raynaud, Olivier ^a   Thierry, Eric ^a  

^a LIRMM   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); FORESTRY; FORMAL LANGUAGES; SET THEORY; SIGNAL ENCODING; VECTORS;

EFFICIENT IMPLEMENTATION; IMPORTANT FEATURES; INCLUSION TEST; MULTIPLE SUBTYPING; QUASI-OPTIMAL; SUBTYPINGS; THEORETICAL POINTS; TYPE HIERARCHIES;

OBJECT ORIENTED PROGRAMMING;

EID: 84881386426     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45337-7_10     Document Type: Conference Paper

References (19)

1. H. At-Kaci, R. Boyer, P. Lincoln, and R. Nasr. Efficient implementation of lattice operations. ACM Transactions on Programming Langages and Systems, 11(1):115-146, january 1989.
2. A. Bouchet. Codages et dimensions de relations binaires. Annals of Discrete Mathematics 23, Ordres: Description and Roles, (M. Pouzet, D. Richard eds), 1984.
3. Yves Caseau. Efficient handling of multiple inheritance hierarchies. In OOPSLA' 93, pages 271-287, 1993.
4. G. Ellis. Efficient retrieval fromh ierarchies of objects using lattice operations. In Conceptual Graphs for knowledge representation, (Proc. International conference on Conceptual Structures, Quebec City, Canada, August 4-7, 1993), G. W. Mineau, B. Moulin and J. Sowa, Eds, Lecture Notes in Artificial Intelligence 699, Springer, Berlin, 1993.
5. A. Fall. The foundations of taxomic encoding. in International KRUSE Symposium: Knowledge Retrieval, Use and Storage for Efficiency, University of Santa-Cruz., August 1995.
6. M. Habib, M. Huchard, and L. Nourine. Embedding partially ordered sets into chain-products. In International KRUSE Symposium: Knowledge Retrieval, Use and Storage for Efficiency. University of Santa-Cruz., pages 147-161, August 1995.
7. M. Habib and L. Nourine. Bit-vector encoding for partially ordered sets. In Proc. of International Workshop ORDAL'94, editor, Orders, Algorithms and Applications, number 831, pages 1-12, Lyon, France, July 1994. LNCS.
8. M. Habib, L. Nourine, and O. Raynaud. A new lattice-based heuristic for taxonomy encoding. In International KRUSE Symposium: Knowledge Retrieval, Use and Storage for Efficiency. Vancouver ., pages 60-71, August 1997.
9. A. Krall, J. Vitek, and R.N. Horspool. Near optimal hierarchical encoding of types. In Ecoop'97, LNCS, number 1241, pages 128-145.
10. G. Markowsky. The representation of posets and lattices by sets. Algebra Universalis, 11:173-192, 1980.
11. N.H.Cohen. Type-extension type tests can be performed in constant time. Programming languages and systems, 13(4):626-629, July 1991.
12. C. Quiennec. Fast and compact dispatching for dynamic object-oriented languages. Information Processing Letters (accepted for publication), 1997.
13. O. Raynaud and E. Thierry. Calcul de la 2-dimension d'un ensemble ordonn. Research Report 00082, LIRMM, Montpellier, France, 2000.
14. M. Skorsky. Endliche Verbnde Diagramme und Eigenschaften. PhD thesis, (written in English) Darmstadt, Germany, 1992.
15. J. Stahl and R. Wille. Preconcepts of contexts. in Proc. Universal Algebra (Sienna), 1984.
16. William T. Trotter. Embedding finite posets in cubes. Discrete Mathematics, 12:165-172, 1975.
17. J. Vitek, R.N. Horspool, and A. Krall. Efficient type inclusion tests. In OOPSLA' 97, number 1241, pages 128-145.
18. R. Wille. Restructuring lattice theory: An approach based on hierarchies of contexts. in Ordered sets,I. Rival, Eds. NATO ASI No 83, Reidel, Dordecht, Holland, pages 445-470, 1982.
19. M. Habib Y. Caseau, L. Nourine, and O. Raynaud. Encoding of mutiple inheritance hierarchie and partial orders. Computational Intelligence, 15:50-62, N1, 1999.