Computer Science @ University of St Andrews

University of St Andrews crest

Dr Chris Jefferson

Dr Chris Jefferson

Position: Reader

Research profile

Email (@st-andrews.ac.uk): caj21

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

Phone: +44 (0)1334 46 3272

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

Recent Publications

Complexity of n-Queens completion (extended abstract)

Gent, IP, Jefferson, CA & Nightingale, PW 2018, Complexity of n-Queens completion (extended abstract). in J Lang (ed.), Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence, pp. 5608-5611, 27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence, Stockholm, Sweden, 13/07/18. DOI: 10.24963/ijcai.2018/794

A framework for constraint based local search using ESSENCE

Akgun, O, Attieh, SWA, Gent, IP, Jefferson, CA, Miguel, IJ, Nightingale, PW, Salamon, AZ, Spracklen, P & Wetter, JP 2018, A framework for constraint based local search using ESSENCE. in J Lang (ed.), Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence, pp. 1242-1248, 27th International Joint Conference on Artificial Intelligence and the 23rd European Conference on Artificial Intelligence, Stockholm, Sweden, 13/07/18. DOI: 10.24963/ijcai.2018/173

Minimal and canonical images

New refiners for permutation group search

Metamorphic testing of constraint solvers

Akgun, O, Gent, IP, Jefferson, CA, Miguel, IJ & Nightingale, PW 2018, Metamorphic testing of constraint solvers. in J Hooker (ed.), Principles and Practice of Constraint Programming: 24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings. Lecture Notes in Computer Science, vol. 11008, Springer, pp. 727-736, 24th International Conference on Principles and Practice of Constraint Programming (CP 2018), Lille, France, 27/08/18. DOI: 10.1007/978-3-319-98334-9_46

Automatic discovery and exploitation of promising subproblems for tabulation

Akgun, O, Gent, IP, Jefferson, CA, Miguel, IJ, Nightingale, PW & Salamon, AZ 2018, Automatic discovery and exploitation of promising subproblems for tabulation. in J Hooker (ed.), Principles and Practice of Constraint Programming: 24th International Conference, CP 2018, Lille, France, August 27-31, 2018, Proceedings. Lecture Notes in Computer Science, vol. 11008, Springer, pp. 3-12, 24th International Conference on Principles and Practice of Constraint Programming (CP 2018), Lille, France, 27/08/18. DOI: 10.1007/978-3-319-98334-9_1

Automatically improving constraint models in Savile Row

Complexity of n-Queens Completion

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/09/16. DOI: 10.1007/978-3-319-44953-1_1

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/09/14. DOI: 10.1007/978-3-319-10428-7_43