Overview
What started as my student project under the supervision of Jakub Bulin with a straightforward goal of researching and implementing an algorithm to generate non-isomorphic CSP templates has now turned into a fully fledged, highly performant mathematical library toolkit that concerns itself with the manipulation and analysis of relational structures, especially the constraint satisfaction problem (CSP).
Thanks to Jakub Bulin, this research/project even received what was my very first open-source funding. For which I am very grateful, and I want to explicitly thank him for all the support, time, and encouragement I received from him.
Contributions
If you are interested in contributing or collaborating, please let me know through my before mentioned communication channels in the about page, or submit a pull request. I will be happy to respond :)
Git Repository:
Latest version is currently hosted at codeberg: https://codeberg.org/ragana/cspforge
Licence & Warranty
==============================================================================
| |
| cspforge |
| |
| (c) 2025 Marko Stajgar <marko.stajgar@proton.me> |
| |
| This program is free software: you can redistribute it and/or modify |
| it under the terms of the GNU General Public License as published by |
| the Free Software Foundation, either version 3 of the License, or |
| any later version. |
| |
| This program is distributed in the hope that it will be useful, |
| but WITHOUT ANY WARRANTY; without even the implied warranty of |
| MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| GNU General Public License for more details. |
| |
| You should have received a copy of the GNU General Public License |
| along with this program. If not, see <https://www.gnu.org/licenses/>. |
| |
==============================================================================