@inproceedings{Yang:1993,
  added-at = {2007-12-14T02:48:28.000+0100},
  author = {Yang, Gi-Chui and Oh, Jonathan},
  biburl = {http://www.bibsonomy.org/bibtex/2b07f65452b813353bd8d6cbe816ecdd5/diego_ma},
  booktitle = {Proceedings of the 1993 ACM/SIGAPP symposium on Applied computing: states of the art and practice},
  interhash = {155ffa196531c0a1bd6f7be976430e8f},
  intrahash = {b07f65452b813353bd8d6cbe816ecdd5},
  keywords = {conceptual_graphs},
  pages = {476-481},
  publisher = {ACM Press},
  timestamp = {2007-12-14T02:48:28.000+0100},
  title = {Knowledge Acquisition and Retrieval Based on Conceptual Graphs},
  url = {http://portal.acm.org/citation.cfm?id=165207},
  year = 1993
}

@inproceedings{Sowa:1979,
  added-at = {2007-12-14T02:46:48.000+0100},
  author = {Sowa, John F.},
  biburl = {http://www.bibsonomy.org/bibtex/251f6e367c2fa940d90d0dc7ddafe40e7/diego_ma},
  booktitle = {Proc. ACL 1979},
  interhash = {a584986baa7968008a347e17569002da},
  intrahash = {51f6e367c2fa940d90d0dc7ddafe40e7},
  keywords = {conceptual_graphs},
  pages = {39-44},
  timestamp = {2007-12-14T02:46:48.000+0100},
  title = {Semantics of Conceptual Graphs},
  url = {http://portal.acm.org/citation.cfm?id=982175},
  year = 1979
}

@incollection{Nicolas:2003,
  abstract = {The web faces a major contradiction: it has been created to present information to human beings but the increase of available information sources on the web makes it more difficult for people to find the most relevant documents when browsing through numerous pages of URLs returned by search engines. Classic indexing and retrieval techniques have an important limitation: the retrieved documents do not necessarily match the meaning of the user?s query. In order to address this issue, we designed a system capable of matching conceptual structures extracted from both the user?s query and documents retrieved by a classic search engine like Google. This article presents our fully functional application and provides details about its behavior. The application provides a new framework for broader experiments in the manipulation of conceptual structures extracted from natural language documents and is built upon research and tools developped by the CG community.},
  added-at = {2007-12-14T02:44:28.000+0100},
  address = {Berlin Heidelberg},
  author = {Nicolas, St{\'e}phane and Moulin, Bernard and Milenau, Guy W.},
  biburl = {http://www.bibsonomy.org/bibtex/21ed283fd0d493cc689c4c0119f5bd6f4/diego_ma},
  booktitle = {Conceptual Structures for Knowledge Creation and Communication (Proceedings ICCS 2003)},
  editor = {de Moor, A. and Lex, W. and Ganter, B.},
  interhash = {a4784b1d50ff9d5ea1127c16020069c0},
  intrahash = {1ed283fd0d493cc689c4c0119f5bd6f4},
  keywords = {inf_retrieval conceptual_graphs},
  pages = {362-377},
  publisher = {Springer-Verlag},
  series = {LNAI},
  timestamp = {2007-12-14T02:44:28.000+0100},
  title = {Sesei: A {CG}-Based Filter for Internet Search Engines},
  url = {http://www.citeulike.org/user/dmolla/article/87992},
  volume = 2746,
  year = 2003
}

@mastersthesis{Mishne:2003,
  abstract = {The sharp increase in the amount of easily accessible information in the last decade resulted in a growing amount of research regarding information extraction and retrieval. Inside the general information retrieval framework, specialized methods emerged for specific domains, trying to exploit features of the information in these domains to improve its accessibility. Source code ? documents written in a computer programming language ? is one of these domains. Source code is a form of structured data, data in which information is stored both in the structure and in the content; it is, however, different from other structured document domains both in the nature of the structure and the nature of the content. Retrieval of information from source code is crucial for large-scale software development and maintenance, and is recognized as a problem both by software developers and information retrieval researchers; it is a vast research area with multiple interests and various sub-tasks. This thesis focuses on one aspect of these: the usage of the structure of the code to improve the retrieval. Our approach for improving the retrieval from source code uses conceptual modeling of the code. We employ conceptual graphs ? a knowledge representation formalism ? to design a retrieval model for code that uses both its structure and its content. The model contains a formal definition of the problem, a method for representing the code as conceptual graphs, and procedures for ranking their similarity to a query. We evaluate our model and show that for the code retrieval task it performs better than standard information retrieval approaches. The associated complexity implications are analyzed and discussed, searching for a balance of computational costs and retrieval performance. Our main conclusion is that using the structure for retrieval of code improves retrieval results substantially, and further work in this direction can improve the results even more.},
  added-at = {2007-12-14T02:43:28.000+0100},
  author = {Mishne, Gilad},
  biburl = {http://www.bibsonomy.org/bibtex/2e729e2c218776ddf3df76191a0dcb33e/diego_ma},
  interhash = {5cd87c8b69dc63a88f8d342d786c447b},
  intrahash = {e729e2c218776ddf3df76191a0dcb33e},
  keywords = {conceptual_graphs inf_retrieval},
  school = {University of Amsterdam},
  timestamp = {2007-12-14T02:43:28.000+0100},
  title = {Source Code Retrieval Using Conceptual Graphs},
  url = {http://www.illc.uva.nl/Publications/reportlist.php?Series=MoL},
  year = 2004
}

@techreport{Kabbaj:2005,
  added-at = {2007-12-14T02:41:14.000+0100},
  author = {Kabbaj, Adil},
  biburl = {http://www.bibsonomy.org/bibtex/217566a6d0f88a57139a3e9c6008f0149/diego_ma},
  institution = {SourceForge},
  interhash = {9197d2ea93544f0abb88a0e446b6c0aa},
  intrahash = {17566a6d0f88a57139a3e9c6008f0149},
  keywords = {conceptual_graphs},
  timestamp = {2007-12-14T02:41:14.000+0100},
  title = {Concept, Conceptual Relation, and Conceptual Graph ({CG})},
  url = {http://sourceforge.net/projects/amine-platform/},
  year = 2005
}

@article{Fargues:1986,
  added-at = {2007-12-14T02:38:39.000+0100},
  author = {Fargues, Jean and Landau, Marie-Claude and Dugourd, Anne and Catach, Laurent},
  biburl = {http://www.bibsonomy.org/bibtex/2b957ecbf85dc7bac9c9fa6ec238ef710/diego_ma},
  interhash = {74f7f4e342bb4fe46f65952c9f2deb7b},
  intrahash = {b957ecbf85dc7bac9c9fa6ec238ef710},
  journal = {IBM Journal of Research Development},
  keywords = {conceptual_graphs},
  number = 1,
  pages = {70-79},
  timestamp = {2007-12-14T02:38:39.000+0100},
  title = {Conceptual Graphs for Semantics and Knowledge Processing},
  url = {http://domino.research.ibm.com/tchjr/journalindex.nsf/0/d4dd960931c0248d85256bfa0067f64d?OpenDocument},
  volume = 30,
  year = 1986
}

@article{Delugach:1994,
  abstract = {This paper describes an approach to database inference analysis based on conceptual graphs. The database inference problem is briefly described. Previous approaches are summarized, followed by a presentation of our inference model, called AERIE. The notions of an inference target class and an inference method class are introduced with examples given. Conceptual graphs are introduced as our means of representing database inference knowledge, as a first step toward analyzing and detecting database inference problems. The classification of inference target classes and the use of conceptual graphs for database inference detection are two important contributions of this paper. Four examples are used to illustrate the approach. We discuss some interesting issues raised by this work, and offer conclusions and our plans for future research.},
  added-at = {2007-12-14T02:38:12.000+0100},
  author = {Delugach, Harry S. and Hinke, Thomas H.},
  biburl = {http://www.bibsonomy.org/bibtex/20642a2f1b49bac1a0462998f8408bd8d/diego_ma},
  interhash = {0fc9921be5eac78ce8cc9db07d52277f},
  intrahash = {0642a2f1b49bac1a0462998f8408bd8d},
  journal = {Jour. Computing and Info. Tech.},
  keywords = {conceptual_graphs},
  number = 4,
  pages = {291-307},
  timestamp = {2007-12-14T02:38:12.000+0100},
  title = {Using Conceptual Graphs to Represent Database Inference Security Analysis},
  url = {http://www.cs.uah.edu/~delugach/publications.html},
  volume = 4,
  year = 1994
}

@inproceedings{Clark:1997,
  abstract = {Conceptual Graphs (CGs) are a natural and intuitive notation for expressing first-order logic statements. However, the task of performing inferences with a large-scale CG knowledge base remains largely unexplored [...] in this paper we show how a method used elsewhere for achieving tractability --- namely the use of \emph{access paths} --- can be applied to conceptual graphs [...]},
  added-at = {2007-12-14T02:37:28.000+0100},
  address = {Berlin},
  author = {Clark, Peter and Porter, Bruce},
  biburl = {http://www.bibsonomy.org/bibtex/263f8c49966d6846c6f01dd934634ae72/diego_ma},
  booktitle = {Proc. ICCS'97},
  editor = {D.Lukose and Delugach, H. and Keeler, M. and Searle, L. and J.Sowa},
  interhash = {04012cedefcd3021c1d61a29b1876637},
  intrahash = {63f8c49966d6846c6f01dd934634ae72},
  keywords = {inference conceptual_graphs},
  pages = {521-535},
  publisher = {Springer},
  series = {Lecture Notes in AI},
  timestamp = {2007-12-14T02:37:28.000+0100},
  title = {Using Access Paths to Guide Inference with Conceptual Graphs},
  url = {http://www.cs.utexas.edu/users/pclark/papers},
  volume = 1257,
  year = 1997
}

@article{Antonacci:1992,
  added-at = {2007-12-14T02:35:32.000+0100},
  author = {Antonacci, Francesco and Calamani, Cecilia M.},
  biburl = {http://www.bibsonomy.org/bibtex/26d596efc3c6ca2c403eaf04d12aa7282/diego_ma},
  interhash = {547ac25ce46933896f49306f0bd4db4e},
  intrahash = {6d596efc3c6ca2c403eaf04d12aa7282},
  journal = {IBM Journal of Research and Development},
  keywords = {conceptual_graphs inference},
  number = 3,
  pages = {333-345},
  timestamp = {2007-12-14T02:35:32.000+0100},
  title = {Capturing the Deep Meaning of Texts through Deduction and Inference},
  url = {http://www.research.ibm.com/journal/rd/376/ibmrd3706vv36-37.pdf},
  volume = 36,
  year = 1992
}

@inproceedings{Agrawal:1994,
  abstract = {We consider the problem of discovering association rules between items in a large database of sales transactions. We present two new algorithms for solving this problem that are fundamentally different from the known algorithms. Experiments with synthetic as well as real-life data show that these algorithms outperform the known algorithms by factors ranging from three for small problems to more than an order of magnitude for large problems. We also show how the best features of the two proposed ...},
  added-at = {2007-12-14T02:35:11.000+0100},
  author = {Agrawal, Rakesh and Srikant, Ramakrishnan},
  biburl = {http://www.bibsonomy.org/bibtex/224d24f79aeaefa77af9a1833e8eb7428/diego_ma},
  booktitle = {Proc. 20th Int. Conf. Very Large Data Bases, VLDB},
  interhash = {385fb6f60e7dc2ef5b2c634eb6fec067},
  intrahash = {24d24f79aeaefa77af9a1833e8eb7428},
  keywords = {conceptual_graphs},
  timestamp = {2007-12-14T02:35:11.000+0100},
  title = {Fast Algorithms for Mining Association Rules},
  year = 1994
}