<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Looking for bonds between nonhomogeneous formal contexts</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ondrej Kr dlo</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Lubomir Antoni</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Stanislav Krajci</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Pavol Jozef Safarik</institution>
          ,
          <addr-line>Kosice</addr-line>
          ,
          <country country="SK">Slovakia</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Recently, the concept lattices working with the heterogeneous structures have been fruitfully applied in a fuzzy formal concept analysis. We present a situation under nonhomogeneous formal contexts and explore the bonds in a such nonhomogeneous case. This issue requires to formulate the alternative de nition of a bond and to investigate the relationships between bonds and the particular formal contexts.</p>
      </abstract>
      <kwd-group>
        <kwd>bond</kwd>
        <kwd>heterogeneous formal context</kwd>
        <kwd>second order formal context</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Formal concept analysis (FCA) [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] as an applied lattice theory allows us to
explore the meaningful groupings of objects with respect to common attributes.
In general, FCA is an interesting research area that provides theoretical
foundations, fruitful methods, algorithms and underlying applications in many areas
and has been investigated in relation to various disciplines and integrated
approaches [
        <xref ref-type="bibr" rid="ref13 ref15">13, 15</xref>
        ]. The feasible attempts and generalizations are investigated, one
can see dual multi-adjoint concept lattices working with adjoint triples [27{29],
interval-valued L-fuzzy concept lattices [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], heterogeneous concept lattices [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ],
connectional concept lattices [
        <xref ref-type="bibr" rid="ref12 ref32 ref33">12, 32, 33</xref>
        ]. Classical bonds and their
generalizations acting on residuated lattices were analyzed from a broader perspective
in [
        <xref ref-type="bibr" rid="ref17 ref21 ref24">17, 21, 24</xref>
        ].
      </p>
      <p>In this paper, we deal with an alternative notion of the bonds and with a
problem of looking for bonds in a nonhomogeneous formal contexts. In particular,
Section 2 recalls the basic notions of a concept lattice, notion of a bond, its
equivalent de nition and preliminaries of a second order formal context and a
heterogeneous formal context. Section 3 describes the idea of a looking for bonds
in a nonhomogeneous case. Sections 4 and 5 provide the solution of this issue in
terms of a second order formal context and heterogeneous formal context.</p>
    </sec>
    <sec id="sec-2">
      <title>Preliminaries</title>
      <p>De nition 1. Let B and A be the nonempty sets, R B A be an arbitrary
binary relation. Triple hB; A; Ri is said to be a formal context with a set of
objects B and a set of their attributes A. Relationships between objects and their
attributes are saved in the relation R. Let us de ne a pair of derivation operators
("; #) as the mappings between powersets of B and A such that
{ ": P(B) ! P(A) and #: P(A) ! P(B) where for any X
{ " (X) = fa 2 Aj(8b 2 X)(b; a) 2 Rg
{ # (Y ) = fb 2 Bj(8a 2 Y )(b; a) 2 Rg.</p>
      <p>B and Y</p>
      <p>A is
Such derivation operators can be de ned as the mappings between 2-sets
(borrowed from fuzzy generalization of FCA that is sometimes easier to use)
{ ": 2B ! 2A and #: 2A ! 2B where for any X 2 2B and Y 2 2A
{ " (X)(a) = Vb2B((b 2 X) ) ((b; a) 2 R)) = V
{ # (Y )(b) = Va2A((a 2 Y ) ) ((b; a) 2 R)) = Vab22AB((YX((ab)) )) RR((bb;;aa)))).</p>
      <p>Pair of such derivation operators forms an antitone Galois connection
between complete lattices of all subsets of B and A. Hence, the compositions of
the mappings form closure operators on such complete lattices.</p>
      <p>De nition 2. Let C = hB; A; Ri be a formal context. Any pair of sets (X; Y ) 2
2B 2A is said to be a formal concept i X =# (Y ) and Y =" (X). Object
part of any concept is called extent and attribute part is called intent. Set of
all extents of formal context C will be denoted by Ext(C). The notation Int(C)
stands for the set of all intents of C.</p>
      <p>All concepts ordered by set inclusion of extents (or equivalently by dual of
intent inclusion) form a complete lattice structure.
2.1</p>
      <p>Notion of bond and its equivalent de nition
De nition 3. Let Ci = hBi; Ai; Rii for i 2 f1; 2g be two formal contexts.
Relation B1 A2 is said to be a bond i any row of the table is an intent of C2
and any of its column is an extent of C1. Set of all bonds between C1 and C2 will
be denoted by 2-Bonds(C1; C2).</p>
      <p>Lemma 1. Let Ci = hBi; Ai; Rii for i 2 f1; 2g be two formal contexts. Then</p>
      <p>B1 A2 is a bond between C1 and C2 if and only if Ext(hB1; A2; i) Ext(C1)
and Int(hB1; A2; i) Int(C2).</p>
      <p>Proof. ): Let X 2 Ext(hB1; A2; i) be an arbitrary extent of any bond between
formal contexts C1 and C2. Derivation operators of Ci will be denoted by ("i; #i)
for i 2 f1; 2g. Derivation operators of the bond will be denoted by (" ; # ). Then
there exists a set of attributes Y A2 such that
# (Y )(b1) =
^ (Y (a2) )</p>
      <p>(b1; a2))
a22A2
( ; a2) is an extent of Ext(C1) hence there exists Z
A1
=</p>
      <p>^ (Y (a2) )#1 (Z)(b1))
a22A2
= ^</p>
      <p>a22A2
= ^</p>
      <p>a22A2 a12A1
= ^</p>
      <p>a22A2 a12A1
= ^ _
a12A1 a22A2</p>
      <p>^
a12A1
Y (a2) )</p>
      <p>Z(a1) ) R1(b1; a1)
^ (Y (a2) ) (Z(a1) ) R1(b1; a1)))
^ ((Y (a2) ^ Z(a1)) ) R1(b1; a1))</p>
      <p>Y (a2) ^ Z(a1) ) R1(b1; a1)
=</p>
      <p>^ (ZY (a1) ) R1(b1; a1))
a12A1
=#1 (ZY )(b1) where ZY (a1) = Wa22A2 (Y (a2) ^ Z(a1))
Hence, Ext(hB1; A2; i) Ext(C1). Similarly for intents.</p>
      <p>(: Assume a formal context hB1; A2; i such that it holds Ext(hB1; A2; i)
Ext(C1) and Int(hB1; A2; i) Int(C2). From the simple fact that any row of any
context is its intent and any column is its extent and from the previous inclusions,
we obtain that is a bond between C1 and C2. tu</p>
      <p>Hence, the notion of bond can be de ned equivalently as follows.
De nition 4. Let Ci = hBi; Ai; Rii for i 2 f1; 2g be two formal contexts. Formal
context B = hB1; A2; i is said to be a bond between C1 and C2 if Ext(B)
Ext(C1) and Int(B) Int(C2).</p>
      <p>More about the equivalent de nition of bond could be found in [17{19].
2.2</p>
      <p>
        Direct product of two formal contexts and bonds
Let us recall the de nition and important property of direct product of two
formal contexts. More details about such topic can be found in [
        <xref ref-type="bibr" rid="ref21 ref26">21, 26</xref>
        ].
De nition 5. Let Ci = hBi; Ai; Rii be two formal contexts. Formal context
C1 C2 = hB1 A2; B2 A1; R1 R2i where
(R1 R2)((b1; a2); (b2; a1)) = R1(b1; a1) _ R2(b2; a2)
= :R1(b1; a1) ) R2(b2; a2)
= :R2(b2; a2) ) R1(b1; a1)
for any (bi; ai) 2 Bi Ai for all i 2 f1; 2g is said to be a direct product of
formal contexts C1 and C2.
      </p>
      <p>Lemma 2. Let Ci = hBi; Ai; Rii be two formal contexts. Every extent of C1 C2
is a bond between C1 and C2.
2.3</p>
      <sec id="sec-2-1">
        <title>Second order formal contexts</title>
        <p>
          In this subsection, we remind a notion of a second order formal concept [
          <xref ref-type="bibr" rid="ref24">24</xref>
          ].
De nition 6. Consider two non-empty index sets I and J and a formal context
h i2I Bi; Sj2J Aj; ri, whereby
S
{ Bi1 \ Bi2 = ; for any i1; i2 2 I, i1 6= i2,
{ Aj1 \ Aj2 = ; for any j1; j2 2 J , j1 6= j2,
{ r : Si2I Bi Sj2J Aj ! 2.
        </p>
        <p>Moreover, consider two non-empty sets of 2-contexts notated
{ fCi = hBi; Ti; pii : i 2 Ig
{ fDj = hOj; Aj; qji : j 2 J g.</p>
        <p>Formal context of second order is a tuple</p>
        <p>D [ Bi; fCi; i 2 Ig; [ Aj; fDj; j 2 J g;
i2I j2J
[
(i;j)2I J</p>
        <p>E
ri;j ,
where ri;j : Bi Aj ! 2 de ned as ri;j(b; a) = r(b; a) for any b 2 Bi and a 2 Aj.</p>
        <p>In what follows, consider the below described notation. Let us have an L-set
f : X ! 2 for a non-empty universe set X = Si2I Xi, where Xi1 \ Xi2 = ;
for any i1; i2 2 I. Then f i : Xi ! 2 is de ned as f i(x) = f (x) for an arbitrary
x 2 Xi and i 2 I.</p>
        <p>We de ne the mappings between direct products of two sets of concept
lattices (that correspond to the two sets of 2-contexts given above) in the following
form:
De nition 7. Let us de ne the mappings h*; +i as follows
*: Y Ext(Ci) !
i2I</p>
        <p>Y Int(Dj) and +: Y Int(Dj) ! Y Ext(Ci)
j2J j2J i2I
* ( )j = ^ "ij ( i), for any</p>
        <p>2 Y Ext(Ci)
+ ( )i = ^ #ij ( j), for any</p>
        <p>2 Y Int(Dj)
i2I
j2J
i2I
j2J
such that ("ij; #ij) is a pair of derivation operators de ned on hBi; Aj; iji where
ij = ^f 2 2-Bonds(Ci; Dj) : (8(bi; aj) 2 Bi
Aj) (bi; aj)
rij(bi; aj)g.
2.4</p>
      </sec>
      <sec id="sec-2-2">
        <title>Heterogeneous formal contexts</title>
        <p>
          A heterogeneous extension in FCA based on the totally diversi cation of objects,
attributes and table elds has been introduced in [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]. In the following, we remind
the de nition of a heterogeneous formal context and its derivation operators.
De nition 8. Heterogeneous formal context is a tuple C = hB; A; P; R; U ; V; i,
where
{ B and A are non-empty sets,
{ P = fhPb;a; Pb;a i : (b; a) 2 B Ag is a system of posets,
{ R is a mapping from B A such that R(b; a) 2 Pb;a for any b 2 B and
a 2 A,
{ U = fhUb; Ub i : b 2 Bg and V = fhVa; Va i : a 2 Ag are systems of
complete latices,
{ = f b;a : (b; a) 2 B Ag is a system of isotone and left-continuous
mappings b;a : Ub Va
        </p>
        <p>! Pb;a.</p>
        <p>Let us de ne the derivation operators of a heterogeneous formal context as a
pair of mappings (%; .), whereby %: Qb2B Ub ! Qa2A Va and .: Qa2A Va !
Qb2B Ub such that
{ . (f )(a) = Wfv 2 Vajf (b) b;a v
{ % (g)(b) = Wfu 2 Ubju b;a g(a)</p>
        <p>R(b; a)g for any f 2 Qb2B Ub</p>
        <p>R(b; a)g for any g 2 Qa2A Va.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Problem description and sketch of solution</title>
      <p>
        In this section we discussed why we have proposed an equivalent de nition of
bond. First, consider the classical de nition of bond. It is a binary relation (table)
between objects and attributes from di erent contexts such that its rows are
intents and columns are extents of di erent input contexts. The issue of looking
for bonds in a classical or homogeneous fuzzy case can be solved successfully
[
        <xref ref-type="bibr" rid="ref17 ref21">17, 21</xref>
        ].
      </p>
      <p>The solution of this issue requires the alternative de nition of a bond. Hence,
new de nition of a bond focuses not only on a relation with some special
properties, but also on a bond as a formal context, whereby its concept lattice is
connected to concept lattices of input contexts in some sense. As a consequence,
a generalization for heterogeneous bonds is possible. One can nd the methods
in e ort to equivalently modify the input heterogeneous formal contexts and to
extract bonds as the extents of a direct product.</p>
      <p>The proposed modi cation runs as follows. Each individual pair that includes
a "conjunction" b;a and a value of the poset Pb;a is replaced by a bond from
2-Bonds(hUb; Ub; i; hVa; Va; i). This completely covers the Galois connection
between the complete lattices of any object{attribute pair from B A.</p>
      <p>At the beginning, we will show how this modi cation looks in terms of
second order formal contexts. Then we de ne new modi ed heterogeneous formal
context such that its concept lattice is identical to the original.</p>
    </sec>
    <sec id="sec-4">
      <title>Second order form of scaled heterogeneous formal context</title>
      <p>In e ort to formalize the second order form of scaled heterogeneous formal
context and its derivation operators, the de nition of the following mappings is
required:
De nition 9. Let (L; ) be a complete lattice. Let us de ne mappings ( )L and
( )L where
{ ( )L : L ! 2L such that kL(m) = (m k) for any k; m 2 L
{ ( )L : 2L ! L such that XL = W X for any X L.</p>
      <p>Let us have an arbitrary f 2 Qb2B Ub. Let us denote f as a subset of Sb2B Ub
de ned as f = Sb2Bfu 2 Ubju f (b)g. Similarly for any g 2 Qa2A Va.</p>
      <p>
        More information about Cartesian representation of fuzzy sets could be found
in [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
      </p>
      <p>Now, consider a heterogeneous formal context C = hB; A; P; R; U ; V; i. A
second order form of scaled heterogeneous formal context is de ned as
C =
*
[ Ub; fhUb; Ub; ijb 2 Bg; [ Va; fhVa; Va; ija 2 Ag; R
b2B a2A
+
whereby all external contexts are classical crisp contexts and R is a classical crisp
binary relation de ned as R(u; v) = ((u b;a v) R(b; a)) for any (u; v) 2 Ub Va
and any (b; a) 2 B A.</p>
      <p>In the following, we de ne the derivation operators of such special second
order formal context. First, we state some appropriate remarks and facts. Note
that a relation R constrained to Ub Va for any pair (b; a) 2 B A is monotone
in both arguments due to its de nition. Similarly, consider the fact that any
extent of hUb; Ub; i and any intent of hVa; Va; i is a principal down-set of
a corresponding complete lattice (i.e. there exists an element in this complete
lattice such that all lower or equal elements are in the extent or in the intent).
Hence, a relation R constrained to Ub Va for some (b; a) 2 B A is a 2-bond
between hUb; Ub; i and hVa; Va; i which will be denoted by b;a. Note that any
2 Qb2B Ext(hUb; Ub; i) has the form f for some f 2 Qb2B Ub. Consider an
arbitrary f 2 Qb2B Ub and g 2 Qa2A Va. Hence, the derivation operators are
de ned as follows:
{ %(f )(v) = Vb2B "b;a (f (b)b)(v) for any v 2 Va and a 2 A
{ .(g)(u) = Va2A #b;a (g(a)a)(u) for any u 2 Ub and b 2 B.</p>
      <p>In a previous de nition, the pair of mappings ("b;a; #b;a) are derivation
operators of a formal context hUb; Va; b;ai for any (b; a) 2 B A. For the sake of
brevity, we use the shortened notation ( )b instead of ( )Ub and similarly ( )a
instead of ( )Va .</p>
      <p>Lemma 3. The concept lattices of C and C are isomorphic.</p>
      <p>Proof. Consider an arbitrary f 2 Qb2B Ub. We will show that %(f ) = % (f ).</p>
      <p>Firstly consider the fact of left-continuity of both arguments of b;a for any
(b; a) 2 B A. Due to this property, one can de ne two residuums in the following
way. Let (b; a) 2 B A be an arbitrary object-attribute pair and consider the
arbitrary values u 2 Ub, v 2 Va and p 2 Pb;a. Then de ne
{ !b;a: Ub
{ !a;b: Va</p>
      <p>Pb;a ! Va, such that u !b;a p = Wfv 2 Vaju b;a v
Pb;a ! Ub, such that v !a;b p = Wfu 2 Ubju b;a v
pg
pg.
% f (v) = ^ "b;a f (b)
b</p>
      <p>(v)
b2B
= ^ ^</p>
      <p>b2B u2Ub
= ^</p>
      <p>^ ((u
b2B u2Ub
0
= (v</p>
      <p>f (b) !b;a R(b; a))
^ (f (b) !b;a R(b; a))
b2B</p>
      <p>!
^ _fw 2 Vaj(f (b) b;a w
b2B
_fw 2 Vaj(8b 2 B)(f (b) b;a w</p>
      <p>a
% (f )(a)) = % (f )(a) (v):
!
R(b; a))g</p>
      <p>R(b; a))g
b
Analogously one can obtain . (g) (u) = . (g)(b) (u).
4.1</p>
      <p>Back to heterogeneous formal contexts
Now, we look at heterogeneous formal context introduced in Subsection 2.3. A
second order formal context C can be seen as a special heterogeneous formal
context Cb, whereby the family of posets fhPb;a; ij(b; a) 2 B Ag is replaced by
tu
a set of 2-bonds f b;a 2 2-Bonds(hUb; Ub; i; hVa; Va; i)j(b; a) 2 B
the nal form of such heterogeneous formal context is
Ag. Hence,</p>
      <p>D
Cb = B; A; ; Rb; U ; V; f b;aj(b; a) 2 B
AgE
where
{ = f b;a 2 2-Bonds(hUb; Ub; i; hVa; Va; i)j(b; a) 2 B
{ b;a(u; v) = (u b;a v R(b; a))
Ag
{ Rb(b; a) = b;a 2 2-Bonds(hUb; Ub; i; hVa; Va; i) for any (b; a) 2 B
{ b;a : Ub Va ! 2Ub Va de ned as a Cartesian product u v = u
A
v.</p>
      <p>The derivation operators of Cb are de ned as
{ " (f )(a) = Wfv 2 Vaj(8b 2 B)f (b) b;av
{ # (g)(b) = Wfu 2 Ubj(8a 2 A)u b;ag(a)
Lemma 4. The concept lattices of C and Cb are identical.</p>
      <p>Proof. Firstly consider that for any (u; v) 2 Ub
following holds:
b;ag for any f 2 Qb2B Ub
b;ag for any g 2 Qa2A Va.</p>
      <p>Va for any (b; a) 2 B</p>
      <p>A the
u v
b;a = u
v</p>
      <p>b;a
= b;a(u; v)
= (u b;a v</p>
      <p>R(b; a)):
Let f 2 Qb2B Ub be arbitrary. Then
" (f )(a) = _fv 2 Vaj(8b 2 B)f (b) b;av
= _fv 2 Vaj(8b 2 B)f (b) b;a v
=% (f )(a):
b;ag
R(b; a)g
Analogously for # (g)(b) =. (g)(b) for any g 2 Qa2A Va.
tu
5</p>
    </sec>
    <sec id="sec-5">
      <title>Bonds between heterogeneous formal contexts</title>
      <p>We present a de nition of a bond between two heterogeneous formal contexts
which can be formulated as follows.</p>
      <p>De nition 10. Let Ci = hBi; Ai; Pi; Ri; Ui; Vi; ii for i 2 f1; 2g be two
heterogeneous formal contexts. The heterogeneous formal context B = hB1; A2; P; R; U1; V2; i
such that Ext(B) Ext(C1) and Int(B) Int(C2) is said to be a bond between
two heterogeneous formal contexts C1 and C2.</p>
      <p>Direct product of two heterogeneous formal contexts
In this subsection, we de ne a direct product of two heterogeneous formal
contexts. Further, we give an answer on how to nd a bond between two
heterogeneous formal contexts.</p>
      <p>De nition 11. Let Ci = hBi; Ai; Pi; Ri; Ui; Vi; ii for i 2 f1; 2g be two
heterogeneous formal contexts. The heterogeneous formal context</p>
      <p>C1 C2 = hB1</p>
      <p>A2; B2</p>
      <p>A1; P ; R ; U ; V ; i
such that
{ P = f b1;a1 b2;a2 j((b1; a2); (b2; a1)) 2 (B1 A2) (B2 A1)g
{ where bi;ai (u; v) = (u bi;ai v Ri(bi; ai)) for any (u; v) 2 Ubi Vai for any
(bi; ai) 2 Bi Ai for any i 2 f1; 2g
{ R ((b1; a2); (b2; a1)) = b1;a1 b2;a2 for any bi 2 Bi and ai 2 Ai for all
i 2 f1; 2g
{ U = f 1;2 2 2-Bonds(hUb1 ; Ub1 ; i; hVa2 ; Va2 ; i)j(b1; a2) 2 B1 A2g
{ V = f 2;1 2 2-Bonds(hUb2 ; Ub2 ; i; hVa1 ; Va1 ; i)j(b2; a1) 2 B2 A1g
is said to be a direct product of two heterogeneous formal contexts.
Lemma 5. Let Ci = hBi; Ai; Pi; Ri; Ui; Vi; ii for i 2 f1; 2g be two
heterogeneous formal contexts. Let</p>
      <p>R 2</p>
      <p>Y
(b1;a2)2B1 A2</p>
      <p>2-Bonds(hUb1 ; Ub1 ; i; hVa2 ; Va2 ; i)
be an extent of the direct product C1 C2. Then a heterogeneous formal context
B = hB1; A2; ; R; U1; V2; i where
= f2-Bonds(hUb1 ; Ub1 ; i; hVa2 ; Va2 ; i)j(b1; a2) 2 B1
A2g
is a bond between C1 and C2.</p>
      <p>Proof. Let us have any intent of B. Then there exists f 2 Qb12B1 Ub1 such that
^ (f (b1)b1 (u1) ) R(b1; a2)(u1; v2))
(Q) for some Q 2 Q(b2;a1)2B2 A1 2-Bonds(hUb2 ; Ub2 ; i; hVa1 ; Va1 ; i)
^ (f (b1)b1 (u1) ).</p>
      <p>(Q)(b1; a2)(u1; v2))
^
%B (f )(a2)a2 (v2) = %B(f )(v2)</p>
      <p>"R(b1;a2) (f (b1)b1 )(v2)
= ^</p>
      <p>b12B1
= ^
R =.
= ^
= ^
b12B1 u12Ub1
b12B1 u12Ub1
= ^
= ^
= ^
= ^</p>
      <p>^
b22B2 u22Ub2
_</p>
      <p>_
) b2;a2 (u2; v2)
= ^</p>
      <p>b22B2 u22Ub2
where
q(b2)(u2) = _
= %C2 (q)(v2) = %C2 (q)(a2)(v2)
_
_</p>
      <p>_ f (b1)(u1)^Q(b2; a1)(u2; v1)^: b1;a1 (u1; v1)
b12B1 u12Ub1 a12A1 v12Va1
Hence, %B (f ) =%C2 (q). So any intent of B is an intent of C2.</p>
      <p>By using the following equality</p>
      <p>(: b1;a1 (u1; v1) ) b2;a2 (u2; v2)) = (: b2;a2 (u2; v2) ) b1;a1 (u1; v1))
analogously we obtain that any extent of B is an extent of C1. Hence, B is a bond
between C1 and C2. tu
6</p>
    </sec>
    <sec id="sec-6">
      <title>Conclusion</title>
      <p>Bonds and their L-fuzzy generalizations represent a feasible way to explore the
relationships between formal contexts. In this paper we have investigated the
notion of a bond with respect to the heterogeneous formal contexts. In
conclusion, an alternative de nition of a bond provides an e cient tool to work with
the nonhomogeneous data and one can further explore this uncharted territory
in formal concept analysis.</p>
      <p>Categorical properties of heterogeneous formal contexts and bonds as
morphisms between such objects and categorical relationship to homogeneous FCA
categorical description will be studied in the near future.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>C.</given-names>
            <surname>Alcalde</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Burusco</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Fuentes-Gonzalez</surname>
          </string-name>
          and
          <string-name>
            <surname>I. Zubia.</surname>
          </string-name>
          <article-title>The use of linguistic variables and fuzzy propositions in the L-fuzzy concept theory</article-title>
          .
          <source>Computers &amp; Mathematics with Applications</source>
          ,
          <volume>62</volume>
          (
          <issue>8</issue>
          ):
          <fpage>3111</fpage>
          -
          <lpage>3122</lpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>L.</given-names>
            <surname>Antoni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Krajci</surname>
          </string-name>
          ,
          <string-name>
            <surname>O.</surname>
          </string-name>
          <article-title>Kr dlo</article-title>
          , B.
          <string-name>
            <surname>Macek</surname>
            , and
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Piskova</surname>
          </string-name>
          .
          <article-title>Relationship between two FCA approaches on heterogeneous formal contexts</article-title>
          .
          <source>Proceedings of CLA</source>
          ,
          <volume>93</volume>
          {
          <fpage>102</fpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>L.</given-names>
            <surname>Antoni</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Krajci</surname>
          </string-name>
          ,
          <string-name>
            <surname>O.</surname>
          </string-name>
          <article-title>Kr dlo</article-title>
          , B.
          <string-name>
            <surname>Macek</surname>
            , and
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Piskova</surname>
          </string-name>
          .
          <article-title>On heterogeneous formal contexts</article-title>
          .
          <source>Fuzzy Sets and Systems</source>
          ,
          <volume>234</volume>
          :
          <fpage>22</fpage>
          {
          <fpage>33</fpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>R.</given-names>
            <surname>Belohlavek</surname>
          </string-name>
          .
          <article-title>Fuzzy concepts and conceptual structures: induced similarities</article-title>
          .
          <source>Proceedings of Joint Conference on Information Sciences</source>
          ,
          <volume>179</volume>
          {
          <fpage>182</fpage>
          ,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>R.</given-names>
            <surname>Belohlavek</surname>
          </string-name>
          .
          <article-title>Lattices of xed points of fuzzy Galois connections</article-title>
          .
          <source>Mathematical Logic Quartely</source>
          ,
          <volume>47</volume>
          (
          <issue>1</issue>
          ):
          <volume>111</volume>
          {
          <fpage>116</fpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>R.</given-names>
            <surname>Belohlavek</surname>
          </string-name>
          .
          <article-title>Concept lattices and order in fuzzy logic</article-title>
          .
          <source>Annals of Pure and Applied Logic</source>
          ,
          <volume>128</volume>
          (
          <issue>1</issue>
          {3):
          <fpage>277</fpage>
          -
          <lpage>298</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>R.</given-names>
            <surname>Belohlavek</surname>
          </string-name>
          .
          <article-title>Lattice-type fuzzy order is uniquely given by its 1-cut: proof and consequences</article-title>
          .
          <source>Fuzzy Sets and Systems</source>
          ,
          <volume>143</volume>
          :
          <fpage>447</fpage>
          {
          <fpage>458</fpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>R.</given-names>
            <surname>Belohlavek</surname>
          </string-name>
          .
          <article-title>Sup-t-norm and inf-residuum are one type of relational product: unifying framework and consequences</article-title>
          .
          <source>Fuzzy Sets and Systems</source>
          ,
          <volume>197</volume>
          :
          <fpage>45</fpage>
          {
          <fpage>58</fpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>R.</given-names>
            <surname>Belohlavek</surname>
          </string-name>
          .
          <article-title>Ordinally equivalent data: A measurement-theoretic look at formal concept analysis of fuzzy attributes</article-title>
          .
          <source>International Journal of Approximate Reasoning</source>
          ,
          <volume>54</volume>
          (
          <issue>9</issue>
          ):
          <volume>1496</volume>
          {
          <fpage>1506</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <article-title>Simple proof of basic theorem for general concept lattices by Cartesian representation MDAI 2012, Girona</article-title>
          , Catalonia, Spain,
          <source>November 21-23</source>
          ,
          <year>2012</year>
          , LNCS
          <volume>7647</volume>
          (
          <year>2012</year>
          ),
          <fpage>294</fpage>
          -
          <lpage>305</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <given-names>P.</given-names>
            <surname>Butka</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Pocs</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Pocsova</surname>
          </string-name>
          .
          <article-title>Representation of fuzzy concept lattices in the framework of classical FCA</article-title>
          .
          <source>Journal of Applied Mathematics, Article ID 236725</source>
          , 7 pages,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <given-names>P.</given-names>
            <surname>Butka</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Pocs</surname>
          </string-name>
          .
          <article-title>Generalization of one-sided concept lattices</article-title>
          .
          <source>Computing and Informatics</source>
          ,
          <volume>32</volume>
          (
          <issue>2</issue>
          ):
          <volume>355</volume>
          {
          <fpage>370</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>C. Carpineto</surname>
            , and
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Romano</surname>
          </string-name>
          .
          <article-title>Concept Data Analysis</article-title>
          .
          <article-title>Theory and Applications</article-title>
          . J. Wiley,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>J.C.</surname>
          </string-name>
          <article-title>D az-</article-title>
          <string-name>
            <surname>Moreno</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          <string-name>
            <surname>Medina</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Ojeda-Aciego</surname>
          </string-name>
          .
          <article-title>On basic conditions to generate multi-adjoint concept lattices via Galois connections</article-title>
          .
          <source>International Journal of General Systems</source>
          ,
          <volume>43</volume>
          (
          <issue>2</issue>
          ):
          <volume>149</volume>
          {
          <fpage>161</fpage>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <given-names>D.</given-names>
            <surname>Dubois</surname>
          </string-name>
          and
          <string-name>
            <given-names>H.</given-names>
            <surname>Prade</surname>
          </string-name>
          .
          <article-title>Possibility theory and formal concept analysis: Characterizing independent sub-contexts</article-title>
          .
          <source>Fuzzy sets and systems</source>
          ,
          <volume>196</volume>
          , 4{
          <fpage>16</fpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <given-names>B.</given-names>
            <surname>Ganter</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Wille</surname>
          </string-name>
          .
          <article-title>Formal concept analysis</article-title>
          . Springer{Verlag,
          <year>1999</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <given-names>J.</given-names>
            <surname>Konecny</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Ojeda-Aciego</surname>
          </string-name>
          .
          <article-title>Isotone L-bonds</article-title>
          .
          <source>Proceedings of CLA</source>
          ,
          <fpage>153</fpage>
          -
          <lpage>162</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>J. Konecny</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Krupka</surname>
          </string-name>
          .
          <source>Block Relations in Fuzzy Setting Proceedings of CLA</source>
          ,
          <fpage>115</fpage>
          -
          <lpage>130</lpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <given-names>J.</given-names>
            <surname>Konecny</surname>
          </string-name>
          .
          <source>Information Processing and Management of Uncertainty in Knowledge-Based Systems Comunications Computer and Information Sciences</source>
          , vol.
          <volume>444</volume>
          ,
          <year>2014</year>
          , pp
          <fpage>71</fpage>
          -
          <lpage>80</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20. O. Kr dlo and M.
          <string-name>
            <surname>Ojeda-Aciego</surname>
          </string-name>
          .
          <article-title>On the L-fuzzy generalization of Chu correspondences</article-title>
          .
          <source>International Journal of Computer Mathematics</source>
          ,
          <volume>88</volume>
          (
          <issue>9</issue>
          ):
          <fpage>1808</fpage>
          -
          <lpage>1818</lpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21. O. Kr dlo, S. Krajci, and
          <string-name>
            <given-names>M.</given-names>
            <surname>Ojeda-Aciego</surname>
          </string-name>
          .
          <article-title>The category of L-Chu correspondences and the structure of L-bonds</article-title>
          .
          <source>Fundamenta Informaticae</source>
          ,
          <volume>115</volume>
          (
          <issue>4</issue>
          ):
          <fpage>297</fpage>
          -
          <lpage>325</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          22. O. Kr dlo and M.
          <string-name>
            <surname>Ojeda-Aciego</surname>
          </string-name>
          .
          <article-title>Linking L-Chu correspondences and completely lattice L-ordered sets</article-title>
          .
          <source>Proceedings of CLA</source>
          ,
          <volume>233</volume>
          {
          <fpage>244</fpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          23. O.
          <article-title>Kr dlo and M. Ojeda-Aciego. CRL-Chu correspondences</article-title>
          .
          <source>Proceedings of CLA</source>
          ,
          <volume>105</volume>
          {
          <fpage>116</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          24. O. Kr dlo, P. Mihalcin,
          <string-name>
            <given-names>S.</given-names>
            <surname>Krajci</surname>
          </string-name>
          and
          <string-name>
            <given-names>L.</given-names>
            <surname>Antoni</surname>
          </string-name>
          .
          <article-title>Formal Concept analysis of higher order</article-title>
          .
          <source>Proceedings of CLA</source>
          ,
          <fpage>117</fpage>
          -
          <lpage>128</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          25. O.
          <article-title>Kr dlo and M. Ojeda-Aciego. Revising the Link between L-Chu correspondences and completely lattice L-ordered sets</article-title>
          .
          <source>Annals of Mathematics and Arti cial Inteligence, DOI 10.1007/s10472-014-9416-8</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          26. M. Krotzsch, P. Hitzler, and
          <string-name>
            <given-names>G.-Q.</given-names>
            <surname>Zhang</surname>
          </string-name>
          . Morphisms in context.
          <source>Lecture Notes in Computer Science</source>
          ,
          <volume>3596</volume>
          :
          <fpage>223</fpage>
          {
          <fpage>237</fpage>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          27.
          <string-name>
            <given-names>J.</given-names>
            <surname>Medina</surname>
          </string-name>
          and
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Ojeda-Aciego. Multi-adjoint t-concept lattices</article-title>
          .
          <source>Information Sciences</source>
          ,
          <volume>180</volume>
          :
          <fpage>712</fpage>
          {
          <fpage>725</fpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref28">
        <mixed-citation>
          28.
          <string-name>
            <given-names>J.</given-names>
            <surname>Medina</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Ojeda-Aciego</surname>
          </string-name>
          .
          <article-title>On multi-adjoint concept lattices based on heterogeneous conjunctors</article-title>
          .
          <source>Fuzzy Sets and Systems</source>
          ,
          <volume>208</volume>
          :
          <fpage>95</fpage>
          {
          <fpage>110</fpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref29">
        <mixed-citation>
          29.
          <string-name>
            <given-names>J.</given-names>
            <surname>Medina</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Ojeda-Aciego</surname>
          </string-name>
          .
          <article-title>Dual multi-adjoint concept lattices</article-title>
          .
          <source>Information Sciences</source>
          ,
          <volume>225</volume>
          , 47{
          <fpage>54</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref30">
        <mixed-citation>
          30.
          <string-name>
            <given-names>H.</given-names>
            <surname>Mori</surname>
          </string-name>
          . Chu Correspondences.
          <source>Hokkaido Matematical Journal</source>
          ,
          <volume>37</volume>
          :
          <fpage>147</fpage>
          {
          <fpage>214</fpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref31">
        <mixed-citation>
          31.
          <string-name>
            <given-names>H.</given-names>
            <surname>Mori</surname>
          </string-name>
          .
          <article-title>Functorial properties of Formal Concept Analysis</article-title>
          .
          <source>Proc ICCS, Lecture Notes in Computer Science</source>
          ,
          <volume>4604</volume>
          :
          <fpage>505</fpage>
          {
          <fpage>508</fpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref32">
        <mixed-citation>
          32.
          <string-name>
            <surname>J. Pocs.</surname>
          </string-name>
          <article-title>Note on generating fuzzy concept lattices via Galois connections</article-title>
          .
          <source>Information Sciences</source>
          <volume>185</volume>
          (
          <issue>1</issue>
          ):
          <volume>128</volume>
          {
          <fpage>136</fpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref33">
        <mixed-citation>
          33.
          <string-name>
            <given-names>J.</given-names>
            <surname>Pocs</surname>
          </string-name>
          .
          <article-title>On possible generalization of fuzzy concept lattices</article-title>
          .
          <source>Information Sciences</source>
          ,
          <volume>210</volume>
          :
          <fpage>89</fpage>
          {
          <fpage>98</fpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>