Research output per year
Research output per year
Personal profile
Personal profile
Prof. David Cohen does research on the theory of constraint satisfaction. More generally he is interested in the development and analysis of algorithms for improving the effectiveness of industrial
processes, for example, access control, frequency assignment, workflow, and
vehicle routing.
He would welcome applications from prospective PhD students on any aspect of the theory of constraints or valued constraints. In work in any of the following domains:
1) How representation affects efficiency.
2) Which conservative languages are FPT (WSP)
3) Characterising small tractable forbidden patterns
4) Studying the clone lattice and fractional polymorphisms in general
4) Proving the exact complexity of specific CSP languages
5) Considering well know algorithms and how they are affected by particular common changes of representation
Please feel free to contact Prof. Cohen to discuss these topics. Funding is always available for good candidates.
Keywords
- Computer science
- Artificial intelligence
- Constraint Satisfaction
- Computational science foundations
- Algorithms
- Complexity
- FPT
-
A Test for Tractability
Jeavons, P. G., Cohen, D. A. & Gyssens, M., 1996, p. 267-281.Research output: Contribution to conference › Paper
-
Derivation of Constraints and Database Relations
Cohen, D. A., Gyssens, M. & Jeavons, P. G., 1996, p. 134-148.Research output: Contribution to conference › Paper
-
A unified theory of structural tractability for constraint satisfaction problems
Cohen, D., Jeavons, P. & Gyssens, M., Aug 2008, In: Journal of Computer and System Sciences. 74, 5, p. 721-743 23 p.Research output: Contribution to journal › Article › peer-review
-
Symmetry definitions for constraint satisfaction problems
Cohen, D., Jeavons, P., Jefferson, C., Petrie, K. & Smith, B., 2006, In: Constraints. 11, p. 115-137 23 p.Research output: Contribution to journal › Article › peer-review
-
An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection
Cohen, D. A., Creed, P., Jeavons, P. G. & Živný, S., 2011, Mathematical Foundations of Computer Science 2011: 36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011: Proceedings. Springer, p. 231-242 (Lecture Notes in Computer Science; vol. 6907).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Projects
- 6 Finished
-
Analyzing Security-aware Workflows (funded by Leverhulme Trust)
Gutin, G. (PI), Crampton, J. (CoI) & Cohen, D. (CoI)
1/01/19 → 31/12/21
Project: Research
-
Constraint Network Tractability: Beyond Structure and Language
Cohen, D. (PI)
Eng & Phys Sci Res Council EPSRC
31/05/14 → 30/05/17
Project: Research
-
Parameterized Algorithmics for the Analysis and Verification of Constrained Workflow Systems
Gutin, G. (PI), Cohen, D. (CoI) & Crampton, J. (CoI)
Eng & Phys Sci Res Council EPSRC
1/02/13 → 1/05/16
Project: Research
-
The complexity of valued constraints
Cohen, D. (PI)
Eng & Phys Sci Res Council EPSRC
1/10/07 → 1/10/10
Project: Research
-
Groebner Basis Techniques for Constraint Satisfaction Problems
Cohen, D. (CoI) & Jeavons, P. (PI)
30/03/06 → 30/03/09
Project: Research
Prizes
-
College Team Teaching Prize
Matos, C. (Recipient), Cohen, D. (Recipient) & Kinder, J. (Recipient), 2015
Prize: Prize (including medals and awards)
-
-
-
IJCAI 2003 Best Paper Award
Cohen, D. (Recipient), 11 Aug 2003
Prize: Prize (including medals and awards)
-