A comparison of different conceptual structures projection algorithms

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

Volumn 4604 LNAI, Issue , 2007, Pages 165-178

  Pfeiffer, Heather D ^a   Hartley, Roger T ^a  

^a NEW MEXICO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; GRAPH THEORY; INFORMATION RETRIEVAL;

GRAPH MORPHISM; KNOWLEDGE BASE; PROJECTION ALGORITHMS; REASONING OPERATIONS;

KNOWLEDGE REPRESENTATION;

EID: 37249021525     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73681-3_13     Document Type: Conference Paper

References (25)

1. Lehmann, F. (ed.): Semantics Networks. Pergamon Press, Oxford, England (1992)
2. Schubert, L.: Extending the expressive power of semantic networks. Artifical Intelligence 7, 163-198 (1976)
3. Peirce, C.: Manuscripts on existential graphs. Peirce 4, 320-410 (1960)
4. Sowa, J.: Conceptual Structures: Information Processing in Mind and Machine. Addison-Wesley, Reading, MA (1984)
5. Sowa, J.: Knowledge Representation: Logical, Philosophical, and Computational Foundations. Brooks/Cole (2000)
6. Chein, M., Mugnier, M.L.: Conceptual graphs: Fundamental notions. Revue d'Intelligence Artificielle 6(4), 365-406 (1992)
7. Baget, J.F., Mugnier, M.L.: Extensions of simple conceptual graphs: the complexity of rules and constraints. Journal of Artificial Intelligence Research (JAIR) 16, 425-465 (2002)
8. Croitoru, M., Compatangelo, E.: On conceptual graph projection. Technical Report AUCS/TR0403, University of Aberdeen, UK, Department of Computing Science (2004)
9. Corbett, D.: Reasoning and Unification over Conceptual Graphs. Kluwer Academic/Plenum Plublishers, New York (2003)
10. Paterson, M., Wegman, M.: Linear unification. J. Comput. Syst. Sci. 16, 158-167 (1978)
11. Mugnier, M.L., Chein, M.: Polynomial algorithms for projection and matching. In: Pfeiffer, H.D., Nagle, T.E. (eds.) Conceptual Structures: Theory and Implementation. LNCS, vol. 754, pp. 239-251. Springer, Heidelberg (1993)
12. Messmer, B., Bunke, H.: Efficient subgraph isomorphism detection: A decomposition approach. IEEE Transactions on Knowledge and Data Engineering 12, 307-323 (2000)
13. Ullman, J.: An algorithm for subgraph isomorphism. J. of the Assoc, for Computing Machinery 23(1), 31-42 (1976)
14. Harary, F.: Graph Theory. Addison-Wesley, Reading, MA (1969)
15. Willems, M.: Projection and unification for conceptual graphs. In: Ellis, G., Rich, W., Levinson, R., Sowa, J.F. (eds.) ICCS 1995. LNCS, vol. 954, pp. 278-282. Springer, Heidelberg (1995)
16. Delugach, H.: CharGer 3.3 - A Conceptual Graph Editor, University of Alabama in Huntsville, Alabama, USA (2004), http://www.cs.uah.edu/delugach/ CharGer
17. Croitoru, M., Compatangelo, E.: A combinatorial approach to conceptual graph projection checking. In: Webb, G.I., Yu, X. (eds.) AI2004. LNCS (LNAI), vol. 3339, Springer, Heidelberg (2004)
18. Southey, F., Linders, J.: NOTIO - a Java API for developing CG tools. In: Tepfenhart, W.M. (ed.) ICCS 1999. LNCS, vol. 1640, pp. 262-271. Springer, Heidelberg (1999)
19. Delugach, H.: CharGer: A graphical Conceptual Graph editor. In: Delugach, H.S., Stumme, G. (eds.) ICCS 2001. LNCS (LNAI), vol. 2120, Springer, Heidelberg (2001), http://www.cs.nmsu.edu/hdp/CGTOOLS/proceedings/index.html
20. Benn, D., Corbett, D.: pCG: An implementation of the process mechanism and an extensible CG programming language. In: Delugach, H.S., Stumme, G. (eds.) ICCS 2001. LNCS (LNAI), vol. 2120, Springer, Heidelberg (2001), http://www.cs.nmsu.edu/hdp/CGTOOLS/proceedings/index.html
21. Polovina, S., Hill, R.: Enhancing the initial requirements capture of multi-agent systems through conceptual graphs. In: Dau, F., Mugnier, M.-L., Stumme, G. (eds.) ICCS 2005. LNCS (LNAI), vol. 3596, pp. 439-452. Springer, Heidelberg (2005)
22. Southey, F.: Notio and Ossa. In: Delugach, H.S., Stumme, G. (eds.) ICCS 2001. LNCS (LNAI), vol. 2120, Springer, Heidelberg (2001), http://www.cs.nmsu. edu/hdp/CGTOOLS/proceedings/index.html
23. Kabbaj, A., Moulin, B.: An algorithmic definition of eg operations based on a bootstrap step. In: Delugach, H.S., Stumme, G. (eds.) ICCS 2001. LNCS (LNAI), vol. 2120, Springer, Heidelberg (2001)
24. Pfeiffer, H.D.: The Effect of Data Structures Modifications On Algorithms for Reasoning Operations, PhD thesis, New Mexico State University, Las Cruces, NM (2007)
25. Mugnier, M.L., Leclere, M.: On querying simple conceptual graphs with negation. In: Data and Knowledge Engineering, DKE, Elsevier, Revised version of R.R. LIRMM 05-051 (2006)