Publications of
David Cohen, Martin Cooper, Paidi Creed, Peter Jeavons, Stanislav Zivny
An Algebraic Theory of Complexity for Discrete Optimization
In : SIAM Journal on Computing, Society for Industrial and Applied Mathematics (SIAM), USA, Vol. 42 N. 5, pp. 1915-1939, 2013.
Martin Cooper, Peter Jeavons, Andras Salamon
Generalizing constraint satisfaction on trees: hybrid tractability and variable elimination
In : Artificial Intelligence, Elsevier, Vol. 174, pp. 570-584, 2010.
Abstract URL : http://www.irit.fr/publis/ADRIA/BTP_final.pdf
BibTeXDavid Cohen, Martin Cooper, Peter Jeavons
Generalising submodularity and Horn clauses: tractable optimization problems defined by tournament pair multimorphisms
In : Theoretical Computer Science, Elsevier, Vol. 401 N. 1-3, pp. 36-51, 2008.
David Cohen, Martin Cooper, Peter Jeavons, Andrei Krokhin
The complexity of soft constraint satisfaction
In : Artificial Intelligence, Elsevier, Vol. 170 N. 11, pp. 983-1016, 2006.
URL : http://www.irit.fr/publis/ADRIA/AIJ_complexity_soft_constraint_satisfaction.pdf
BibTeXDavid Cohen, Martin Cooper, Peter Jeavons, Andrei Krokhin
Supermodular functions and the complexity of MAX CSP
In : Discrete Applied Mathematics, Elsevier, Vol. 149 N. 1-3, pp. 53-72, 2005.
David Cohen, Martin Cooper, Peter Jeavons, Andrei Krokhin
A maximal tractable class of soft constraints
In : Journal of Artificial Intelligence Research (JAIR), AAAI Press, Vol. 22, pp. 1-22, 2004.
URL : http://www.irit.fr/publis/ADRIA/JAIRversion.pdf
BibTeXPeter Jeavons, David Cohen, Martin Cooper
Constraints, consistency and closure
In : Artificial Intelligence, Elsevier, Vol. 101, pp. 251-265, 1998.
Tractable constraints on ordered domains
In : Artificial Intelligence, Elsevier, Vol. 79 N. 2, pp. 327-339, February 1995.
Martin Cooper, Peter Jeavons, Andras Salamon
Hybrid tractable CSPs which generalize tree structure (regular paper)
In : European Conference on Artificial Intelligence (ECAI 2008), Patras, 21/07/08-25/07/08, Vol. 178, M Ghallab, C Spyropoulos, N Fakotakis, N Avouris (Eds.), IOS Press, Frontiers in Artificial Intelligence and Applications, pp. 530-534, 2008 (Best Paper).
URL : http://www.irit.fr/publis/ADRIA/PapersCooper/btpECAI.pdf
BibTeXDavid Cohen, Martin Cooper, Peter Jeavons
An algebraic characterisation of complexity for valued constraints
In : International Conference on Principles and Practice of Constraint Programming (CP 2006), Nantes, 01/09/06, Springer, LNCS 4204, pp. 680-684, 2006.
David Cohen, Martin Cooper, Peter Jeavons
A complete characterization of complexity for boolean constraint optimization problems (regular paper)
In : International Conference on Principles and Practice of Constraint Programming (CP 2004), Toronto, 27/09/04-01/10/04, Springer-Verlag, LNCS 3258, pp. 212-226, October 2004.
David Cohen, Martin Cooper, Peter Jeavons, Andrei Krokhin
Identifying Efficiently Solvable Cases of Max CSP
In : STACS, Montpellier, France, 25/03/04-27/03/04, Volker Diekert, Michel Habib (Eds.), LNCS 2996, Springer, pp. 152-163, March 2004.
David Cohen, Martin Cooper, Peter Jeavons, Andrei Krokhin
A Maximal Tractable Class of Soft Constraints
In : IJCAI-03, 18th International Joint Conference on Artificial Intelligence, Acapulco, Mexico, 09/08/03-15/08/03, Georg Gottlob, Toby Walsh (Eds.), Morgan Kaufmann, pp. 209-214, August 2003.
David Cohen, Martin Cooper, Peter Jeavons, Andrei Krokhin
Soft Constraints: Complexity and Multimorphisms
In : International Conference on Principles and Practice of Constraint Programming (CP 2003), Kinsale, Ireland, 29/09/03-03/10/03, Francesca Rossi (Eds.), Springer, LNCS 2833, pp. 244-258, September 2003.
Peter Jeavons, David Cohen, Martin Cooper
When constraints are easy to satisfy
In : Proc. IMA Conference on Applications of Combinational Mathematics, –, Oxford University Press, England, January 1995.