Sparse term encoding for dynamic taxonomies

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

Volumn 1115, Issue , 1996, Pages 277-292

  Fall, Andrew ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENCY; ENCODING (SYMBOLS); KNOWLEDGE REPRESENTATION;

CONCEPTUAL GRAPH; DYNAMIC TAXONOMIES; ENCODING ALGORITHMS; INTEGER VECTORS; INTERVAL SETS; PRACTICAL SYSTEMS; SPACE AND TIME; TRANSITIVE CLOSURE;

SIGNAL ENCODING;

EID: 84955605506     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61534-2_18     Document Type: Conference Paper

References (19)

1. R. Agrawal, A. Borgida, and It. Jagadish. Efficient management of transitive relationships in large data bases, including is-a hierarchies. In Proceedings of ACM SIGMOD, 1989.
2. H. Ait-Kaci, R. Boyer, P. Lincoln, and R. Nasr. Efficient implementation of lattice operations. ACM Transactions on Programming Languages, 11(1):115-146, 1989.
3. H. Ait-Kaci and A. Podelski. Towards a meaning of LIFE. Journal of Logic Programming, 16(3/4):195, 1993.
4. Y. Caseau. Efficient handling of multiple inheritance hierarchies. ACM SIGPLAN Notices, 8(28):271, October 1993.
5. V. Dahl and A. Fall. Logical encoding of conceptual graph type lattices. In First Int. Conf. on Conceptual Structures, pages 216-224, Quebec, Canada, 1993.
6. B. A. Davey and It. A. Priestley. Introduction to Lattices and Order. Cambridge University Press, Cambridge, England, 1990.
7. G. Ellis. Managing Complex Objects. PhD thesis, The University of Queensland, Queensland, Australia, 1995.
8. A. Fall. The foundations of taxonomic encoding. Technical Report 94-20, Simon Fraser University CSS/LCCR, 1994.
9. A. Fall. An abstract framework for taxonomic encoding. In Proe. First International Symposium on Knowledge Retrieval, Use and Storage for Efficiency, Santa Cruz, USA, 1995.
10. A. Fall. Heterogeneous encoding. In Proc. First International Symposium on Knowledge Retrieval, Use and Storage for Efficiency, Santa Cruz, USA, 1995.
11. A. Fall. Sparse logical terms. Applied Mathematics Letters, 8(5):11-16, 1995.
12. D. Ganguly, C. Mohan, and S. Ranks. A space-and-time-efficient coding algorithm for lattice computations. IEEE Transactions on Knowledge and Data Engineering, 6(5):819-829, Oct 1994.
13. M. Habib, M. Ituchard, and J. Spinrad. A linear algorithm to decompose inheritance graphs. Algorithmica (to appear), 1995.
14. M. Habib and L. Nourine. Tree structure for distributive lattices and its applications. Technical Report R.R. LIRMM 94036, 1994.
15. M. Habib and L. Nourine. Embedding partially ordered sets into product of chains. In Proc. First International Symposium on Knowledge Representation, Use and Storage or Efficiency (KRUSE'95), Santa Cruz, USA, 1995.
16. R. Levinson. Towards domain independent machine intelligence. In Proc. First Int. Conf. on Conceptual Structures, Quebec, Canada, 1993. Springer-Verlag.
17. C. Mellish. Term-encodable description spaces. In Logic Programming 1990 Pre- Conference Proceedings, pages 1-15. Assoc. Logic Programming, UK Branch, 1990.
18. L. Nourine. Quelques Propridtds Algorithmiques des Treillis. PhD thesis, Académie de Montpellier, Université de MontpeUieré 1993.
19. W. Trotter. Combinatorics and Partially Ordered Sets. The Johns Hopkins University Press, Baltimore, 1992.