This paper presents outlines to express the matchmg between complex objects, using works done in the Information Retrieval field.The basic idea is to help an application programmer to describe theorcticatly the matching using modal logic, and then to express the operational matching.We describe here these two parts using a medical information retrieval example.We are implementing our work on the 02 system [1].

This panel will employ two different interpretations of the phrase “growing up” to address areas of common interest between hypertext and information retrieval researchers. First, the panelists will question whether or not hypertext is “growing up” as a scientific discipline; They will discuss characteristics that separate hypertext research from other related disciplines. Second, the panelists will discuss the problems encountered when a hypertext system “grows up” in size and complexity; They will discuss the very real problems expected when representing and integrating large knowledge bases, accommodating multiple users, and distributing single logical hypertexts across multiple physical sites.

We attempt in this paper to outline a method for the automatic construction of a knowledge base. We propose some methods and a domain knowledge model. A new idea is to conceive a system that is able to each phase of its construction to acquire domain knowledge from all new information that it is building, in particular the indexing terms; the last section is an attempt in this sense.

IOTA is a prototype of an Information Retrieval System which can manage a corpus made of highly structured, full text documents. The first version presented here has intelligent capabilities related to heuristic pattern matching procedures for processing natural language queries, which involve an automatically built thesaurus. The paper emphazises the overall principles of query processing and gives hints about the underlying techniques used while constructing the thesaurus and automatically indexing highly structured documents.