In multi-relational data mining (MRDM), there have been proposed many methods for searching for patterns that involve multiple tables (relations) from a relational database. In this paper, we consider closed pattern mining from distributed multi-relational databases (MRDBs). Since the computation of MRDM is costly compared with the conventional itemset mining, we propose some efficient methods for computing closed patterns using the techniques studied in Inductive Logic Programming (ILP) and Formal Concept Analysis (FCA). Given a set of local databases, we first compute sets of their closed patterns (concepts) using a closed pattern mining algorithm tailored to MRDM, and then generate the set of closed patterns in the global database by utilizing the merge operator. We also present some experimental results, which shows the effectiveness of the proposed methods.