Abstract
AbstractA simple search problem is studied in which a binary n-tuple is to be found in a list, by sequential bit comparisons with cost. The problem can be solved (for small n) using dynamic programming. We show how the “bottom up” part of the algorithm can be organized by means of Formal Concept Analysis.
Funder
Technische Universität Dresden
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Artificial Intelligence
Reference7 articles.
1. Albano, A., Chornomaz, B.: Why concept lattices are large: extremal theory for generators, concepts, and vc-dimension. Int. J. Gen. Syst. 46(5), 440–457 (2017)
2. Bellman, R.: The theory of dynamic programming. Bull. Am. Math. Soc. 60(6), 503–515 (1954)
3. Ganter, B., Obiedkov, S.: Conceptual exploration. Springer (2016)
4. Ganter, B., Wille, R.: Formal concept analysis mathematical foundations. Springer (1999)
5. Kipke, U, Wille, R: Begriffsverbände als ablaufschemata zur Gegenstandsbestimmung. In: Die klassifikation und ihr umfeld, pp. 164–170. Gesellschaft für Klassifikation e.V. (1986)