Peter Jeavons

According to our database, Peter Jeavons authored at least 90 papers between 1993 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Representing Fitness Landscapes by Valued Constraints to Understand the Complexity of Local Search.

Artem Kaznatcheev, David A. Cohen, Peter Jeavons

J. Artif. Intell. Res., 2020

Galois Connections for Patterns: An Algebra of Labelled Graphs.

David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný

Proceedings of the Graph Structures for Knowledge Representation and Reasoning, 2020

2019

Binary constraint satisfaction problems defined by excluded topological minors.

David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný

Inf. Comput., 2019

2017

Binarisation for Valued Constraint Satisfaction Problems.

David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Andrei A. Krokhin, Robert Powell, Stanislav Zivný

SIAM J. Discret. Math., 2017

The power of propagation: when GAC is enough.

David A. Cohen, Peter G. Jeavons

Constraints An Int. J., 2017

Finding Graph Decompositions via SAT.

Wenting Zhao, Mark H. Liffiton, Peter Jeavons, Dan Roberts

Proceedings of the 29th IEEE International Conference on Tools with Artificial Intelligence, 2017

2016

Feedback from nature: simple randomised distributed algorithms for maximal independent set selection and greedy colouring.

Peter Jeavons, Alex Scott, Lei Xu

Distributed Comput., 2016

Minimal Weighted Clones with Boolean Support.

Peter G. Jeavons, Andrius Vaicenavicius, Stanislav Zivný

Proceedings of the 46th IEEE International Symposium on Multiple-Valued Logic, 2016

2015

Steering Evolution with Sequential Therapy to Prevent the Emergence of Bacterial Antibiotic Resistance.

Daniel Nichol, Peter Jeavons, Alexander G. Fletcher, Robert A. Bonomo, Philip K. Maini, Jerome L. Paul, Robert A. Gatenby, Alexander R. A. Anderson, Jacob G. Scott

PLoS Comput. Biol., 2015

Patterns from nature: Distributed greedy colouring with simple messages and minimal graph knowledge.

Lei Xu, Peter Jeavons

Inf. Sci., 2015

Simple Algorithms for Distributed Leader Election in Anonymous Synchronous Rings and Complete Networks Inspired by Neural Development in Fruit Flies.

Lei Xu, Peter Jeavons

Int. J. Neural Syst., 2015

Tractable Classes of Binary CSPs Defined by Excluded Topological Minors.

David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Binarisation via Dualisation for Valued Constraints.

David A. Cohen, Martin C. Cooper, Peter G. Jeavons, Stanislav Zivný

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

The Complexity of Valued Constraint Satisfaction.

Peter Jeavons, Andrei A. Krokhin, Stanislav Zivný

Bull. EATCS, 2014

Led by nature: Distributed leader election in anonymous networks.

Lei Xu, Peter Jeavons

Proceedings of the 10th International Conference on Natural Computation, 2014

Tractable Valued Constraints.

Peter G. Jeavons, Stanislav Zivný

Proceedings of the Tractability: Practical Approaches to Hard Problems, 2014

2013

An Algebraic Theory of Complexity for Discrete Optimization.

David A. Cohen, Martin C. Cooper, Páidí Creed, Peter G. Jeavons, Stanislav Zivný

SIAM J. Comput., 2013

Simple Neural-Like P Systems for Maximal Independent Set Selection.

Lei Xu, Peter G. Jeavons

Neural Comput., 2013

A Polynomial-Time Solution to Constraint Satisfaction Problems by Neural-like P Systems.

Lei Xu, Xiangxiang Zeng, Peter Jeavons

Int. J. Unconv. Comput., 2013

Representing and solving finite-domain constraint problems using systems of polynomials.

Christopher Jefferson, Peter Jeavons, Martin James Green, Marc R. C. van Dongen

Ann. Math. Artif. Intell., 2013

Feedback from nature: an optimal distributed algorithm for maximal independent set selection.

Alex Scott, Peter Jeavons, Lei Xu

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Tractable Combinations of Global Constraints.

David A. Cohen, Peter G. Jeavons, Evgenij Thorstensen, Stanislav Zivný

Proceedings of the Principles and Practice of Constraint Programming, 2013

2012

Local Consistency and SAT-Solvers.

Peter Jeavons, Justyna Petke

J. Artif. Intell. Res., 2012

An Algebraic Theory of Complexity for Discrete Optimisation

David A. Cohen, Martin C. Cooper, Páidí Creed, Peter G. Jeavons, Stanislav Zivný

CoRR, 2012

2011

Structural Decomposition Methods and What They are Good For.

Markus Aschinger, Conrad Drescher, Georg Gottlob, Peter Jeavons, Evgenij Thorstensen

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

The Order Encoding: From Tractable CSP to Tractable SAT.

Justyna Petke, Peter Jeavons

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection.

David A. Cohen, Páidí Creed, Peter G. Jeavons, Stanislav Zivný

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

Tackling the Partner Units Configuration Problem.

Markus Aschinger, Conrad Drescher, Georg Gottlob, Peter Jeavons, Evgenij Thorstensen

Proceedings of the IJCAI 2011, 2011

Optimization Methods for the Partner Units Problem.

Markus Aschinger, Conrad Drescher, Gerhard Friedrich, Georg Gottlob, Peter Jeavons, Anna Ryabokon, Evgenij Thorstensen

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2011

2010

Classes of submodular constraints expressible by graph cuts.

Stanislav Zivný, Peter G. Jeavons

Constraints An Int. J., 2010

Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination.

Martin C. Cooper, Peter G. Jeavons, András Z. Salamon

Artif. Intell., 2010

2009

The complexity of constraint satisfaction games and QCSP.

Ferdinand Börner, Andrei A. Bulatov, Hubie Chen, Peter Jeavons, Andrei A. Krokhin

Inf. Comput., 2009

The expressive power of binary submodular functions.

Stanislav Zivný, David A. Cohen, Peter G. Jeavons

Discret. Appl. Math., 2009

Presenting Constraints.

Peter Jeavons

Proceedings of the 7th International Workshop on First-Order Theorem Proving, 2009

The Complexity of Valued Constraint Models.

Stanislav Zivný, Peter G. Jeavons

Proceedings of the Principles and Practice of Constraint Programming, 2009

2008

The expressive power of valued constraints: Hierarchies and collapses.

David A. Cohen, Peter G. Jeavons, Stanislav Zivný

Theor. Comput. Sci., 2008

Generalising submodularity and horn clauses: Tractable optimization problems defined by tournament pair multimorphisms.

David A. Cohen, Martin C. Cooper, Peter Jeavons

Theor. Comput. Sci., 2008

A unified theory of structural tractability for constraint satisfaction problems.

David A. Cohen, Peter Jeavons, Marc Gyssens

J. Comput. Syst. Sci., 2008

Hybrid tractable CSPs which generalize tree structure.

Martin C. Cooper, Peter G. Jeavons, András Z. Salamon

Proceedings of the ECAI 2008, 2008

Perfect Constraints Are Tractable.

András Z. Salamon, Peter G. Jeavons

Proceedings of the Principles and Practice of Constraint Programming, 2008

2007

First class objects and indexes for chant manuscripts.

Louis W. G. Barton, Peter Jeavons, John A. Caldwell, Koon Shan Barry Ng

Proceedings of the ACM/IEEE Joint Conference on Digital Libraries, 2007

A Geometrical Model for the SNP Motif Identification Problem.

Gaofeng Huang, Peter Jeavons

Proceedings of the 7th IEEE International Conference on Bioinformatics and Bioengineering, 2007

Exact and Heuristic Approaches for Identifying Disease-Associated SNP Motifs.

Gaofeng Huang, Peter Jeavons, Dominic Kwiatkowski

Proceedings of 5th Asia-Pacific Bioinformatics Conference, 2007

2006

The Complexity of Constraint Languages.

David A. Cohen, Peter Jeavons

Proceedings of the Handbook of Constraint Programming, 2006

Enhancing the Prediction of Transcription Factor Binding Sites by Incorporating Structural Properties and Nucleotide Covariations.

Sumedha Gunewardena, Peter Jeavons, Zhaolei Zhang

J. Comput. Biol., 2006

Symmetry Definitions for Constraint Satisfaction Problems.

David A. Cohen, Peter Jeavons, Christopher Jefferson, Karen E. Petrie, Barbara M. Smith

Constraints An Int. J., 2006

The complexity of soft constraint satisfaction.

David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin

Artif. Intell., 2006

A Unifying Theory of Structural Decompostions for the Constraint Satisfaction Problems.

David A. Cohen, Marc Gyssens, Peter Jeavons

Proceedings of the Complexity of Constraints, 01.10. - 06.10.2006, 2006

An Algebraic Characterisation of Complexity for Valued Constraint.

David A. Cohen, Martin C. Cooper, Peter Jeavons

Proceedings of the Principles and Practice of Constraint Programming, 2006

Constraint Symmetry and Solution Symmetry.

David A. Cohen, Peter Jeavons, Christopher Jefferson, Karen E. Petrie, Barbara M. Smith

Proceedings of the Proceedings, 2006

2005

Classifying the Complexity of Constraints Using Finite Algebras.

Andrei A. Bulatov, Peter Jeavons, Andrei A. Krokhin

SIAM J. Comput., 2005

Supermodular functions and the complexity of MAX CSP.

David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin

Discret. Appl. Math., 2005

E-library of medieval chant manuscript transcriptions.

Louis W. G. Barton, John A. Caldwell, Peter Jeavons

Proceedings of the ACM/IEEE Joint Conference on Digital Libraries, 2005

A Unified Theory of Structural Tractability for Constraint Satisfaction and Spread Cut Decomposition.

David A. Cohen, Peter Jeavons, Marc Gyssens

Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

2004

Constraint Satisfaction Problems on Intervals and Length.

Andrei A. Krokhin, Peter Jeavons, Peter Jonsson

SIAM J. Discret. Math., 2004

A Maximal Tractable Class of Soft Constraints.

David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin

J. Artif. Intell. Res., 2004

Implementing a Test for Tractability.

Richard Gault, Peter Jeavons

Constraints An Int. J., 2004

Identifying Efficiently Solvable Cases of Max CSP.

David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin

Proceedings of the STACS 2004, 2004

A Complete Characterization of Complexity for Boolean Constraint Optimization Problems.

David A. Cohen, Martin C. Cooper, Peter Jeavons

Proceedings of the Principles and Practice of Constraint Programming, 2004

2003

Learnability of quantified formulas.

Víctor Dalmau, Peter Jeavons

Theor. Comput. Sci., 2003

Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra.

Andrei A. Krokhin, Peter Jeavons, Peter Jonsson

J. ACM, 2003

New Tractable Classes From Old.

David A. Cohen, Peter Jeavons, Richard Gault

Constraints An Int. J., 2003

Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey.

Andrei A. Krokhin, Andrei A. Bulatov, Peter Jeavons

Proceedings of the 33rd IEEE International Symposium on Multiple-Valued Logic (ISMVL 2003), 2003

Quantified Constraints: Algorithms and Complexity.

Ferdinand Börner, Andrei A. Bulatov, Peter Jeavons, Andrei A. Krokhin

Proceedings of the Computer Science Logic, 17th International Workshop, 2003

Soft Constraints: Complexity and Multimorphisms.

David A. Cohen, Martin C. Cooper, Peter Jeavons, Andrei A. Krokhin

Proceedings of the Principles and Practice of Constraint Programming, 2003

An Algebraic Approach to Multi-sorted Constraints.

Andrei A. Bulatov, Peter Jeavons

Proceedings of the Principles and Practice of Constraint Programming, 2003

2001

The complexity of constraints on intervals and lengths

Andrei A. Krokhin, Peter Jeavons, Peter Jonsson

Electron. Colloquium Comput. Complex., 2001

Automatic analysis of agarose gel images.

P. S. Umesh Adiga, A. Bhomra, Maria Grazia Turri, A. Nicod, S. R. Datta, Peter Jeavons, Richard Mott, Jonathan Flint

Bioinform., 2001

The complexity of maximal constraint languages.

Andrei A. Bulatov, Andrei A. Krokhin, Peter Jeavons

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

A Complete Classification of Complexity in Allens Algebra in the Presence of a Non-Trivial Basic Relation.

Andrei A. Krokhin, Peter Jeavons, Peter Jonsson

Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001

2000

Building tractable disjunctive constraints.

David A. Cohen, Peter Jeavons, Peter Jonsson, Manolis Koubarakis

J. ACM, 2000

Constraint Satisfaction Problems and Finite Algebras.

Andrei A. Bulatov, Andrei A. Krokhin, Peter Jeavons

Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999

How to Determine the Expressive Power of Constraints.

Peter Jeavons, David A. Cohen, Marc Gyssens

Constraints An Int. J., 1999

1998

On the Algebraic Structure of Combinatorial Problems.

Peter Jeavons

Theor. Comput. Sci., 1998

Constraints and Universal Algebra.

Peter Jeavons, David A. Cohen, Justin Pearson

Ann. Math. Artif. Intell., 1998

Constraints, Consistency and Closure.

Peter Jeavons, David A. Cohen, Martin C. Cooper

Artif. Intell., 1998

Constructing Constraints.

Peter Jeavons

Proceedings of the Principles and Practice of Constraint Programming, 1998

1997

Closure properties of constraints.

Peter Jeavons, David A. Cohen, Marc Gyssens

J. ACM, 1997

Tractable Disjunctive Constraints.

David A. Cohen, Peter Jeavons, Manolis Koubarakis

Proceedings of the Principles and Practice of Constraint Programming - CP97, Third International Conference, Linz, Austria, October 29, 1997

1996

A test for Tractability.

Peter Jeavons, David A. Cohen, Marc Gyssens

Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996

Derivation of Constraints and Database Relations.

David A. Cohen, Marc Gyssens, Peter Jeavons

Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996

1995

Tractable Constraints on Ordered Domains.

Peter Jeavons, Martin C. Cooper

Artif. Intell., 1995

A Unifying Framework for Tractable Constraints.

Peter Jeavons, David A. Cohen, Marc Gyssens

Proceedings of the Principles and Practice of Constraint Programming, 1995

An Algebraic Characterization of Tractable Constraints.

Peter Jeavons, David A. Cohen

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

Generating binary sequences for stochastic computing.

Peter Jeavons, David A. Cohen, John Shawe-Taylor

IEEE Trans. Inf. Theory, 1994

Recovering a Relation from a Decomposition Using Constraint Satisfaction.

Peter Jeavons

Inf. Sci., 1994

Decomposing Constraint Satisfaction Problems Using Database Techniques.

Marc Gyssens, Peter Jeavons, David A. Cohen

Artif. Intell., 1994

Characterising Tractable Constraints.

Martin C. Cooper, David A. Cohen, Peter Jeavons

Artif. Intell., 1994

A Substitution Operation for Constraints.

Peter Jeavons, David A. Cohen, Martin C. Cooper

Proceedings of the Principles and Practice of Constraint Programming, 1994

1993

Counting Representable Sets on Simple Graphs.

Peter Jeavons

Discret. Appl. Math., 1993