Closure properties of constraints
- P. Jeavons, D. Cohen, M. Gyssens
- MathematicsJACM
- 1 July 1997
This paper investigates the subclasses that arise from restricting the possible constraint types, and shows that any set of constraints that does not give rise to an NP-complete class of problems must satisfy a certain type of algebraic closure condition.
Constraints, Consistency and Closure
- P. Jeavons, D. Cohen, Martin C. Cooper
- MathematicsArtificial Intelligence
- 1 May 1998
The complexity of soft constraint satisfaction
- D. Cohen, Martin C. Cooper, P. Jeavons, A. Krokhin
- MathematicsArtificial Intelligence
- 1 August 2006
Symmetry Definitions for Constraint Satisfaction Problems
- D. Cohen, P. Jeavons, Christopher Jefferson, K. Petrie, Barbara M. Smith
- Computer ScienceConstraints
- 1 October 2005
The many different definitions of symmetry for constraint satisfaction problems (CSPs) are reviewed, and it is shown that a symmetry can be defined in two fundamentally different ways: as an operation preserving the solutions of a CSP instance, or else as anoperation preserving the constraints.
Decomposing Constraint Satisfaction Problems Using Database Techniques
- M. Gyssens, P. Jeavons, D. Cohen
- Computer ScienceArtificial Intelligence
- 1 March 1994
A unified theory of structural tractability for constraint satisfaction problems
- D. Cohen, P. Jeavons, M. Gyssens
- Computer Science, MathematicsJournal of computer and system sciences (Print)
- 1 August 2008
Characterising Tractable Constraints
- Martin C. Cooper, D. Cohen, P. Jeavons
- Computer Science, MathematicsArtificial Intelligence
- 1 February 1994
The expressive power of binary submodular functions
- Stanislav Živný, D. Cohen, P. Jeavons
- MathematicsDiscrete Applied Mathematics
- 12 November 2008
Iterative Plan Construction for the Workflow Satisfiability Problem
- D. Cohen, J. Crampton, A. Gagarin, G. Gutin, Mark Jones
- Computer ScienceJournal of Artificial Intelligence Research
- 16 June 2013
A novel approach to the WSP, using techniques from CSP, has enabled a generic algorithm which is FPT for several families of workflow constraints considered in the literature, and it is proved that the union of FPT languages remains FPT if they satisfy a simple compatibility condition.
...
...