Abstract. Ontology matching is a crucial task to enable interoperation between Web applications using different but related ontologies. Today, most of the ontology matching techniques are targeted to find 1:1 mappings. However, block mappings are in fact more pervasive. In this paper, we discuss the block matching problem and suggest that both the mapping quality and the partitioning quality should be considered in block matching. We propose a novel partitioning-based approach to address the block matching issue. It considers both linguistic and structural characteristics of domain entities based on virtual documents, and uses a hierarchical bisection algorithm for partitioning. We set up two kinds of metrics to evaluate of the quality of block matching. The experimental results demonstrate that our approach is feasible. 1

Abstract. Modularization for ontologies and thus for logical theories is receiving increasing interest, but a clear presentation of requirements for solutions is still missing. This paper presents a collection of such requirements. Some of these are derived as desiderata in the context of applying modularization to the axiomatization of a top-level ontology, whereas others are determined by analyzing the notion of module in software engineering. Given these requirements, their relationship to current proposals for modularizing ontologies is briefly discussed, with a focus on our application. In a wider context, the paper represents an initial step towards a notion of module for logical languages, which is applicable to the creation and maintenance of large axiomatizations. 1