Formal Concept Analysis with Many-sorted Attributes
Abstract
This paper unites two problem-solving traditions in computer science: (1) constraint-based reasoning, and (2) formal concept analysis. For basic definitions and properties of networks of constraints, we follow the foundational approach of Montanari and Rossi. This paper advocates distributed relations as a more semantic version of networks of constraints. The theory developed here uses the theory of formal concept analysis, pioneered by Rudolf Wille and his colleagues, as a key for unlocking the hidden semantic structure within distributed relations. Conversely, this paper offers distributed relations as a seamless many-sorted extension to the formal contexts of formal concept analysis. Some of the intuitions underlying our approach were discussed in a preliminary fashion by Freuder and Wallace.
Cite
@article{arxiv.1810.05703,
title = {Formal Concept Analysis with Many-sorted Attributes},
author = {Robert E. Kent and John Brady},
journal= {arXiv preprint arXiv:1810.05703},
year = {2018}
}
Comments
11 pages, 6 tables, Proceedings of the Fifth International Conference on Computing and Information (ICCI'93), Sudbury, Ontario, Canada, May 1993