{"id":13760340,"url":"https://github.com/tomhanika/conexp-clj","last_synced_at":"2025-12-30T09:24:58.532Z","repository":{"id":1817181,"uuid":"2741371","full_name":"tomhanika/conexp-clj","owner":"tomhanika","description":"A General-Purpose Tool for Formal Concept Analysis","archived":false,"fork":false,"pushed_at":"2024-09-23T07:08:49.000Z","size":10762,"stargazers_count":53,"open_issues_count":17,"forks_count":25,"subscribers_count":5,"default_branch":"master","last_synced_at":"2024-10-28T13:42:05.311Z","etag":null,"topics":["clojure","closure-systems","conceptual-knowledge","data","data-analysis","data-science","formal-concept-analysis","lattice","order","order-theory"],"latest_commit_sha":null,"homepage":"","language":"Clojure","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":"eczarny/spectacle","license":"epl-1.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/tomhanika.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":"AUTHORS.md","dei":null,"publiccode":null,"codemeta":null}},"created_at":"2011-11-09T12:30:26.000Z","updated_at":"2024-10-07T12:33:13.000Z","dependencies_parsed_at":"2023-07-06T08:18:27.211Z","dependency_job_id":"a43c0ee0-ed40-4342-8fdf-4900749a5657","html_url":"https://github.com/tomhanika/conexp-clj","commit_stats":{"total_commits":2676,"total_committers":24,"mean_commits":111.5,"dds":0.2290732436472347,"last_synced_commit":"cdd5bb7cd510ae10e68847a4f4ab58ea9ba1f097"},"previous_names":[],"tags_count":13,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tomhanika%2Fconexp-clj","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tomhanika%2Fconexp-clj/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tomhanika%2Fconexp-clj/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/tomhanika%2Fconexp-clj/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/tomhanika","download_url":"https://codeload.github.com/tomhanika/conexp-clj/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":224949773,"owners_count":17397233,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["clojure","closure-systems","conceptual-knowledge","data","data-analysis","data-science","formal-concept-analysis","lattice","order","order-theory"],"created_at":"2024-08-03T13:01:08.213Z","updated_at":"2025-12-30T09:24:58.525Z","avatar_url":"https://github.com/tomhanika.png","language":"Clojure","funding_links":[],"categories":["Clojure"],"sub_categories":[],"readme":"# conexp-clj [![Build Status](https://img.shields.io/github/actions/workflow/status/tomhanika/conexp-clj/run-tests.yaml?branch=master\u0026label=build)](https://github.com/tomhanika/conexp-clj/actions/workflows/run-tests.yaml) [![Clojars Project](https://img.shields.io/clojars/v/conexp-clj.svg)](https://clojars.org/conexp-clj) [![built with nix](https://img.shields.io/static/v1?logo=nixos\u0026logoColor=white\u0026label=\u0026message=Built%20with%20Nix\u0026color=41439a)](https://builtwithnix.org)\n\nThis is conexp-clj, a general purpose software tool for [Formal Concept\nAnalysis](http://www.upriss.org.uk/fca/fca.html).    Its main purpose is to\nenable nontrivial examples to be computed easily, but it can be used for much,\nmuch more.\n\n\n## Documentation\n\n1. [Getting Started](doc/Getting-Started.org)\n2. Don't Bother Me with Theory, I Want to Do Stuff! (aka: Tutorials)\n   1. [A Gentle Introduction](doc/tutorials/icfca-2013/icfca2013-tutorial-live.org) (ICFCA 2013)\n   2. [Compute the Canonical Base from a Formal Context that is given in CSV Format](doc/tutorials/How-to-compute-the-Canonical-Base-from-a-Context-given-in-CSV-Format.org)\n   3. [Standalone Console Application](https://github.com/tomhanika/brunt)\n3. A more complete overview over `conexp-clj`\n   1. [Notation and Syntax](doc/Basic-Notation-and-Syntax.org)\n   2. [Creating and Working with Formal Contexts](doc/Formal-Contexts.org)\n   3. [Concept Lattices](doc/Concept-Lattices.org)\n   4. [IO for Formal Contexts](doc/IO.org)\n   5. [Implications](doc/Implications.org)\n   6. [Exploration](doc/Exploration.org)\n   7. [Scaling Many-Valued Contexts](doc/Scaling-Many-Valued-Contexts.org)\n4. Example use cases of `conexp-clj`\n   1. [Formal Contexts from Implications](doc/code/implication-closure.clj)\n   2. [A Formal Context of Functions](doc/code/function-context.clj)\n   3. [Context of All Permutations on a Finite Set](doc/code/permutation-context.clj)\n   4. [The Tamari Lattice](doc/code/tamari-lattice.clj)\n   5. [Preconcept Covers](doc/code/covering-preconcepts.clj)\n   6. [Number of Elements of the Free Distributive\n      Lattice](doc/code/free-distributive-lattice.clj)\n   7. [Counting Linear Extensions](doc/code/linear_extensions.clj)\n   8. [Computing Traces in Contexts](doc/code/trace-context.clj)\n   9. [Counting Quasiorders](doc/code/quasiorders.clj)\n   10. [Rudolph's Algorithm for Computing Bases](doc/code/rudolph_computation.clj)\n   11. [Libkin Decompositions](doc/LibkinDecomposition.org)\n   12. [Direct Product Decompositions](doc/DirectProductDecompositions.org)\n5. Advanced Topics\n   1. [pq-cores](doc/pq-cores-in-Formal-Contexts.md)\n   2. [REST-API Usage](doc/REST-API-usage.md)\n   3. [triadic-exploration](doc/Triadic-Exploration.org)\n   4. [protoconcepts](doc/Protoconcepts.org)\n   5. [Incomplete Contexts](doc/IncompleteContexts.org)\n   6. [Factorization of Formal Contexts](doc/MatrixFactorization.org)\n6. [API documentation](doc/API.md)\n7. [Development](doc/Development.org)\n\n\n## History\n\nThe project has been started by Daniel Borchmann under supervision of Christian\nMeschke as part of the DFG project GA 216/10-1.  It has since been developed\nfurther into a general purpose FCA tool by Daniel Borchmann until his departure\nfrom academia in 2017.  From then on, Tom Hanika took over and is still the\nprincipal maintainer of `conexp-clj`.\n\n\n## Limitations\n\nNote that `conexp-clj` is not a high-performance tool for Formal Concept\nAnalysis and may sometimes be considerably slower then comparable tools.  If you\nwant more performance, check out Uta Priss' [website on FCA\nsoftware](http://www.upriss.org.uk/fca/fcasoftware.html).\n\n\n## Contributing Authors\n\nSee [AUTHORS.md](AUTHORS.md).\n\n## How to cite `conexp-clj`?\nIf you have used `conexp-clj` for your scientific work, the developers\nwould appreciate if you use the following reference.\n\n```\n@inproceedings{DBLP:conf/icfca/HanikaH19,\n  author    = {Tom Hanika and\n               Johannes Hirth},\n  editor    = {Diana Cristea and\n               Florence Le Ber and\n               Rokia Missaoui and\n               L{\\'{e}}onard Kwuida and\n               Baris Sertkaya},\n  title     = {Conexp-Clj - {A} Research Tool for {FCA}},\n  booktitle = {Supplementary Proceedings of {ICFCA} 2019 Conference and Workshops,\n               Frankfurt, Germany, June 25-28, 2019},\n  series    = {{CEUR} Workshop Proceedings},\n  volume    = {2378},\n  pages     = {70--75},\n  publisher = {CEUR-WS.org},\n  year      = {2019},\n  url       = {http://ceur-ws.org/Vol-2378/shortAT8.pdf},\n  timestamp = {Wed, 12 Feb 2020 16:44:55 +0100},\n  biburl    = {https://dblp.org/rec/conf/icfca/HanikaH19.bib},\n  bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n```\n\n## License\n\nCopyright ⓒ 2009—2018 Daniel Borchmann, 2018—2025 Tom Hanika\n\nDistributed under the Eclipse Public License.\n\nThis program uses an adapted version of\nthe [G library](http://geosoft.no/graphics/index.html), a 2D graphics library\nand rendering engine for Java, ⓒ 2009 GeoSoft, licensed under\nthe [GNU Lesser General Public License](http://www.gnu.org/copyleft/lesser.html)\n(LGPL).  Modifications to the original version of G are only concerned with\nexposing internals necessary for conexp-clj to work.  The modified version of G\nis again licensed under LGPL.\n\nThis program uses parts of the [LatDraw library](http://latdraw.org), ⓒ 2002\nRalph Freese.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftomhanika%2Fconexp-clj","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftomhanika%2Fconexp-clj","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftomhanika%2Fconexp-clj/lists"}