no code implementations • 26 Feb 2022 • Özgür Akgün, Ian P. Gent, Christopher Jefferson, Zeynep Kiziltan, Ian Miguel, Peter Nightingale, András Z. Salamon, Felix Ulrich-Oltean
The performance of a constraint model can often be improved by converting a subproblem into a single table constraint.
no code implementations • 1 Nov 2021 • Özgür Akgün, Alan M. Frisch, Ian P. Gent, Christopher Jefferson, Ian Miguel, Peter Nightingale, András Z. Salamon
The Essence language allows a user to specify a constraint problem at a level of abstraction above that at which constraint modelling decisions are made.
1 code implementation • 30 Apr 2021 • Joan Espasa, Ian P. Gent, Ruth Hoffmann, Christopher Jefferson, Alice M. Lynch, András Salamon, Matthew J. McIlree
In this paper, we present Demystify, a general tool for creating human-interpretable step-by-step explanations of how to solve a wide range of pen and paper puzzles from a high-level logical description.
no code implementations • 12 Nov 2019 • Christopher Jefferson, Markus Pfeiffer, Rebecca Waldecker, Wilf A. Wilson
We introduce a new framework for solving an important class of computational problems involving finite permutation groups, which includes calculating set stabilisers, intersections of subgroups, and isomorphisms of combinatorial structures.
Group Theory 20-08 (Primary) 20B05 (Secondary)
1 code implementation • 1 Jul 2019 • Mohamed Barakat, Reimer Behrends, Christopher Jefferson, Lukas Kühne, Martin Leuner
In this paper we describe a parallel algorithm for generating all non-isomorphic rank $3$ simple matroids with a given multiplicity vector.
Combinatorics 05B35, 52C35, 32S22, 68R05, 68W10
no code implementations • 4 Feb 2014 • Peter Nightingale, Ian Philip Gent, Christopher Jefferson, Ian Miguel
We also introduce a variant algorithm HaggisGAC-Stable, which is adapted to avoid work on backtracking and in some cases can be faster and have significant reductions in memory use.
