Some Programming Optimizations for Computing Formal Concepts

ANDREWS, Simon (2020). Some Programming Optimizations for Computing Formal Concepts. In: Ontologies and Concepts in Mind and Machine. 25th International Conference on Conceptual Structures, ICCS 2020 Bolzano, Italy, September 18-20, 2020 Proceedings. Lecture Notes in Artificial Intelligence, part of Lecture Notes in Computer Science (12277). Springer, 59-73.

[img] PDF
iccs20_paper.pdf - Accepted Version
Restricted to Repository staff only until 10 September 2021.
All rights reserved.

Download (145kB)
Official URL:
Link to published version::
Related URLs:


    This paper describes in detail some optimization approaches taken to improve the efficiency of computing formal concepts. In particular, it describes the use and manipulation of bit-arrays to represent FCA structures and carry out the typical operations undertaken in computing formal concepts, thus providing data structures that are both memoryefficient and time saving. The paper also examines the issues and compromises involved in computing and storing formal concepts, describing a number of data structures that illustrate the classical trade-off between memory footprint and code efficiency. Given that there has been limited publication of these programmatical aspects, these optimizations will be useful to programmers in this area and also to any programmers interested in optimizing software that implements Boolean data structures. The optimizations are shown to significantly increase performance by comparing an unoptimized implementation with the optimized one.

    Item Type: Book Section
    Additional Information: Series ISSN: 1611-3349
    Identification Number:
    Page Range: 59-73
    SWORD Depositor: Symplectic Elements
    Depositing User: Symplectic Elements
    Date Deposited: 04 Jun 2020 14:29
    Last Modified: 29 Sep 2020 13:30

    Actions (login required)

    View Item View Item


    Downloads per month over past year

    View more statistics