Professor David Cohen

  1. 1992
  2. Published

    Rationality of division orderings

    Cohen, D. & Scott, E., 1992, In: Information Processing Letters. p. 307-311

    Research output: Contribution to journalArticlepeer-review

  3. 1994
  4. Published

    A Structural Decomposition for Hypergraphs

    Jeavons, P. G., Cohen, D. A. & Gyssens, M., 1994, Jerusalem Combinatorics ’93. Barcelo, H. & Kalai, G. (eds.). American Mathematical Society, p. 161-177 17 p. (Contemporary Mathematics; vol. 178).

    Research output: Chapter in Book/Report/Conference proceedingChapter

  5. Published

    Characterising Tractable Constraints

    Cooper, M. C., Cohen, D. A. & Jeavons, P. G., 1994, In: Artificial Intelligence. 65, 2, p. 347-361 15 p.

    Research output: Contribution to journalArticlepeer-review

  6. Published

    Decomposing Constraint Satisfaction Problems Using Database Techniques

    Gyssens, M., Jeavons, P. G. & Cohen, D. A., 1994, In: Artificial Intelligence. 66, 1, p. 57-89 33 p.

    Research output: Contribution to journalArticlepeer-review

  7. Published

    A Substitution Operation for Constraints

    Jeavons, P. G., Cohen, D. A. & Cooper, M. C., 1 May 1994, Principles and Practice of Constraint Programming: Second International Workshop, PPCP '94 Rosario, Orcas Island, WA, USA, May 2–4, 1994 Proceedings. Borning, A. (ed.). Vol. 874. p. 1-9

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

  8. 1995
  9. Published

    A Unifying Framework for Tractable Constraints

    Jeavons, P. G., Cohen, D. A. & Gyssens, M., 1995, p. 276-291.

    Research output: Contribution to conferencePaper

  10. Published

    An Algebraic Characterization of Tractable Constraints

    Jeavons, P. G. & Cohen, D. A., 1995, p. 633-642.

    Research output: Contribution to conferencePaper

  11. 1996
  12. Published

    A Test for Tractability

    Jeavons, P. G., Cohen, D. A. & Gyssens, M., 1996, p. 267-281.

    Research output: Contribution to conferencePaper

  13. Published

    Closure Properties of Constraints

    Jeavons, P. G., Cohen, D. A. & Gyssens, M., 1996.

    Research output: Working paper

  14. Published

    Derivation of Constraints and Database Relations

    Cohen, D. A., Gyssens, M. & Jeavons, P. G., 1996, p. 134-148.

    Research output: Contribution to conferencePaper

  15. Published

    Tractable Disjunctive Constraints

    Cohen, D. A., Jeavons, P. G. & Koubarakis, M., 1996, p. 478-490.

    Research output: Contribution to conferencePaper

  16. 1997
  17. Published

    Closure Properties of Constraints

    Jeavons, P. G., Cohen, D. A. & Gyssens, M., 1997, In: Journal of the ACM. 44, p. 527-548 22 p.

    Research output: Contribution to journalArticlepeer-review

  18. Published

    Constraints, Consistency and Closure

    Jeavons, P. G., Cohen, D. A. & Cooper, M. C., 1997.

    Research output: Working paper

  19. 1998
  20. Published

    Constraints and universal algebra

    Jeavons, P. G., Cohen, D. A. & Pearson, J. K., 1998, In: Annals of Mathematics and Artificial Intelligence. 24, p. 51-67 17 p.

    Research output: Contribution to journalArticlepeer-review

  21. Published

    Constraints and Universal Algebra

    Jeavons, P. G., Cohen, D. A. & Pearson, J. K., 1998.

    Research output: Working paper

  22. Published

    Constraints, Consistency and Closure

    Jeavons, P. G., Cohen, D. A. & Cooper, M., 1998, In: Artificial Intelligence. 101, 1-2, p. 251-265 15 p.

    Research output: Contribution to journalArticlepeer-review

  23. Published

    Towards High Order Constraint Representations for the Frequency Assignment Problem

    Dunkin, N. W., Bater, J. E., Jeavons, P. G. & Cohen, D. A., 1998.

    Research output: Working paper

  24. Published

    Are there Effective Frequency Separation Constraints for FAPs with Irregular Tx Placements?

    Bater, J. E., Jeavons, P. G., Cohen, D. A. & Dunkin, N. W., 1 Oct 1998.

    Research output: Contribution to conferencePaper

  25. 1999
  26. Published

    How to Determine the Expressive Power of Constraints

    Jeavons, P. G., Cohen, D. A. & Gyssens, M., 1999, In: Constraints. 4, 2, p. 113-131 19 p.

    Research output: Contribution to journalArticlepeer-review

  27. 2000
  28. Published

    Building tractable disjunctive constraints

    Cohen, D. A., Jeavons, P. G., Jonsson, P. & Koubarakis, M., 2000, In: Journal of the ACM. 47, p. 826-853 28 p.

    Research output: Contribution to journalArticlepeer-review

  29. Published

    New Tractable Classes from Old

    Cohen, D. A., Jeavons, P. G. & Gault, R. L., 2000, p. 160-171.

    Research output: Contribution to conferencePaper

  30. 2003
  31. Published

    A New Classs of Binary CSPs for which Arc-Constistency Is a Decision Procedure

    Cohen, D. A., 2003, p. 807-811.

    Research output: Contribution to conferencePaper

  32. Published

    New Tractable Classes From Old

    Cohen, D., Jeavons, P. & Gault, R., 2003, p. 263-282.

    Research output: Contribution to conferencePaper

  33. Published

    Soft constraints: complexity and multimorphsims

    Cohen, D., Cooper, M., Jeavons, P. & Krokhin, A., 2003, p. 244-258.

    Research output: Contribution to conferencePaper

  34. Published

    Tractability by Approximating Constraint Languages

    Green, M. J. & Cohen, D. A., 2003.

    Research output: Contribution to conferencePaper

  35. 2004
  36. 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

  37. 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

  38. 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

  39. Published

    Supermodular Functions and the Complexity of MAX CSP

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

    Research output: Working paper

  40. 2005
  41. 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

  42. Published
  43. 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

  44. 2006
  45. Published

    An algebraic characterisation of complexity for valued constraints

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

    Research output: Contribution to conferencePaper

  46. 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

  47. 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

  48. 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

  49. 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

  50. Published

    Typed Guarded Decompositions for Constraint Satisfaction

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

    Research output: Contribution to conferencePaper

  51. Published
  52. 2007
  53. 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

  54. 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

  55. 2008
  56. 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

  57. 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

  58. 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

  59. 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

  60. 2009
  61. 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

  62. 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

  63. 2011
  64. 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

  65. Published

    On guaranteeing polynomially-bounded search tree size

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

    Research output: Contribution to conferencePaperpeer-review

  66. 2012
  67. 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

Previous 1 2 Next