The workshop focuses on the three areas of interest to CIKM to discuss how to envisage and design evaluation infrastructures able to store, manage, and make accessible the scientific data and knowledge of interest for advancing the evaluation of information retrieval and access tools.

According to recent research, the task of Information Retrieval (IR) can successfully be described as the extraction, from a given document base, of those documents d that, given a query q, make the formula d -> q valid, where d and q are formulae of the chosen logic and ``->'' denotes the brand of logical implication formalized by the logic in question. In this paper, although essentially subscribing to this view, we propose that the logic to be chosen for this endeavour be a Terminological Logic (TL): according to this view the IR task becomes that of singling out those documents d such that q subs d, where d and q are terms} of the chosen TL and ``subs'' denotes subsumption between terms. We argue that TLs are particularly suitable for modelling IR; we do this by showing that they can successfully be employed in representing documents under a variety of aspects (e.g. structural, layout, content), in representing queries and in representing domain and lexical knowledge. The fact that a single logical language can be used for all these representational endeavours ensures that all these sources of knowledge will participate in the retrieval process in a principled way. In this paper we introduce MIRTL, a TL for modelling IR according to the above guidelines; its syntax, formal semantics and inferential algorithm are described.

Data fragmentation is an important aspect of distributed database design, in which portions of relations, tailored to the specific needs of local applications, are defined to be further allocated to the sites of the computer network supporting the database system. In this paper we present a theory of fragmentation with overlapping fragments to study the complexity of the problems involved in checking the completeness of a fragmentation schema and in querying and updating a fragmented relation. We analyze these problems from the complexity viewpoint and present sound and complete algorithms for their solution.