<XML><RECORDS><RECORD><REFERENCE_TYPE>31</REFERENCE_TYPE><REFNUM>5522</REFNUM><AUTHORS><AUTHOR>Ounis,I.</AUTHOR></AUTHORS><YEAR>1998</YEAR><TITLE>Un modèle d'indexation relationnel pour les graphes conceptuels fondé sur une interprétation logique</TITLE><PLACE_PUBLISHED> </PLACE_PUBLISHED><PUBLISHER>University Joseph Fourier</PUBLISHER><LABEL>Ounis:1998:5522</LABEL><KEYWORDS><KEYWORD>information retrieval; relational indexing; conceptual graphs; logic;non-monotonic reasoning</KEYWORD></KEYWORDS<ABSTRACT> The idea of establishing relations between objects and representing them in the knowledge base of an information system is a feature of all approaches in Artificial Intelligence. However, the majority of knowledge representation formalisms do not fully exploit the semantic richness of these relations and their associated behavior. In information retrieval, the processing of these relations is not at all better performed and the impact of their taking into account at the time of the matching phase has never been established though it is true that many approaches take into account their presence in the document and tend to represent them as part of the indexing process. Nevertheless, retrieval of structured and complex documents makes it necessary, more than ever, to use the relation semantics and properties, next to a solid and expressive indexation language. By use of a study of the new demands to which information retrieval has to answer nowadays, we propose a relational indexing model for documents. The approach consists of considering that an indexing term is based on complex concepts where semantic connectors are considered to be operators, or relations that allow to build new expressions representing new concepts or situations. The proposed model is not limited to relation representation, but also offers a general framework that mentions the general principle for the handling of these relations and the taking into account of their properties in a retrieval process based on a logical approach. The model proposed here is made up of two components: the representation language allowing for a relational indexing approach, and inference rules that make it possible to direct the correspondence process by use of the language. We use the situation theory as representation language and a relevance derivation system which is based on the axiomatisation of the notion of correspondence between documents and the query to take into account the relations. An interesting feature of this model is that it leads to extension </ABSTRACT><NOTES>PhD Dissertation (in French)</NOTES><URL>ftp://ftp.imag.fr/pub/Mediatheque.IMAG/theses/1998/Ounis.Iadh/these.dir/these.pdf</URL></RECORD></RECORDS></XML>