Computer Science @ University of St Andrews

University of St Andrews crest

Prof Ian Gent

Prof Ian Gent

Position: Professor

Research profile

Email (@st-andrews.ac.uk): ian.gent

Office: JC0.23 - Jack Cole Building, North Haugh

Phone: +44 (0)1334 46 3247

Home page: https://ipg.host.cs.st-andrews.ac.uk

Research Overview

Combinatorial search problems in artificial intelligence.


Current Research Projects include :


Integrating modern tools for computational group theory with constraint programming tools to solve difficult problems in areas such as scheduling and timetabling.


This is leading to exciting interdisciplinary research between Artificial Intelligence and Mathematics.

Recent Publications

Automatically improving constraint models in Savile Row

Generalized support and formal development of constraint propagators

Complexity of n-Queens Completion

Persistent identification and citation of software

Jones, CM, Matthews, B, Gent, I, Griffin, T & Tedds, J 2016, 'Persistent identification and citation of software' International Journal of Digital Curation, vol 11, no. 2, pp. 104-114. DOI: 10.2218/ijdc.v11i2.422

Exploiting short supports for improved encoding of arbitrary constraints into SAT

Akgün, Ö, Gent, IP, Jefferson, CA, Miguel, IJ & Nightingale, PW 2016, Exploiting short supports for improved encoding of arbitrary constraints into SAT. in M Rueher (ed.), Principles and Practice of Constraint Programming: 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings. Lecture Notes in Computer Science, vol. 9892, Springer, pp. 3-12, 22nd International Conference on Principles and Practice of Constraint Programming (CP 2016), Toulouse, France, 5-9 September. DOI: 10.1007/978-3-319-44953-1_1

S-crucial and bicrucial permutations with respect to squares

Case Studies and Challenges in Reproducibility in the Computational Sciences

Arabas, S, Bareford, MR, Gent, IP, Gorman, BM, Hajiarabderkani, M, Henderson, T, Hutton, L, Konovalov, A, Kotthoff, L, McCreesh, C, Paul, RR, Petrie, KEJ, Razaq, A, Reijsbergen, D & Takeda, K Case Studies and Challenges in Reproducibility in the Computational Sciences.

Automatically Improving Constraint Models in Savile Row through Associative-Commutative Common Subexpression Elimination

Nightingale, P, Akgun, O, Gent, IP, Jefferson, C & Miguel, I 2014, Automatically Improving Constraint Models in Savile Row through Associative-Commutative Common Subexpression Elimination. in B OSullivan (ed.), Principles and Practice of Constraint Programming. Lecture Notes in Computer Science, vol. 8656, Springer, Cham, pp. 590-605, 20th International Conference on the Principles and Practice of Constraint Programming (CP 2014), France, 8-12 September. DOI: 10.1007/978-3-319-10428-7_43

Generating custom propagators for arbitrary constraints

Qualitative modelling via constraint programming