FCALGS is a collection of standalone tools implementing algorithms for Formal Concept Analysis (FCA) – a method of qualitative data analysis founded by Rudolf Wille (TU Darmstadt) in mid 80s. Our intention is to implement high-performance command-line tools for computing formal concepts, (frequent) itemsets, nonredundant bases, boolean matrix decompositions, and solving other problems related to the FCA.


All packages come with sources and static precompiled binaries for GNU/Linux and Windows operating systems. Supported and tested hardware platforms include x86_32, x86_64, and sparc64. Each program is individually packaged and documented.

Package Release Date Implementation Download Documentation
FCbO ins 2010/10/05 serial, bitarrays fcbo-ins.zip fcbo-ins.html
PCbO amai 2009/03/03 parallel, bitarrays pcbo-amai.zip pcbo-amai.html

All tools in FCALGS use a common set of input/output data formats.

License and Resources

The tools are distributed under the terms of GNU General Public License Version 2.

Users in academia are kindly asked to cite the following resources if the software is used to pursue any research activities which may result in publications:

  1. Krajca P., Outrata J., Vychodil V.: Parallel Recursive Algorithm for FCA.
    In: Belohlavek R., Kuznetsov S. O. (Eds.): Proc. CLA 2008, CEUR WS, 433(2008), 71–82.
    ISBN 978–80–244–2111–7, PDF.