• Publications
  • Influence
Classifying the Complexity of Constraints Using Finite Algebras
Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of theExpand
  • 540
  • 59
  • Open Access
The complexity of soft constraint satisfaction
Over the past few years there has been considerable progress in methods to systematically analyse the complexity of constraint satisfaction problems with specified constraint types. One very powerfulExpand
  • 134
  • 23
  • Open Access
Constraint Satisfaction Problems and Finite Algebras
Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of theExpand
  • 146
  • 14
Quantified Constraints: Algorithms and Complexity
The standard constraint satisfaction problem over an arbitrary finite domain can be expressed as follows: given a first-order sentence consisting of a conjunction of predicates, where all of theExpand
  • 75
  • 11
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
Allen's interval algebra is one of the best established formalisms for temporal reasoning. This article provides the final step in the classification of complexity for satisfiability problems overExpand
  • 144
  • 7
  • Open Access
The complexity of maximal constraint languages
Many combinatorial search problems can be expressed as “constraint satisfaction problems” using an appropriate “constraint language”, that is, a set of relations over some fixed finite set of values.Expand
  • 89
  • 6
  • Open Access
A Maximal Tractable Class of Soft Constraints
Many researchers in artificial intelligence are beginning to explore the use of soft constraints to express a set of (possibly conflicting) problem requirements. A soft constraint is a functionExpand
  • 51
  • 6
  • Open Access
Algebraic approach to promise constraint satisfaction
The complexity and approximability of the constraint satisfaction problem (CSP) has been actively studied over the last 20 years. A new version of the CSP, the promise CSP (PCSP) has recently beenExpand
  • 35
  • 6
  • Open Access
Skew Bisubmodularity and Valued CSPs
An instance of the (finite-)Valued Constraint Satisfaction Problem (VCSP) is given by a finite set of variables, a finite domain of values, and a sum of (rational-valued) functions, each functionExpand
  • 26
  • 6
  • Open Access
Skew Bisubmodularity and Valued CSPs
An instance of the (finite-)valued constraint satisfaction problem (VCSP) is given by a finite set of variables, a finite domain of values, and a sum of (rational-valued) functions, with eachExpand
  • 15
  • 6