Exploiting the induced order on type-labeled graphs for fast knowledge retrieval

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

Volumn 835 LNAI, Issue , 1994, Pages 294-310

  Ellis, Gerard ^a   Lehmann, Fritz ^b  

^a RMIT UNIVERSITY   (Australia)

^b GRANDAI Software ^*  (United States)

Author keywords

Bit string; Conceptual graphs; Deductive database; Encoding; Fret product; Graph database; Information retrieval; Knowledge base; Order theory; Poset; Skeleton product; Subgraph isomorphism; Subsumption; Type lattice

Indexed keywords

ENCODING (SYMBOLS); GRAPH DATABASES; GRAPHIC METHODS; INFORMATION RETRIEVAL; INTELLIGENT DATABASES; KNOWLEDGE BASED SYSTEMS; MUSCULOSKELETAL SYSTEM; OBJECT-ORIENTED DATABASES; SET THEORY; SIGNAL ENCODING;

BIT-STRINGS; CONCEPTUAL GRAPH; FRET PRODUCT; KNOWLEDGE BASE; ORDER THEORY; POSET; SKELETON PRODUCT; SUBGRAPH ISOMORPHISM; SUBSUMPTION; TYPE LATTICE;

LATTICE THEORY;

EID: 84958816676     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58328-9_19     Document Type: Conference Paper

References (24)

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.
2. Robert W. Burch. Valental aspects of Peircean Algebraic Logic. In Fritz Lehmann, editor, Semantic Networks in Artificial Intelligence. Pergamon Press, Oxford, 1992. Also appeared in Comp. and Math, with Applications, 23(2-9), 1992, p. 665-667.
3. Yves Caseau. Efficient handling of multiple inheritance hierarchies. In OOP-SLA ’93, Washington, September 1993.
4. A. G. Cohn. Completing sort hierarchies. Computers and Mathematics with Applications, 23(2-9):1-50, 1992. Also appears as Semantic Networks in Artificial Intelligence, F. Lehmann, ed., Pergamon Press, Oxford, 1992.
5. D. G. Cornell and D. G. Kirkpatrick. A theoretical analysis of various heuristics for the graph isomorphism problem. SIAM Journal of Computing, 9(2), 1980.
6. Veronica Dahl and Andrew Fall. Logical encoding of conceptual graph lattices. In Guy W. Mineau, Bernard Moulin, and John F. Sowa, editors, Proceedings of the 1st International Conference on Conceptual Structures, Quebec City, Quebec, Canada, August 4-7 1993. Universite Laval.
7. Gerard Ellis. Compiled hierarchical retrieval. In Tim Nagle, Jan Nagle, Laurie Gerholz, and Peter Eklund, editors, Conceptual Structures: Current Research and Practice, pages 285-310. Ellis Horwood, 1992.
8. Gerard Ellis. Efficient retrieval from hierarchies of objects using lattice operations. In Guy W. Mineau, Bernard Moulin, and John F. Sowa, editors, Conceptual Graphs for Knowledge Representation, number 699 in Lecture Notes in Artificial Intelligence, Berlin, 1993. Springer-Verlag. Proceedings of the 1st International Conference on Conceptual Structures, Quebec City, Canada, August 4-7.
9. John W. Esch, editor. Proceedings of the Third Annual Workshop on Conceptual Graphs, St. Paul, Minnesota, August 27 1988.
10. Leslie Ann Goldberg. Efficient Algorithms for Listing Combinatorial Structures. Cambridge University Press, Cambridge, 1993.
11. Fritz Lehmann. Semantic networks. Computers and Mathematics with Applications, 23(2-9):1-50, 1992. Also appears as Semantic Networks in Artificial Intelligence, F. Lehmann, ed., Pergamon Press, Oxford, 1992.
12. Fritz Lehmann. Combining ontological hierarchies. Technical Report 93-1, GRANDAI Software, 4282 Sandburg, Irvine, CA 92715, USA, March 1993.
13. George G. Lendaris. Representing conceptual graphs for parallel processing. In [9], 1988.
14. Robert A. Levinson. Pattern associativity and the retrieval of semantic networks. Computers and 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.
15. Marie-Laure Mugnier and Michel Chein. Characterization and algorithmic recognition of canonical conceptual graphs. In Guy W. Mineau, Bernard Moulin, and John F. Sowa, editors, Conceptual Graphs for Knowledge Representation, number 699 in Lecture Notes in Artificial Intelligence, pages 294-311, Berlin, 1993. Springer-Verlag. Proceedings of the 1st International Conference on Conceptual Structures, Quebec City, Canada, August 4-7.
16. Sung H. Myaeng and Aurelio Lopez-Lopez. A flexible algorithm for matching conceptual graphs. In [19], 1991.
17. Arthur Frederick Parker-Rhodes. Inferential Semantics. Harvester Press/ Humanities Press, Hassox, Sussex/Atlantic Highlands, N. J., 1978.
18. N.J.A. Sloane. The Handbook of Integer Sequences. Academic Press, San Diego, 1973.
19. Eileen Way, editor. Proceedings of the Sixth Annual Workshop on Conceptual Graphs, Binghamton, 1991. SUNY Binghamton.
20. Rudolf Wille. Restructuring lattice theory. In Ivan Rival, editor, Ordered Sets, Dordecht, Holland, 1982. D. Reidel. NATO ASI Series C83.
21. Rudolf Wille. Lattices in Data Analysis: How to Draw Them with a Computer. NATO ASI Series C255. Kluwer, Dordecht, 1989.
22. Rudolf Wille. Knowledge acquisition by methods of formal concept analysis. In Ernest Diday, editor, Data Analysis, Learning Symbolic and Numerical Knowledge. Nova Science Publishers, New York-Budapest, 1991.
23. Rudolf Wille. Concept lattices and conceptual knowledge systems. In Fritz Lehmann, editor, Semantic Networks in Artificial Intelligence. Pergamon Press, Oxford, 1992. Also appeared in Comp. and Math, with Applications, 23(2-9), 1992, p. 493-515.
24. Monika Zickwolff. Rule Exploration: First Order Logic in Formal Concept Analysis. PhD thesis, der Technischen Hochschule Darmstadt, 1991.