Encoding of multiple inheritance hierarchies and partial orders

Computational Intelligence

Volumn 15, Issue 1, 1999, Pages 50-62

  Caseau, Yves ^a   Habib, Michel ^b   Nourine, Lhouari ^b   Raynaud, Olivier ^b  

^a Bouygues Telecom   (France)

^b UNIV MONTPELLIER   (France)

Author keywords

Bit vector; Lattice; Partial order; Subsumption; Taxonomy encoding; Type inclusion

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); SET THEORY;

BIT-VECTOR ENCODING; SUBSET INCLUSION; TAXONOMY ENCODING;

OBJECT ORIENTED PROGRAMMING;

EID: 0033079956     PISSN: 08247935     EISSN: None     Source Type: Journal    
DOI: 10.1111/0824-7935.00081     Document Type: Article

References (22)

1. AGRAWAL, R., A. BORGIDA, and H. V. JAGADISH. 1989. Efficient management of transitive relationships in large data bases, including is-a hierarchies. ACM SIGMOD.
2. AIT-KACI, H., R. BOYER, P. LINCOLN, and R. NASR. 1989. Efficient implementation of lattice operations. ACM Transactions on Programming Languages and Systems, 1(11):115-146.
3. AIT-KACI, H., and A. PODELSKI. 1991. Is there a meaning to LIFE? 8th International Conference on Logic Programming, Paris.
4. BERTET, K., M. MORVAN, and L. NOURINE. 1997. Lazy completion of a partial order to the smallest lattice. International KRUSE Symposium on Knowledge Retrieval, Use and Storage for Efficiency, Vancouver, pp. 72-81.
5. CASEAU, Y. 1993. Efficient handling of multiple inheritance hierarchies. OOPSLA'93, pp. 271-287.
6. DAVEY, B. A., and H. PRIESTLEY. 1991. Introduction to Lattices and Orders. Cambridge University Press.
7. DUCOURNAU, R. 1989. Y3. Langage Objets. Manuel de refrences, Sema Group, Montrouge.
8. FALL, A. 1995. The foundations of taxomic encoding. International KRUSE Symposium on Knowledge Retrieval, Use and Storage for Efficiency, University of Santa-Cruz.
9. FRAIGNIAUD, P., and C. GAVOILLE. 1998. Interval routing schemes. Algorithmica, 21:155-182.
10. GAREY, M. R., and D. S. JOHNSON. 1979. Computers and intractability: A guide to the theory of NP-completeness. Freeman.
11. GRIGGS, J. R., J. STAHL, and W. T. TROTTER. 1984. A Sperner theorem on unrelated chains of subsets. Journal of Comb. Theory, (A): 124-127.
12. HABIB, M., M. HUCHARD, and L. NOURINE. 1995. Embedding partially ordered sets into chain-products. International KRUSE Symposium on Knowledge Retrieval, Use and Storage for Efficiency, University of Santa-Cruz: 147-161.
13. HABIB, M., L. NOURINE, and O. RAYNAUD. 1997. A new lattice-based heuristic for taxonomy encoding. International KRUSE Symposium on Knowledge Retrieval, Use and Storage for Efficiency, Vancouver, pp. 60-71.
14. KRALL, A., J. VITEK, and R. N. HORSPOOL. 1997. Near optimal hierarchical encoding of types. Ecoop'97, LNCS, 1241:128-145.
15. MARKOWSKY, G. 1980. The representation of posets and lattices by sets. Algebra Universalis, 11:173-192.
16. MOLLOY, M., and B. REED. 1997. Graph coloring via the probabilistic method. Preprint.
17. ORLIN, J. 1976. Covering by complete bipartite subgraphs. cf. GT 18. In Computer and intractability. Garey-Johnson.
18. SCHWARZ, R., and F. MATTERN. 1992. Detecting causal relationships in distributed computations - In search of the Holy Grail. Department of Computer Science, University of Kaiserslautern, Germany SBF124-15/92.
19. SKORSKY, M. 1992. Endliche Verbände Diagramme und Eigenschaften. Ph.D. thesis (written in English) Darmstadt, Germany.
20. STEELE, G. 1990. Common lisp: The language, 2nd ed. Prentice Hall.
21. TROTTER, W. T. 1975. Embedding finite posets in cubes. Discrete Mathematics, 12:165-172.
22. WILLE, R. 1982. Restructuring lattice theory: An approach based on hierarchies of contexts. In Ordered Sets. Edited by I. Rival. NATO ASI No 83, Reidel, Dordecht, pp. 445-470.