01229nas a2200145 4500008004100000245002500041210002500066260002000091300001200111520085800123100002100981700002101002700002001023856004001043 2005 eng d00aMorphisms in Context0 aMorphisms in Context aKassel, Germany a223-2373 aMorphisms constitute a general tool for modelling complex relationships between mathematical objects in a disciplined fashion. In Formal Concept Analysis (FCA), morphisms can be used for the study of structural properties of knowledge represented in formal contexts, with applications to data transformation and merging. In this paper we present a comprehensive treatment of some of the most important morphisms in FCA and their relationships, including dual bonds, scale measures, infomorphisms, and their respective relations to Galois connections. We summarize our results in a concept lattice that cumulates the relationships among the considered morphisms. The purpose of this work is to lay a foundation for applications of FCA in ontology research and similar areas, where morphisms help formalize the interplay among distributed knowledge bases.1 aKrotzsch, Markus1 aZhang, Guo-Qiang1 aHitzler, Pascal uhttp://knoesis.wright.edu/node/119901381nas a2200109 4500008004100000245006700041210006500108520101700173100002101190700002001211856004001231 2004 eng d00aA cartesian closed category of approximable concept structures0 acartesian closed category of approximable concept structures3 aInfinite contexts and their corresponding lattices are of theoretical and practical interest since they may offer connections with and insights from other mathematical structures which are normally not restricted to the finite cases. In this paper we establish a systematic connection between formal concept analysis and domain theory as a categorical equivalence, enriching the link between the two areas as outlined in [25]. Building on a new notion of approximable concept introduced by Zhang and Shen [26], this paper provides an appropriate notion of morphisms on formal contexts and shows that the resulting category is equivalent to (a) the category of complete algebraic lattices and Scott continuous functions, and (b) a category of information systems and approximable mappings. Since the latter categories are cartesian closed, we obtain a cartesian closed category of formal contexts that respects both the context structures as well as the intrinsic notion of approximable concepts at the same time.1 aZhang, Guo-Qiang1 aHitzler, Pascal uhttp://knoesis.wright.edu/node/1194