This is conexp-clj, a general purpose software tool for Formal Concept Analysis. Its main purpose is to enable nontrivial examples to be computed easily, but it can be used for much, much more.
- Getting Started
- Don't Bother Me with Theory, I Want to Do Stuff! (aka: Tutorials)
- A more complete overview over
- Example use cases of
- Formal Contexts from Implications
- A Formal Context of Functions
- Context of All Permutations on a Finite Set
- The Tamari Lattice
- Preconcept Covers
- Number of Elements of the Free Distributive Lattice
- Counting Linear Extensions
- Computing Traces in Contexts
- Counting Quasiorders
- Rudolph's Algorithm for Computing Bases
- Advanced Topics
- API documentation
The project has been started by Daniel Borchmann under supervision of Christian
Meschke as part of the DFG project GA 216/10-1. It has since been developed
further into a general purpose FCA tool by Daniel Borchmann until his departure
from academia in 2017. From then on, Tom Hanika took over and is still the
principal maintainer of
conexp-clj is not a high-performance tool for Formal Concept
Analysis and may sometimes be considerably slower then comparable tools. If you
want more performance, check out Uta Priss' website on FCA
Copyright ⓒ 2009—2018 Daniel Borchmann, 2018–2020 Tom Hanika
Distributed under the Eclipse Public License.
This program uses an adapted version of the G library, a 2D graphics library and rendering engine for Java, ⓒ 2009 GeoSoft, licensed under the GNU Lesser General Public License (LGPL). Modifications to the original version of G are only concerned with exposing internals necessary for conexp-clj to work. The modified version of G is again licensed under LGPL.
This program uses parts of the LatDraw library, ⓒ 2002 Ralph Freese.