Software
Our optimisation software solutions
Emerging from our research, use our software to help solve your optimisation challenges.
Modelling for Optimisation
-
MiniZinc
A free and open-source constraint modeling language to model constraint satisfaction and optimization problems in a high-level and solver-independent way
-
PySAT
Provides a simple and unified incremental interface to a number of state-of-art Boolean satisfiability (SAT) solvers.
-
FindMUS
FindMUS lists unsatisfiable subsets of constraints in your MiniZinc model. It uses the hierarchical structure provided by the model to guide its search.
-
Globalizer
Globalizer analyses a model and set of data to provide suggestions of global constraints that can replace or enhance a user’s model.
Constraint Programming Solvers
-
Huub
Huub is a Rust library for building reliable, performant, and extensible CP+SAT systems for decision and optimization problems. It combines constraint programming with SAT-based learning, and lets users customize the solver with their own propagators, branchers, and underlying SAT solvers.
-
Gecode
An open source C++ toolkit for developing constraint-based systems and applications that provides a constraint solver with state-of-the-art performance while being modular and extensible.
-
Chuffed
A state of the art lazy clause solver designed from the ground up with lazy clause generation in mind.
-
Geas
An LCG solver intended to be readily extensible (with new variable types as well as propagators), can cope with large variable domains, and can spawn multiple solver instances in the same process.
Explaining Artificial Intelligence
-
minds
A Python toolkit, which can be used for computing minimum size decisions sets, i.e. unordered sets of if-then rules.
-
XReason
A repository containing tools to support the MaxSAT-based explanation extraction approach proposed in the AAAI'22 paper.
-
xdl
A set of Python scripts for computing and enumerating rigorous abductive (AXp) and contrastive (CXp) explanations for decision list (DL) models.
Pathfinding
-
Warthog
Fast implementations of various pathfinding algorithms including Jump Point Search and JPS+.
-
LazyCBS
An optimal multi-agent pathfinding solver built on lazy clause generation technology.
-
BCP for MAPF
An implementation of a branch-and-cut-and-price model of the multi-agent path finding problem. This source code repository has moved to https://github.com/ed-lam/bcp-mapf.
Bioinformatics
-
Laboratory of Computational Biology
LCB addresses key computational challenges that arise in biological data, predominantly in those involving protein 3D structures and 1D sequences.
-
Mustang
A command line program to produce multiple structural alignments given the three-dimensional coordinates of proteins.
-
Proçodic: Protein Concepts Dictionary
An interactive web server capturing the dictionary of topologically conserved secondary structures (a.k.a concepts), that forms the architectural 'basis set' of the observed universe of protein structures.
-
MMLigner
A command-line program and webserver to infer pairwise protein 3D structure alignments and also identify closely-competing alignments.
-
seqMMLigner
A command line program to infer alignments between amino acid SEQUENCES under the MML framework.