|
| Name: |
Professor IP Gent |
| Organisation: |
University of St Andrews |
| Department: |
Computer Science |
| Current EPSRC-Supported Research
Topics: |
|
Fundamentals of Computing
|
Logic & Combinatorics
|
|
| Current EPSRC Support |
|
| Previous EPSRC Support |
| EP/H004092/1 | A Constraint Solver Synthesiser | (C) |
| EP/G055181/1 | HPC-GAP: High Performance Computational Algebra and Discrete Mathematics | (C) |
| EP/F031114/1 | Proof Theory and Constraint Satisfaction | (P) |
| EP/E030394/1 | Watched Literals and Learning for Constraint Programming | (P) |
| EP/D030145/1 | Refinement-driven Transformation for Effective Automated Constraint Modelling | (C) |
| EP/C523229/1 | Multidisciplinary Critical Mass in Computational Algebra and Applications | (C) |
| GR/S86037/01 | Network: Symmetry and Search Network | (C) |
| GR/S30580/01 | Symmetry and Inference | (C) |
| GR/S30658/01 | Modelling Symmetries in Constraint Programming | (P) |
| GR/R29666/01 | Constraint Programming, Search and Symmetry | (P) |
| GR/R55382/01 | Algorithms for Quantified Boolean Formulae | (P) |
| GR/M90641/01 | PROBLEM REFORMULATION AND SEARCH | (C) |
| GR/M54605/01 | CHARACTERISING HARD PROBLEMS | (P) |
| GR/L24014/01 | CONSTRAINEDNESS OF COMPUTATIONAL PROBLEMS | (C) |
| GR/K65706/01 | AN EMPIRICAL STUDY OF CONSTRAINT SATISFACTION PROBLEMS | (C) |
|
|
Key: (P)=Principal Investigator, (C)=Co-Investigator, (R)=Researcher Co-Investigator
|
| |
|
|
|
|