Arbitrary Relations in Formal Concept Analysis and Logical Information Systems
A logical view of formal concept analysis considers attributes of a formal context as unary predicates. In a first part, we propose an augmented definition that handles binary relations between objects. A Galois connection is defined on augmented contexts. It represents concept inheritance as usual, but also relations between concepts. As usual, labeling operators are also defined. In particular, concepts and relations are visible and labeled in a single structure. In a second part, we show how relations can be used for navigating in an augmented concept lattice. This part augments the theory of Logical Information Systems. An implementation is sketched, and first experimental results are presented.
Unable to display preview. Download preview PDF.
- 2.Lindig, C.: Concept. In: Köhler, J., Giunchiglia, F., Green, C., Walther, C. (eds.) IJCAI 1995 Workshop on Formal Approaches to the Reuse of Plans, Proofs, and Programs, Montreal, Canada (1995)Google Scholar
- 10.Prediger, S., Stumme, G.: Theory-driven logical scaling. In: International Workshop on Description Logics, Sweden, vol. 22 (1999)Google Scholar
- 13.Padioleau, Y., Ridoux, O.: A logic file system. In: USENIX Annual Technical Conference, General Track, San Antonio, Texas, USA, USENIX, pp. 99–112 (2003)Google Scholar