Peter Jeavons
Peter Jeavons
Professor of Computer Science, University of Oxford
Verified email at - Homepage
Cited by
Cited by
Classifying the complexity of constraints using finite algebras
A Bulatov, P Jeavons, A Krokhin
SIAM journal on computing 34 (3), 720-742, 2005
Closure properties of constraints
P Jeavons, D Cohen, M Gyssens
Journal of the ACM (JACM) 44 (4), 527-548, 1997
On the algebraic structure of combinatorial problems
P Jeavons
Theoretical Computer Science 200 (1-2), 185-204, 1998
Constraints, consistency and closure
P Jeavons, D Cohen, MC Cooper
Artificial Intelligence 101 (1-2), 251-265, 1998
Decomposing constraint satisfaction problems using database techniques
M Gyssens, PG Jeavons, DA Cohen
Artificial intelligence 66 (1), 57-89, 1994
Tractable constraints on ordered domains
PG Jeavons, MC Cooper
Artificial Intelligence 79 (2), 327-339, 1995
Constraint satisfaction problems and finite algebras
AA Bulatov, AA Krokhin, P Jeavons
International Colloquium on Automata, Languages, and Programming, 272-282, 2000
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
A Krokhin, P Jeavons, P Jonsson
Journal of the ACM (JACM) 50 (5), 591-640, 2003
Characterising tractable constraints
MC Cooper, DA Cohen, PG Jeavons
Artificial Intelligence 65 (2), 347-361, 1994
The complexity of soft constraint satisfaction
DA Cohen, MC Cooper, PG Jeavons, AA Krokhin
Artificial Intelligence 170 (11), 983-1016, 2006
A survey of tractable constraint satisfaction problems
J Pearson, PG Jeavons
Technical Report CSD-TR-97-15, Royal Holloway, University of London, 1997
The complexity of constraint languages
D Cohen, P Jeavons
Foundations of Artificial Intelligence 2, 245-280, 2006
Steering evolution with sequential therapy to prevent the emergence of bacterial antibiotic resistance
D Nichol, P Jeavons, AG Fletcher, RA Bonomo, PK Maini, JL Paul, ...
PLoS computational biology 11 (9), e1004493, 2015
Symmetry definitions for constraint satisfaction problems
D Cohen, P Jeavons, C Jefferson, KE Petrie, BM Smith
Constraints 11 (2-3), 115-137, 2006
The complexity of maximal constraint languages
A Bulatov, A Krokhin, P Jeavons
Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001
Algebraic structures in combinatorial problems
A Bulatov, P Jeavons
Technische Universitat Dresden, 2001
A stochastic neural architecture that exploits dynamically reconfigurable FPGAs
M Van Daalen, P Jeavons, J Shawe-Taylor
[1993] Proceedings IEEE Workshop on FPGAs for Custom Computing Machines, 202-211, 1993
Building tractable disjunctive constraints
D Cohen, P Jeavons, P Jonsson, M Koubarakis
Journal of the ACM (JACM) 47 (5), 826-853, 2000
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
MC Cooper, PG Jeavons, AZ Salamon
Artificial Intelligence 174 (9-10), 570-584, 2010
Quantified constraints: Algorithms and complexity
F Börner, A Bulatov, P Jeavons, A Krokhin
International Workshop on Computer Science Logic, 58-70, 2003
The system can't perform the operation now. Try again later.
Articles 1–20