Constraint Satisfaction Problems (CSP) consist of a finite set of variables, each associated with a finite domain, and a set of constraints which restrict simultaneous assignments to variables. A Meta-CSP is CSP formulation of a combinatorial problem which builds on lower-level CSPs. This software framework provides tools for developing solvers for problems that can be cast as Meta-CSPs.
Install & Run: This is a pure Java library, hence it runs on any platform which provides a Java Runtime Environment. It has been tested extensively on Ubuntu Linux 16.04 and up and on Windows.
Additional information: The framework includes several built-in CSP and Meta-CSP problem solvers which can be used as "ingredients" for defining more sophisticated solvers. Among these, hybrid problem solvers which exemplify the natural predisposition of Meta-CSPs for solving hybrid reasoning problems.
This software makes no special provision for trustworthy AI. It does, however, directly facilitate the development of knowledge-driven AI systems, that is, systems in which the specification can be inspected. All of the built-in search algorithms are also systematic, hence it is always possible to find the culprit of a decision by inspecting the search tree and/or inference steps made.
Please note that as per the license: 'THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.'
This library makes no use of personal data of any kind, hence the GDPR is not applicable.