P
Peter Jeavons
Researcher at University of Oxford
Publications - 143
Citations - 6442
Peter Jeavons is an academic researcher from University of Oxford. The author has contributed to research in topics: Constraint satisfaction problem & Constraint satisfaction. The author has an hindex of 41, co-authored 142 publications receiving 6106 citations. Previous affiliations of Peter Jeavons include Royal Holloway, University of London & University of London.
Papers
More filters
Journal ArticleDOI
Classifying the Complexity of Constraints Using Finite Algebras
TL;DR: It is shown that any set of relations used to specify the allowed forms of constraints can be associated with a finite universal algebra and how the computational complexity of the corresponding constraint satisfaction problem is connected to the properties of this algebra is explored.
Journal ArticleDOI
Closure properties of constraints
TL;DR: 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.
Journal ArticleDOI
On the algebraic structure of combinatorial problems
TL;DR: A general algebraic formulation for a wide range of combinatorial problems including Satisfiability, Graph Colorability and Graph Isomorphism is described, and it is demonstrated that the complexity of solving this decision problem is determined in many cases by simple algebraic properties of the relational structures involved.
Journal ArticleDOI
Constraints, consistency and closure
TL;DR: A simple algebraic property is described which characterises all possible constraint types for which strong k-consistency is sufficient to ensure global consistency, for each k > 2.
Journal ArticleDOI
Decomposing constraint satisfaction problems using database techniques
TL;DR: It is proved that a constraint satisfaction problem may be decomposed into a number of subproblems precisely when the corresponding hypergraph satisfies a simple condition.