82

The framework and the basic results of Wille on triadic concept analysis, including his Basic Theorem of Triadic Concept Analysis, are here generalized to n-dimensional formal contexts. Mathematics Subject Classifications (2000): Primary: 06A23; secondary: 62-07.

Logical scaling is a new method to transform data matrices which are based on object-attribute-value-relationships into data matrices from which conceptual hierarchies can be explored. The derivation of concept lattices is determined by terminologies expressed in a formal-logical language.

Formal Concept Analysis is based on a formalization of context. Since there are situations where the consideration of one context is not suucient, it is desirable to introduce a formalization of a network of contexts. In this paper, such formalization is given by the notion of mul-ticontext. The aim of the paper is to ooer a rst study of multicontexts and their conceptual structures; in particu...

The aim of this paper is to show how Formal Concept Analysis can be used for the benefit of clone theory. More precisely, we show how a recently developed duality theory for clones can be used to dualize clones over bounded lattices into the framework of Formal Concept Analysis, where they can be investigated with techniques very different from those that universal algebraists are usually armed...

In Formal Concept Analysis it is very important to study fast algorithms to compute concept lattices. This paper introduces an algorithm on the multiadjoint concept lattice framework, in order to compute the whole concept lattice. This fuzzy framework is very general and provides more flexibility in relational systems. This has been theoretically studied and, now, we need an algorithm to comput...

We define the lower(upper) rough soft formal concept in the rough soft formal context, and using the soft set define the rough soft formal concept lattice, give the properties of the soft rough formal concept lattices.