Professor David Cohen

  1. 2004
  2. Published

    A complete characterization of complexity for Boolean constraint optimization problems

    Cohen, D., Cooper, M. & Jeavons, P., 2004, p. 212-226.

    Research output: Contribution to conferencePaper

  3. Published

    A maximal tractable class of soft constraints

    Cohen, D., Cooper, M., Jeavons, P. & Krokhin, A., 2004, In: Journal of Artificial Intelligence Research. 22, p. 1-22

    Research output: Contribution to journalArticlepeer-review

  4. Published

    Tractable Decision for a Constraint Language Implies Tractable Search

    Cohen, D. A., 2004, In: Constraints. 9, 3, p. 219-229 11 p.

    Research output: Contribution to journalArticlepeer-review

  5. Published

    Supermodular Functions and the Complexity of MAX CSP

    Cohen, D., Cooper, M., Jeavons, P. & Krokhin, A., 1 Jan 2004.

    Research output: Working paper

  6. 2005
  7. Published

    A Unified Theory of Structural Tractability for Constraint Satisfaction and Spread Cut Decomposition.

    Cohen, D. A., Jeavons, P. & Gyssens, M., 2005, p. 72-77.

    Research output: Contribution to conferencePaper

  8. Published
  9. Published

    Supermodular functions and the complexity of MAX CSP

    Cohen, D., Cooper, M., Jeavons, P. & Krokhin, A., 2005, In: Discrete Applied Mathematics. 149, p. 53-72 20 p.

    Research output: Contribution to journalArticlepeer-review

  10. 2006
  11. Published

    An algebraic characterisation of complexity for valued constraints

    Cohen, D., Cooper, M. & Jeavons, P., 2006, p. 107-121.

    Research output: Contribution to conferencePaper

  12. Published

    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 journalArticlepeer-review

  13. Published

    The complexity of constraint languages

    Cohen, D. & Jeavons, P., 2006, Handbook of Constraint Programming. Rossi, F., van Beek, P. & Walsh, T. (eds.). Elsevier

    Research output: Chapter in Book/Report/Conference proceedingChapter

  14. Published

    The complexity of soft constraint satisfaction

    Cohen, D., Cooper, M., Jeavons, P. & Krokhin, A., 2006, In: Artificial Intelligence. 170, p. 983-1016 34 p.

    Research output: Contribution to journalArticlepeer-review

  15. Published

    The Effect of Constraint Representation on Structural Tractability

    Houghton, C., Cohen, D. & Green, M. J., 2006, p. 726-730.

    Research output: Contribution to conferencePaper

  16. Published

    Typed Guarded Decompositions for Constraint Satisfaction

    Cohen, D. A. & Green, M. J., 2006, p. 122-136.

    Research output: Contribution to conferencePaper

  17. Published
  18. 2007
  19. Published

    The Expressive Power of Valued Constraints: Hierarchies and Collapses

    Cohen, D., Jeavons, P. & ŽZivný, S., 2007, Principles and Practice of Constraint Programming – CP 2007. Bessière, C. (ed.). Berlin and Heidelberg: Springer, p. 798-805 8 p.

    Research output: Chapter in Book/Report/Conference proceedingChapter

  20. Published

    The expressive power of valued constraints: hierarchies and collapses

    Cohen, D. A., Jeavons, P. G. & Zivný, S., 1 Apr 2007.

    Research output: Working paper

  21. 2008
  22. Published

    Generalising submodularity and Horn clauses: tractable optimization problems defined by tournament pair multimorphisms

    Cohen, D., Cooper, M. & Jeavons, P., 2008, In: Theoretical Computer Science. 401, 1-3, p. 36-51 16 p.

    Research output: Contribution to journalArticlepeer-review

  23. Published

    Domain permutation reduction for constraint satisfaction problems

    Green, M. J. & Cohen, D. A., May 2008, In: Artificial Intelligence. 172, 8-9, p. 1094-1118 25 p.

    Research output: Contribution to journalArticlepeer-review

  24. Published

    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 journalArticlepeer-review

  25. Published

    The expressive power of valued constraints: Hierarchies and collapses

    Cohen, D. A., Jeavons, P. G. & Živný, S., 6 Dec 2008, In: Theoretical Computer Science. 409, 1, p. 137-153 17 p.

    Research output: Contribution to journalArticlepeer-review

  26. 2009
  27. Published

    The expressive power of binary submodular functions

    Zivný, S., Cohen, D. A. & Jeavons, P. G., 2009, In: Discrete Applied Mathematics. 157, 15, p. 3347-3358 12 p.

    Research output: Contribution to journalArticlepeer-review

  28. Published

    The Expressive Power of Binary Submodular Functions

    Zivný, S., Cohen, D. A. & Jeavons, P. G., 2009, MFCS 2009. p. 744-757

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

  29. 2011
  30. Published

    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 proceedingConference contribution

  31. Published

    On guaranteeing polynomially-bounded search tree size

    Cohen, D., Cooper, M., Green, M. J. & Marx, D., 2011.

    Research output: Contribution to conferencePaperpeer-review

  32. 2012
  33. Published

    The tractability of CSP classes defined by forbidden patterns

    Cohen, D. A., Cooper, M. C., Creed, P., Marx, D. & Salamon, A. Z., Sep 2012, In: Journal of Artificial Intelligence Research. 45, p. 47-78 3651.

    Research output: Contribution to journalArticlepeer-review