Constraint Satisfaction Problems: Publications

[1]
Minimal Weighted Clones with Boolean Support
Peter G. Jeavons‚ Andrius Vaicenavičius and Stanislav Živný
In Takahiro Hanyu, editor, Proceedings of the 46th IEEE International Symposium on Multiple−Valued Logic‚ ISMVL 2016‚ Sapporo‚ Japan‚ May 18−20‚ 2016. Pages 90–95. IEEE Computer Society. May, 2016.
Details about Minimal Weighted Clones with Boolean Support  BibTeX data for Minimal Weighted Clones with Boolean Support  Link to Minimal Weighted Clones with Boolean Support

[2]
Tractable Classes of Binary CSPs Defined by Excluded Topological Minors
David A. Cohen‚ Martin C. Cooper‚ Peter Jeavons and Stanislav Živný
In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI'15). Pages 1945–1951. AAAI Press. 2015.
Details about Tractable Classes of Binary CSPs Defined by Excluded Topological Minors  BibTeX data for Tractable Classes of Binary CSPs Defined by Excluded Topological Minors  Download (pdf) of Tractable Classes of Binary CSPs Defined by Excluded Topological Minors

[3]
Binarisation via dualisation for valued constraints
David A. Cohen‚ Martin C. Cooper‚ Peter Jeavons and Stanislav Živný
In Proceedings of the Twenty−Ninth AAAI Conference on Artificial Intelligence. Pages 3731–3737. AAAI Press. 2015.
Details about Binarisation via dualisation for valued constraints  BibTeX data for Binarisation via dualisation for valued constraints  Link to Binarisation via dualisation for valued constraints

[4]
Representing and Solving Finite−Domain Constraint Problems using Systems of Polynomials (Extended Abstract)
Chris Jefferson‚ Peter Jeavons‚ Martin J. Green and M.R.C. van Dongen
In Principles and Practice of Constraint Programming − Proceedings of CP2015. 2015.
Details about Representing and Solving Finite−Domain Constraint Problems using Systems of Polynomials (Extended Abstract)  BibTeX data for Representing and Solving Finite−Domain Constraint Problems using Systems of Polynomials (Extended Abstract)  Download (pdf) of Representing and Solving Finite−Domain Constraint Problems using Systems of Polynomials (Extended Abstract)

[5]
The complexity of valued constraint satisfaction
Peter Jeavons‚ Andrei Krokhin and Stanislav Živný
In Bulletin of the European Association for Theoretical Computer Science (EATCS). Vol. 113. Pages 21−55. 2014.
Errata can be found here.
Details about The complexity of valued constraint satisfaction  BibTeX data for The complexity of valued constraint satisfaction  Link to The complexity of valued constraint satisfaction

[6]
An algebraic theory of complexity for discrete optimisation
David A. Cohen‚ Martin C. Cooper‚ Páidí Creed‚ Peter Jeavons and Stanislav Živný
In SIAM Journal on Computing. Vol. 42. No. 5. Pages 1915−1939. 2013.
Details about An algebraic theory of complexity for discrete optimisation  BibTeX data for An algebraic theory of complexity for discrete optimisation  DOI (10.1137/130906398)  Download (pdf) of An algebraic theory of complexity for discrete optimisation

[7]
Representing and solving finite−domain constraint problems using systems of polynomials
Christopher Jefferson‚ Peter Jeavons‚ Martin J. Green and Marc R. C. van Dongen
In Annals of Mathematics and Artificial Intelligence. Vol. 67. No. 3−4. Pages 359−382. 2013.
Details about Representing and solving finite−domain constraint problems using systems of polynomials  BibTeX data for Representing and solving finite−domain constraint problems using systems of polynomials  DOI (10.1007/s1047201393657)  Link to Representing and solving finite−domain constraint problems using systems of polynomials

[8]
Lifting Structural Tractability to CSP with Global Constraints
Evgenĳ Thorstensen
In Christian Schulte, editor, Principles and Practice of Constraint Programming. Vol. 8124 of Lecture Notes in Computer Science. Pages 661−677. Springer. 2013.
Details about Lifting Structural Tractability to CSP with Global Constraints  BibTeX data for Lifting Structural Tractability to CSP with Global Constraints  DOI (10.1007/9783642406270_49)

[9]
Tractable Combinations of Global Constraints
David A. Cohen‚ Peter G. Jeavons‚ Evgenĳ Thorstensen and Stanislav Živný
In Christian Schulte, editor, Principles and Practice of Constraint Programming − 19th International Conference‚ CP 2013‚ Uppsala‚ Sweden‚ September 16−20‚ 2013. Proceedings. Vol. 8124 of Lecture Notes in Computer Science. Pages 230−246. Springer. 2013.
Details about Tractable Combinations of Global Constraints  BibTeX data for Tractable Combinations of Global Constraints  DOI (10.1007/9783642406270_20)  Download (pdf) of Tractable Combinations of Global Constraints

[10]
Tractable valued constraints
Peter G. Jeavons and Stanislav Živný
In Lucas Bordeaux‚ Youssef Hamadi‚ Pushmeet Kohli and Robert Mateescu, editors, Tractability: Practical Approaches to Hard Problems. Cambridge University Press. 2012.
This work is in copyright. The draft is for personal use only. No further distribution without permission.
Details about Tractable valued constraints  BibTeX data for Tractable valued constraints  Download (pdf) of Tractable valued constraints

[11]
Local Consistency and SAT−Solvers
Peter Jeavons and Justyna Petke
In Journal of Artificial Intelligence Research (JAIR). Vol. 43. Pages 329−351. 2012.
Details about Local Consistency and SAT−Solvers  BibTeX data for Local Consistency and SAT−Solvers  DOI (10.1613/jair.3531)  Link to Local Consistency and SAT−Solvers

[12]
Tractable triangles and cross−free convexity in discrete optimisation
Martin C. Cooper and Stanislav Živný
In Journal of Artificial Intelligence Research. Vol. 44. Pages 455–490. 2012.
Details about Tractable triangles and cross−free convexity in discrete optimisation  BibTeX data for Tractable triangles and cross−free convexity in discrete optimisation  DOI (10.1613/jair.3598)  Download (pdf) of Tractable triangles and cross−free convexity in discrete optimisation

[13]
The complexity of conservative valued CSPs
Vladimir Kolmogorov and Stanislav Živný
In Proceedings of the 23rd ACM−SIAM Symposium on Discrete Algorithms (SODA'12). Pages 750–759. 2012.
Preprint: http://zivny.cz/publications/kz12soda−preprint.pdf
Details about The complexity of conservative valued CSPs  BibTeX data for The complexity of conservative valued CSPs  Link to The complexity of conservative valued CSPs

[14]
The power of linear programming for valued CSPs
Johan Thapper and Stanislav Živný
2012.
arXiv:1204.1079
Details about The power of linear programming for valued CSPs  BibTeX data for The power of linear programming for valued CSPs  Link to The power of linear programming for valued CSPs

[15]
Hybrid tractability of valued constraint problems
Martin C. Cooper and Stanislav Živný
In Artificial Intelligence. Vol. 175. No. 9−10. Pages 1555–1569. June, 2011.
Details about Hybrid tractability of valued constraint problems  BibTeX data for Hybrid tractability of valued constraint problems  DOI (10.1016/j.artint.2011.02.003)  Download (pdf) of Hybrid tractability of valued constraint problems

[16]
On minimal weighted clones
Páidí Creed and Stanislav Živný
In Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP'11). Vol. 6876 of Lecture Notes in Computer Science. Pages 210–224. Springer. 2011.
Details about On minimal weighted clones  BibTeX data for On minimal weighted clones  DOI (10.1007/9783642237867_18)  Link to On minimal weighted clones

[17]
Hierarchically nested convex VCSP
Martin C. Cooper and Stanislav Živný
In Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP'11). Vol. 6876 of Lecture Notes in Computer Science. Pages 187–194. Springer. 2011.
Details about Hierarchically nested convex VCSP  BibTeX data for Hierarchically nested convex VCSP  DOI (10.1007/9783642237867_16)  Download (pdf) of Hierarchically nested convex VCSP

[18]
Tractable triangles
Martin C. Cooper and Stanislav Živný
In Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming (CP'11). Vol. 6876 of Lecture Notes in Computer Science. Pages 195–209. Springer. 2011.
Details about Tractable triangles  BibTeX data for Tractable triangles  DOI (10.1007/9783642237867_17)  Link to Tractable triangles

[19]
On Minimal Constraint Networks
Georg Gottlob
In Proceedings of the 17th International Conference on Principles and Practice of Constraint Programming‚ CP 2011. Perugia‚ Italy. 2011.
Details about On Minimal Constraint Networks  BibTeX data for On Minimal Constraint Networks  Download (pdf) of On Minimal Constraint Networks

[20]
An algebraic theory of complexity for valued constraints: Establishing a Galois connection
David A. Cohen‚ Páidí Creed‚ Peter G. Jeavons and Stanislav Živný
In Proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science (MFCS'11). Vol. 6907 of Lecture Notes in Computer Science. Pages 231–242. Springer. 2011.
Details about An algebraic theory of complexity for valued constraints: Establishing a Galois connection  BibTeX data for An algebraic theory of complexity for valued constraints: Establishing a Galois connection  DOI (10.1007/9783642229930_23)  Download (pdf) of An algebraic theory of complexity for valued constraints: Establishing a Galois connection

[21]
Tackling the Partner Units Configuration Problem
Markus Aschinger‚ Conrad Drescher‚ Georg Gottlob‚ Peter Jeavons and Evgenĳ Thorstensen
In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011). Barcelona‚ Spain. 2011.
Details about Tackling the Partner Units Configuration Problem  BibTeX data for Tackling the Partner Units Configuration Problem  Download (pdf) of Tackling the Partner Units Configuration Problem

[22]
Optimization Methods for the Partner Units Problem
Markus Aschinger‚ Conrad Drescher‚ Gerhard Friedrich‚ Georg Gottlob‚ Peter Jeavons‚ Anna Ryabokon and Evgenĳ Thorstensen
In Proceedings of the 8th International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2011). Berlin‚ Germany. 2011.
Details about Optimization Methods for the Partner Units Problem  BibTeX data for Optimization Methods for the Partner Units Problem  Download (pdf) of Optimization Methods for the Partner Units Problem

[23]
The order encoding: from tractable CSP to tractable SAT
Justyna Petke and Peter Jeavons
No. RR−11−04. DCS‚ University of Oxford. 2011.
Details about The order encoding: from tractable CSP to tractable SAT  BibTeX data for The order encoding: from tractable CSP to tractable SAT  Download (pdf) of The order encoding: from tractable CSP to tractable SAT

[24]
Structural Decomposition Methods‚ and What They are Good For
Markus Aschinger‚ Conrad Drescher‚ Georg Gottlob‚ Peter Jeavons and Evgenĳ Thorstensen
2011.
Invited Paper at STACS 2011
Details about Structural Decomposition Methods‚ and What They are Good For  BibTeX data for Structural Decomposition Methods‚ and What They are Good For  Download (pdf) of Structural Decomposition Methods‚ and What They are Good For

[25]
An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection
David A. Cohen‚ Paidi Creed‚ Peter G. Jeavons and Stanislav Zivny
No. RR−10−16. OUCL. November, 2010.
Details about An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection  BibTeX data for An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection  Download (pdf) of An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection

[26]
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
Martin C. Cooper‚ Peter G. Jeavons and András Z. Salamon
In Artif. Intell.. Vol. 174. No. 9−10. Pages 570−584. 2010.
Details about Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination  BibTeX data for Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination  DOI (10.1016/j.artint.2010.03.002)

[27]
Classes of submodular constraints expressible by graph cuts
Stanislav Živný and Peter G. Jeavons
In Constraints. Vol. 15. No. 3. Pages 430−452. 2010.
Details about Classes of submodular constraints expressible by graph cuts  BibTeX data for Classes of submodular constraints expressible by graph cuts  DOI (10.1007/s106010099078z)  Download (pdf) of Classes of submodular constraints expressible by graph cuts

[28]
A new hybrid tractable class of soft constraint problems
Martin C. Cooper and Stanislav Živný
In Proceedings of the 16th International Conference on Principles and Practice of Constraint Programming (CP'10). Vol. 6308 of Lecture Notes in Computer Science. 2010.
Details about A new hybrid tractable class of soft constraint problems  BibTeX data for A new hybrid tractable class of soft constraint problems  DOI (10.1007/9783642153969_15)  Download (pdf) of A new hybrid tractable class of soft constraint problems

[29]
Local consistency and SAT−solvers
Peter Jeavons and Justyna Petke
In Proceedings of the 16th International Conference on Principles and Practice of Constraint Programming − CP 2010. Vol. 6308 of Lecture Notes in Computer Science. Pages 398−413. Springer. 2010.
Details about Local consistency and SAT−solvers  BibTeX data for Local consistency and SAT−solvers  Download (pdf) of Local consistency and SAT−solvers  DOI (10.1007/9783642153969_33)

[30]
Tackling the Partner Units Configuration Problem
Markus Aschinger‚ Conrad Drescher‚ Gerhard Friedrich‚ Georg Gottlob‚ Peter Jeavons‚ Anna Ryabokon and Evgenĳ Thorstensen
No. CS−RR−10−28. Computing Laboratory‚ University of Oxford. 2010.
Details about Tackling the Partner Units Configuration Problem  BibTeX data for Tackling the Partner Units Configuration Problem  Download (pdf) of Tackling the Partner Units Configuration Problem

[31]
Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms
Vladimir Kolmogorov and Stanislav Živný
2010.
arXiv:1008.3104
Details about Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms  BibTeX data for Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms  Link to Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms

[32]
Hybrid tractability of soft constraint problems
Martin C. Cooper and Stanislav Živný
2010.
arXiv:1008.4071
Details about Hybrid tractability of soft constraint problems  BibTeX data for Hybrid tractability of soft constraint problems  Link to Hybrid tractability of soft constraint problems

[33]
The complexity of conservative finite−valued CSPs
Vladimir Kolmogorov and Stanislav Živný
2010.
arXiv:1008.1555
Details about The complexity of conservative finite−valued CSPs  BibTeX data for The complexity of conservative finite−valued CSPs  Link to The complexity of conservative finite−valued CSPs

[34]
Structural properties of oracle classes
Stanislav Živný
In Information Processing Letters. Vol. 109. No. 19. Pages 1131–1135. 2009.
Details about Structural properties of oracle classes  BibTeX data for Structural properties of oracle classes  DOI (10.1016/j.ipl.2009.07.009)  Download (pdf) of Structural properties of oracle classes

[35]
The complexity of constraint satisfaction games and QCSP
Ferdinand Börner‚ Andrei A. Bulatov‚ Hubie Chen‚ Peter Jeavons and Andrei A. Krokhin
In Inf. Comput.. Vol. 207. No. 9. Pages 923−944. 2009.
Details about The complexity of constraint satisfaction games and QCSP  BibTeX data for The complexity of constraint satisfaction games and QCSP  DOI (10.1016/j.ic.2009.05.003)

[36]
The expressive power of binary submodular functions
Stanislav Živný‚ David A. Cohen and Peter G. Jeavons
In Discrete Applied Mathematics. Vol. 157. No. 15. Pages 3347–3358. 2009.
Details about The expressive power of binary submodular functions  BibTeX data for The expressive power of binary submodular functions  DOI (10.1016/j.dam.2009.07.001)  Download (pdf) of The expressive power of binary submodular functions

[37]
A note on some collapse results of valued constraints
Bruno Zanuttini and Stanislav Živný
In Information Processing Letters. Vol. 109. No. 11. Pages 534–538. 2009.
Details about A note on some collapse results of valued constraints  BibTeX data for A note on some collapse results of valued constraints  DOI (10.1016/j.ipl.2009.01.018)  Download (pdf) of A note on some collapse results of valued constraints

[38]
Presenting Constraints
Peter Jeavons
In Martin Giese and Arild Waaler, editors, TABLEAUX. Vol. 5607 of Lecture Notes in Computer Science. Pages 1−15. Springer. 2009.
Details about Presenting Constraints  BibTeX data for Presenting Constraints  DOI (10.1007/9783642027161_1)

[39]
The complexity of valued constraint models
Stanislav Živný and Peter G. Jeavons
In Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming (CP'09). No. 5732. 2009.
Details about The complexity of valued constraint models  BibTeX data for The complexity of valued constraint models  DOI (10.1007/9783642042447_64)  Download (pdf) of The complexity of valued constraint models

[40]
Same−relation constraints
Christopher Jefferson‚ Serdar Kadioglu‚ Karen E. Petrie‚ Meinolf Sellmann and Stanislav Živný
In Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming (CP'09). No. 5732. 2009.
Details about Same−relation constraints  BibTeX data for Same−relation constraints  DOI (10.1007/9783642042447_38)  Download (pdf) of Same−relation constraints

[41]
Tractable Benchmarks For Constraint Programming
Justyna Petke and Peter Jeavons
No. RR−09−07. OUCL. 2009.
Details about Tractable Benchmarks For Constraint Programming  BibTeX data for Tractable Benchmarks For Constraint Programming  Download (pdf) of Tractable Benchmarks For Constraint Programming

[42]
Which submodular functions are expressible using binary submodular functions?
Stanislav Živný and Peter G. Jeavons
No. RR−08−08. OUCL. Oxford‚ UK. June, 2008.
Details about Which submodular functions are expressible using binary submodular functions?  BibTeX data for Which submodular functions are expressible using binary submodular functions?  Download (pdf) of Which submodular functions are expressible using binary submodular functions?  Download (pdf) of Which submodular functions are expressible using binary submodular functions?

[43]
Domain permutation reduction for constraint satisfaction problems
Martin J. Green and David A. Cohen
In Artificial Intelligence. Vol. 172. No. 8−9. Pages 1094−1118. 2008.
Details about Domain permutation reduction for constraint satisfaction problems  BibTeX data for Domain permutation reduction for constraint satisfaction problems  DOI (10.1016/j.artint.2007.12.001)

[44]
The expressive power of valued constraints: Hierarchies and collapses
David A. Cohen‚ Peter G. Jeavons and Stanislav Živný
In Theoretical Computer Science. Vol. 409. No. 1. Pages 137–153. 2008.
Details about The expressive power of valued constraints: Hierarchies and collapses  BibTeX data for The expressive power of valued constraints: Hierarchies and collapses  DOI (10.1016/j.tcs.2008.08.036)  Download (pdf) of The expressive power of valued constraints: Hierarchies and collapses

[45]
Generalising submodularity and Horn clauses: tractable optimization problems defined by tournament pair multimorphisms
David Cohen‚ Martin Cooper and Peter Jeavons
In Theoretical Computer Science. Vol. 401. No. 1−3. Pages 36−51. 2008.
Details about Generalising submodularity and Horn clauses: tractable optimization problems defined by tournament pair multimorphisms  BibTeX data for Generalising submodularity and Horn clauses: tractable optimization problems defined by tournament pair multimorphisms  DOI (doi:10.1016/j.tcs.2008.03.015)

[46]
A unified theory of structural tractability for constraint satisfaction problems
David Cohen‚ Peter Jeavons and Marc Gyssens
In Journal of Computer and System Sciences. Vol. 74. Pages 721−743. 2008.
Earlier‚ uncorrected‚ version appears in Proceedings of IJCAI'05‚ pp. 72–77: http://www.ijcai.org/papers/0521.pdf
Details about A unified theory of structural tractability for constraint satisfaction problems  BibTeX data for A unified theory of structural tractability for constraint satisfaction problems  DOI (10.1016/j.jcss.2007.08.001)  Download (pdf) of A unified theory of structural tractability for constraint satisfaction problems

[47]
Perfect Constraints Are Tractable
András Z. Salamon and Peter G. Jeavons
In Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming‚ CP 2008‚ Sydney‚ Australia‚ 14–18 September. Vol. 5202 of Lecture Notes in Computer Science. Pages 524−528. Springer. 2008.
Details about Perfect Constraints Are Tractable  BibTeX data for Perfect Constraints Are Tractable  DOI (10.1007/9783540859581_35)  Download (pdf) of Perfect Constraints Are Tractable

[48]
Hybrid tractable CSPs which generalize tree structure
Martin C. Cooper‚ Peter G. Jeavons and András Z. Salamon
In Nikos Avouris Malik Ghallab Constantine D. Spyropoulos Nikos Fakotakis, editor, ECAI 2008‚ Proceedings of the 18th European Conference on Artificial Intelligence‚ July 21–25‚ Patras‚ Greece. Vol. 178 of Frontiers in Artificial Intelligence and Applications. Pages 530–534. IOS Press. 2008.
Best paper award.
Details about Hybrid tractable CSPs which generalize tree structure  BibTeX data for Hybrid tractable CSPs which generalize tree structure  Download (pdf) of Hybrid tractable CSPs which generalize tree structure

[49]
Classes of submodular constraints expressible by graph cuts
Stanislav Živný and Peter G. Jeavons
In Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming (CP'08). Vol. 5202 of Lecture Notes in Computer Science. Pages 112−127. 2008.
Details about Classes of submodular constraints expressible by graph cuts  BibTeX data for Classes of submodular constraints expressible by graph cuts  DOI (10.1007/9783540859581_8)  Download (pdf) of Classes of submodular constraints expressible by graph cuts

[50]
The Expressive Power of Binary Submodular Functions
Stanislav Živný‚ David A. Cohen and Peter G. Jeavons
2008.
arXiv:0811.1885 [cs.DM]
Details about The Expressive Power of Binary Submodular Functions  BibTeX data for The Expressive Power of Binary Submodular Functions  Link to The Expressive Power of Binary Submodular Functions

[51]
The expressive power of valued constraints: hierarchies and collapses
David A. Cohen‚ Peter G. Jeavons and Stanislav Živný
No. RR−07−03. Computing Laboratory‚ University of Oxford. Oxford‚ UK. April, 2007.
Details about The expressive power of valued constraints: hierarchies and collapses  BibTeX data for The expressive power of valued constraints: hierarchies and collapses  Download (pdf) of The expressive power of valued constraints: hierarchies and collapses  Link to The expressive power of valued constraints: hierarchies and collapses

[52]
Representing and Solving Finite−Domain Constraint Problems Using Systems of Polynomials
Chris Jefferson‚ Peter Jeavons‚ Martin J. Green and M.R.C. van Dongen
No. RR−07−07. Oxford University Computing Laboratory. October, 2007.
Details about Representing and Solving Finite−Domain Constraint Problems Using Systems of Polynomials  BibTeX data for Representing and Solving Finite−Domain Constraint Problems Using Systems of Polynomials  Download (pdf) of Representing and Solving Finite−Domain Constraint Problems Using Systems of Polynomials

[53]
Conditional Constraint Satisfaction: Logical Foundations and Complexity
Georg Gottlob‚ Gianluigi Greco and Toni Mancini
In Manuela M. Veloso, editor, IJCAI 2007‚ Proceedings of the 20th International Joint Conference on Artificial Intelligence‚ Hyderabad‚ India‚ January 6−12‚ 2007. Pages 88−93. 2007.
Details about Conditional Constraint Satisfaction: Logical Foundations and Complexity  BibTeX data for Conditional Constraint Satisfaction: Logical Foundations and Complexity  Download (pdf) of Conditional Constraint Satisfaction: Logical Foundations and Complexity

[54]
The expressive power of valued constraints: Hierarchies and collapses
David A. Cohen‚ Peter G. Jeavons and Stanislav Živný
In Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming (CP'07). Vol. 4741 of Lecture Notes in Computer Science. Pages 798−805. 2007.
Details about The expressive power of valued constraints: Hierarchies and collapses  BibTeX data for The expressive power of valued constraints: Hierarchies and collapses  DOI (10.1007/9783540749707_57)  Download (pdf) of The expressive power of valued constraints: Hierarchies and collapses

[55]
Generalising Submodularity and Horn Clauses: Tractable optimization problems defined by tournament pair multimorphisms
Peter Jeavons‚ Martin C Cooper and David A Cohen
No. RR−06−06. Oxford University Computing Laboratory. December, 2006.
Details about Generalising Submodularity and Horn Clauses: Tractable optimization problems defined by tournament pair multimorphisms  BibTeX data for Generalising Submodularity and Horn Clauses: Tractable optimization problems defined by tournament pair multimorphisms  Download (pdf) of Generalising Submodularity and Horn Clauses: Tractable optimization problems defined by tournament pair multimorphisms

[56]
The complexity of constraint languages
David Cohen and Peter Jeavons
In Handbook of Constraint Programming. Chapter 8. Elsevier. 2006.
Details about The complexity of constraint languages  BibTeX data for The complexity of constraint languages  Download (pdf) of The complexity of constraint languages

[57]
Symmetry definitions for constraint satisfaction problems
David Cohen‚ Peter Jeavons‚ Christopher Jefferson‚ Karen Petrie and Barbara Smith
In Constraints. Vol. 11. Pages 115−137. 2006.
Received a Best Paper award.
Details about Symmetry definitions for constraint satisfaction problems  BibTeX data for Symmetry definitions for constraint satisfaction problems  DOI (10.1007/s1060100680598)  Download (pdf) of Symmetry definitions for constraint satisfaction problems

[58]
The complexity of soft constraint satisfaction
David Cohen‚ Martin Cooper‚ Peter Jeavons and Andrei Krokhin
In Artificial Intelligence. Vol. 170. Pages 983−1016. 2006.
Details about The complexity of soft constraint satisfaction  BibTeX data for The complexity of soft constraint satisfaction  DOI (10.1016/j.artint.2006.04.002)  Download (pdf) of The complexity of soft constraint satisfaction

[59]
Typed Guarded Decompositions for Constraint Satisfaction
David A. Cohen and Martin J. Green
In Proceedings of the 12th International Conference on Principles and Practice of Constraint Programming (CP'06). Vol. 4204 of Lecture Notes in Computer Science. Pages 122−136. 2006.
Details about Typed Guarded Decompositions for Constraint Satisfaction  BibTeX data for Typed Guarded Decompositions for Constraint Satisfaction  DOI (10.1007/11889205_11)

[60]
The Effect of Constraint Representation on Structural Tractability
Chris Houghton‚ David A. Cohen and Martin J. Green
In Proceedings of the 12th International Conference on Principles and Practice of Constraint Programming (CP'06). Vol. 4204 of Lecture Notes in Computer Science. Pages 726−730. 2006.
Details about The Effect of Constraint Representation on Structural Tractability  BibTeX data for The Effect of Constraint Representation on Structural Tractability  DOI (10.1007/11889205_59)

[61]
An algebraic characterisation of complexity for valued constraints
David Cohen‚ Martin Cooper and Peter Jeavons
In Proceedings of the 12th International Conference on Principles and Practice of Contraint Programming (CP'06). Vol. 4204 of Lecture Notes in Computer Science. Pages 107−121. 2006.
Details about An algebraic characterisation of complexity for valued constraints  BibTeX data for An algebraic characterisation of complexity for valued constraints  DOI (10.1007/11889205_10)  Download (pdf) of An algebraic characterisation of complexity for valued constraints

[62]
Supermodular functions and the complexity of MAX CSP
David Cohen‚ Martin Cooper‚ Peter Jeavons and Andrei Krokhin
In Discrete Applied Mathematics. Vol. 149. Pages 53−72. 2005.
Earlier version appeared as Identifying efficiently solvable cases of Max CSP http://web.comlab.ox.ac.uk/oucl/research/areas/constraints/publications/STACS04maxCSP.ps in: Proceedings of STACS'04‚ Lecture Notes in Computer Science 2996 (2004)
Details about Supermodular functions and the complexity of MAX CSP  BibTeX data for Supermodular functions and the complexity of MAX CSP  DOI (10.1016/j.dam.2005.03.003)  Download (pdf) of Supermodular functions and the complexity of MAX CSP

[63]
Classifying the complexity of constraints using finite algebras
Andrei Bulatov‚ Peter Jeavons and Andrei Krokhin
In SIAM Journal on Computing. No. 34. Pages 720−742. 2005.
Details about Classifying the complexity of constraints using finite algebras  BibTeX data for Classifying the complexity of constraints using finite algebras  DOI (10.1137/S0097539700376676)  Download (pdf) of Classifying the complexity of constraints using finite algebras

[64]
Solution Equivalent Subquadrangle Reformulations of Constraint Satisfaction Problems
Chris Houghton and David A. Cohen
In Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming (CP'05). Vol. 3709 of Lecture Notes in Computer Science. Pages 851. 2005.
Details about Solution Equivalent Subquadrangle Reformulations of Constraint Satisfaction Problems  BibTeX data for Solution Equivalent Subquadrangle Reformulations of Constraint Satisfaction Problems  DOI (10.1007/11564751_89)

[65]
The Complexity of Constraint Satisfaction: An Algebraic Approach
Andrei Krokhin‚ Andrei Bulatov and Peter Jeavons
No. RR−04−08. Oxford University Computing Laboratory. May, 2004.
Details about The Complexity of Constraint Satisfaction: An Algebraic Approach  BibTeX data for The Complexity of Constraint Satisfaction: An Algebraic Approach  Download (pdf) of The Complexity of Constraint Satisfaction: An Algebraic Approach

[66]
Supermodular Functions and the Complexity of MAX CSP
David Cohen‚ Martin Cooper‚ Peter Jeavons and Andrei Krokhin
No. RR−04−01. Oxford University Computing Laboratory. January, 2004.
Details about Supermodular Functions and the Complexity of MAX CSP  BibTeX data for Supermodular Functions and the Complexity of MAX CSP  Download (ps) of Supermodular Functions and the Complexity of MAX CSP

[67]
Tractable Decision for a Constraint Language Implies Tractable Search
David A. Cohen
In Constraints. Vol. 9. No. 3. Pages 219–229. 2004.
Details about Tractable Decision for a Constraint Language Implies Tractable Search  BibTeX data for Tractable Decision for a Constraint Language Implies Tractable Search  Link to Tractable Decision for a Constraint Language Implies Tractable Search

[68]
Implementing a test for tractability
Richard Gault and Peter Jeavons
In Constraints. Vol. 9. Pages 139–160. 2004.
Details about Implementing a test for tractability  BibTeX data for Implementing a test for tractability  Link to Implementing a test for tractability

[69]
A maximal tractable class of soft constraints
David Cohen‚ Martin Cooper‚ Peter Jeavons and Andrei Krokhin
In Journal of Artificial Intelligence Research. No. 22. Pages 01/01/22. 2004.
Earlier version appeared in: Proceedings of IJCAI'03‚ pp. 209−214: http://www.comlab.ox.ac.uk/activities/constraints/publications/IJCAI03submodular.pdf
Details about A maximal tractable class of soft constraints  BibTeX data for A maximal tractable class of soft constraints  Link to A maximal tractable class of soft constraints

[70]
Constraint satisfaction problems on intervals and lengths
Andrei Krokhin‚ Peter Jeavons and Peter Jonsson
In SIAM Journal on Discrete Mathematics. No. 17. Pages 453–477. 2004.
Earlier version appears in Proceedings of STACS'02‚ Lecture Notes in Computer Science‚ 2285‚ (2002)‚ pp. 443–454: http://link.springer.de/link/service/series/0558/bibs/2285/22850443.htm Preprint version available from Electronic Colloquium on Computational Complexity‚ as Report TR01−077: http://eccc.hpiweb.de/report/2001/077/
Details about Constraint satisfaction problems on intervals and lengths  BibTeX data for Constraint satisfaction problems on intervals and lengths  Link to Constraint satisfaction problems on intervals and lengths

[71]
A Graph of a Relational Structure and Constraint Satisfaction Problems
Andrei A. Bulatov
In Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS'04). Pages 448−45. 2004.
Details about A Graph of a Relational Structure and Constraint Satisfaction Problems  BibTeX data for A Graph of a Relational Structure and Constraint Satisfaction Problems  Link to A Graph of a Relational Structure and Constraint Satisfaction Problems

[72]
The complexity of partition functions
Andrei A. Bulatov and Martin Grohe
In Proceedings of the 31st International Colloquium on Automata‚ Languages and Programming (ICALP'04). Vol. 3142 of Lecture Notes in Computer Science. Pages 294−306. 2004.
Details about The complexity of partition functions  BibTeX data for The complexity of partition functions  Link to The complexity of partition functions

[73]
A complete characterization of complexity for Boolean constraint optimization problems
David Cohen‚ Martin Cooper and Peter Jeavons
In Proceedings of CP'04. No. 3258. Pages 212–226. 2004.
Details about A complete characterization of complexity for Boolean constraint optimization problems  BibTeX data for A complete characterization of complexity for Boolean constraint optimization problems  Link to A complete characterization of complexity for Boolean constraint optimization problems

[74]
Learnability of quantified formulas
Victor Dalmau and Peter Jeavons
In Theoretical Computer Science. No. 306. Pages 485–511. 2003.
Earlier version appeared in Proceedings of EuroCOLT 99‚ Nordkirchen‚ Germany‚ (1999)‚ pp. 63−78 : http://link.springer.de/link/service/series/0558/bibs/1572/15720063.htm
Details about Learnability of quantified formulas  BibTeX data for Learnability of quantified formulas  Link to Learnability of quantified formulas

[75]
Reasoning about temporal relations : the tractable subalgebras of Allen's interval algebra
Andrei Krokhin‚ Peter Jeavons and Peter Jonsson
In Journal of the ACM. No. 50. Pages 591–640. 2003.
Earlier version available as an OUCL Research Report : http://web.comlab.ox.ac.uk/oucl/publications/tr/rr0112.html
Details about Reasoning about temporal relations : the tractable subalgebras of Allen's interval algebra  BibTeX data for Reasoning about temporal relations : the tractable subalgebras of Allen's interval algebra  DOI (10.1145/876638.876639)

[76]
Tractability by Approximating Constraint Languages
Martin J. Green and David A. Cohen
In Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming (CP'03). Vol. 2833 of Lecture Notes in Computer Science. 2003.
Details about Tractability by Approximating Constraint Languages  BibTeX data for Tractability by Approximating Constraint Languages  Link to Tractability by Approximating Constraint Languages

[77]
A New Classs of Binary CSPs for which Arc−Constistency Is a Decision Procedure
David A. Cohen
In Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming (CP'03). Vol. 2833 of Lecture Notes in Computer Science. Pages 807−811. 2003.
Details about A New Classs of Binary CSPs for which Arc−Constistency Is a Decision Procedure  BibTeX data for A New Classs of Binary CSPs for which Arc−Constistency Is a Decision Procedure  Link to A New Classs of Binary CSPs for which Arc−Constistency Is a Decision Procedure

[78]
Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem
Andrei A. Bulatov and Victor Dalmau
In Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS'03). 2003.
Details about Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem  BibTeX data for Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem  Link to Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem

[79]
New Tractable Classes From Old
David Cohen‚ Peter Jeavons and Richard Gault
No. 8. Pages 263–282. 2003.
Earlier version appears in Proceedings of CP2000‚ Lecture Notes In Computer Science‚ 1894‚ 2000‚ pp. 160–171 : http://link.springer.de/link/service/series/0558/bibs/1894/18940160.htm
Details about New Tractable Classes From Old  BibTeX data for New Tractable Classes From Old  DOI (10.1023/A:1025623111033)

[80]
Structural Theory of Automata‚ Semigroups‚ and Universal Algebra
Andrei Krokhin‚ Andrei Bulatov and Peter Jeavons
In Proceedings of SMS−NATO ASI. Pages 181−213. University of Montreal. 2003.
Earlier version available as an OUCL Research Report: http://web.comlab.ox.ac.uk/oucl/publications/tr/rr0408.html
Details about Structural Theory of Automata‚ Semigroups‚ and Universal Algebra  BibTeX data for Structural Theory of Automata‚ Semigroups‚ and Universal Algebra  Link to Structural Theory of Automata‚ Semigroups‚ and Universal Algebra

[81]
Tractable conservative Constraint Satisfaction Problems
Andrei A. Bulatov
In Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS'03). 2003.
Details about Tractable conservative Constraint Satisfaction Problems  BibTeX data for Tractable conservative Constraint Satisfaction Problems  Link to Tractable conservative Constraint Satisfaction Problems

[82]
Amalgams of Constraint Satisfaction Problem
Andrei A. Bulatov and Evgeny S. Skvortsov
In Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI'03). Pages 197−202. 2003.
Details about Amalgams of Constraint Satisfaction Problem  BibTeX data for Amalgams of Constraint Satisfaction Problem

[83]
Soft constraints: complexity and multimorphsims
David Cohen‚ Martin Cooper‚ Peter Jeavons and Andrei Krokhin
In Proceedings of CP'03. No. 2833. Pages 244–258. 2003.
Details about Soft constraints: complexity and multimorphsims  BibTeX data for Soft constraints: complexity and multimorphsims  Download (pdf) of Soft constraints: complexity and multimorphsims

[84]
Quantified constraints: algorithms and complexity
Ferdinand Börner‚ Andrei Bulatov‚ Peter Jeavons and Andrei Krokhin
In Proceedings of CSL'03. No. 2803. Pages 58–70. 2003.
Longer version available as an OUCL Research Report: http://web.comlab.ox.ac.uk/oucl/publications/tr/rr0211.html
Details about Quantified constraints: algorithms and complexity  BibTeX data for Quantified constraints: algorithms and complexity  DOI (10.1007/b13224)  Download (pdf) of Quantified constraints: algorithms and complexity

[85]
Functions of multiple−valued logic and the complexity of constraint satisfaction: A short survey
Andrei Krokhin‚ Andrei Bulatov and Peter Jeavons
In Proceedings of 33rd IEEE International Symposium on Multiple−Valued Logic (ISMVL'03). Pages 343–351. 2003.
Details about Functions of multiple−valued logic and the complexity of constraint satisfaction: A short survey  BibTeX data for Functions of multiple−valued logic and the complexity of constraint satisfaction: A short survey  Link to Functions of multiple−valued logic and the complexity of constraint satisfaction: A short survey

[86]
An algebraic approach to multi−sorted constraints
Andrei Bulatov and Peter Jeavons
In Proceedings of CP'03. No. 2833. Pages 183–198. 2003.
Earlier version available as an OUCL Research Report : http://web.comlab.ox.ac.uk/oucl/publications/tr/rr0118.html
Details about An algebraic approach to multi−sorted constraints  BibTeX data for An algebraic approach to multi−sorted constraints  Download (pdf) of An algebraic approach to multi−sorted constraints

[87]
Finite semigroups imposing tractable constraints
Andrei Bulatov‚ Peter Jeavons and Mikhail Volkov
In Proceedings of the School on Algorithmic Aspects of the Theory of Semigroups and its Applications‚ Coimbra‚ Portugal‚ 2001. Pages 313–329. World Scientific‚ Singapore. 2002.
Details about Finite semigroups imposing tractable constraints  BibTeX data for Finite semigroups imposing tractable constraints

[88]
A Dichotomy Theorem for Constraints on a Three−Element Set
Andrei A. Bulatov
In Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS'02). 2002.
Details about A Dichotomy Theorem for Constraints on a Three−Element Set  BibTeX data for A Dichotomy Theorem for Constraints on a Three−Element Set  Link to A Dichotomy Theorem for Constraints on a Three−Element Set

[89]
The complexity of maximal constraint languages
Andrei Bulatov‚ Andrei Krokhin and Peter Jeavons
In Proceedings of STOC'01‚ Crete‚ Greece. Pages 667–674. 2001.
Earlier version available as an OUCL Research Report : http://web.comlab.ox.ac.uk/oucl/publications/tr/rr0103.html
Details about The complexity of maximal constraint languages  BibTeX data for The complexity of maximal constraint languages  DOI (10.1145/380752.380868)

[90]
A complete classification of complexity in Allen's algebra in the presence of a non−trivial basic relation
Andrei Krokhin‚ Peter Jeavons and Peter Jonsson
In Proceedings of IJCAI'01‚ Seattle‚ USA. Pages 83–88. 2001.
Longer version available as an OUCL Research Report : http://web.comlab.ox.ac.uk/oucl/publications/tr/rr0102.html
Details about A complete classification of complexity in Allen's algebra in the presence of a non−trivial basic relation  BibTeX data for A complete classification of complexity in Allen's algebra in the presence of a non−trivial basic relation

[91]
Algebraic structures in combinatorial problems
Andrei Bulatov and Peter Jeavons
No. MATH−AL−4−2001. Technische Universitat Dresden. 2001.
Details about Algebraic structures in combinatorial problems  BibTeX data for Algebraic structures in combinatorial problems  Link to Algebraic structures in combinatorial problems

[92]
Building tractable disjunctive constraints
David Cohen‚ Peter Jeavons‚ Peter Jonsson and Manolis Koubarakis
In Journal of the ACM. No. 47. Pages 826–853. 2000.
Details about Building tractable disjunctive constraints  BibTeX data for Building tractable disjunctive constraints  DOI (10.1145/355483.355485)  Link to Building tractable disjunctive constraints

[93]
Constraint satisfaction problems and finite algebras
Andrei Bulatov‚ Andrei Krokhin and Peter Jeavons
In Proceedings of ICALP'00. No. 1853. Pages 272–282. 2000.
Longer version available as an OUCL Technical Report : http://web.comlab.ox.ac.uk/oucl/publications/tr/tr499.html
Details about Constraint satisfaction problems and finite algebras  BibTeX data for Constraint satisfaction problems and finite algebras  DOI (10.1007/354045022X_24)  Link to Constraint satisfaction problems and finite algebras

[94]
Tractable constraints closed under a binary operation
Andrei Bulatov and Peter Jeavons
No. PRG−TR−12−00. Oxford University Computing Laboratory. 2000.
Details about Tractable constraints closed under a binary operation  BibTeX data for Tractable constraints closed under a binary operation  Link to Tractable constraints closed under a binary operation

[95]
How to determine the expressive power of constraints
P.G.Jeavons‚ D.A.Cohen and M.Gyssens
In Constraints. No. 4. Pages 113–131. 1999.
Details about How to determine the expressive power of constraints  BibTeX data for How to determine the expressive power of constraints  Link to How to determine the expressive power of constraints

[96]
Constraint Tractability Theory And Its Application to the Product Development Process for a Constraint−Based Scheduler
Lisa Purvis and Peter Jeavons
In Proceedings of the 1st International Conference on The Practical Application of Constraint Technologies and Logic Programming. Pages 63–79. 1999.
This paper was awarded First Prize in the Constraints Technologies area of PACLP'99
Details about Constraint Tractability Theory And Its Application to the Product Development Process for a Constraint−Based Scheduler  BibTeX data for Constraint Tractability Theory And Its Application to the Product Development Process for a Constraint−Based Scheduler  Link to Constraint Tractability Theory And Its Application to the Product Development Process for a Constraint−Based Scheduler

[97]
Towards High Order Constraint Representations for the Frequency Assignment Problem
N.W.Dunkin‚ J.E.Bater‚ P.G.Jeavons and D.A.Cohen
No. CSD−TR−98−05. Royal Holloway‚ University of London. June, 1998.
Details about Towards High Order Constraint Representations for the Frequency Assignment Problem  BibTeX data for Towards High Order Constraint Representations for the Frequency Assignment Problem  Link to Towards High Order Constraint Representations for the Frequency Assignment Problem

[98]
Are there optimal reuse distance constraints for FAPs with random Tx placements?
J.E.Bater‚ P.G.Jeavons and D.A.Cohen
No. CSD−TR−98−01. Royal Holloway‚ University of London. February, 1998.
Details about Are there optimal reuse distance constraints for FAPs with random Tx placements?  BibTeX data for Are there optimal reuse distance constraints for FAPs with random Tx placements?  Link to Are there optimal reuse distance constraints for FAPs with random Tx placements?

[99]
On The Algebraic Structure Of Combinatorial Problems
P.G.Jeavons
In Theoretical Computer Science. No. 200. Pages 185–204. 1998.
Details about On The Algebraic Structure Of Combinatorial Problems  BibTeX data for On The Algebraic Structure Of Combinatorial Problems  Link to On The Algebraic Structure Of Combinatorial Problems

[100]
Constraints‚ Consistency and Closure
P.G.Jeavons‚ D.A.Cohen and M.Cooper
In Artificial Intelligence. No. 101 (1−2). Pages 251–265. 1998.
Details about Constraints‚ Consistency and Closure  BibTeX data for Constraints‚ Consistency and Closure  Link to Constraints‚ Consistency and Closure

[101]
Constraints and Universal Algebra
P.G.Jeavons‚ D.A.Cohen and J.K.Pearson
In Annals of Mathematics and Artificial Intelligence. No. 24. Pages 51–67. 1998.
Details about Constraints and Universal Algebra  BibTeX data for Constraints and Universal Algebra  Link to Constraints and Universal Algebra

[102]
Why higher order constraints are necessary to model frequency assignment problems
P.G.Jeavons‚ N.W.Dunkin and J.E.Bater
In ECAI'98 Workshop on Non−binary constraints. 1998.
Details about Why higher order constraints are necessary to model frequency assignment problems  BibTeX data for Why higher order constraints are necessary to model frequency assignment problems  Link to Why higher order constraints are necessary to model frequency assignment problems

[103]
Constructing constraints
P.G.Jeavons
In Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming (CP98). Vol. 1520 of Lecture Notes in Computer Science. Pages 2−16. 1998.
Details about Constructing constraints  BibTeX data for Constructing constraints  DOI (10.1007/3540494812_2)  Link to Constructing constraints

[104]
A Survey of Tractable Constraint Satisfaction Problems
J.K.Pearson and P.G.Jeavons
No. CSD−TR−97−15. Royal Holloway‚ University of London. July, 1997.
Details about A Survey of Tractable Constraint Satisfaction Problems  BibTeX data for A Survey of Tractable Constraint Satisfaction Problems  Link to A Survey of Tractable Constraint Satisfaction Problems

[105]
Closure Properties of Constraints
P.G.Jeavons‚ D.A.Cohen and M.Gyssens
In Journal of the ACM. No. 44. Pages 527–548. 1997.
Details about Closure Properties of Constraints  BibTeX data for Closure Properties of Constraints  Link to Closure Properties of Constraints

[106]
Tractable Disjunctive Constraints
D.A.Cohen‚ P.G.Jeavons and M.Kourabarakis
In Proceedings 3rd International Conference on Principles and Practice of Constraint Programming (CP97). Vol. 1330 of Lecture Notes in Computer Science. No. 1330. Pages 478–490. 1997.
Details about Tractable Disjunctive Constraints  BibTeX data for Tractable Disjunctive Constraints  DOI (10.1007/BFb0017461)  Link to Tractable Disjunctive Constraints

[107]
Expressiveness of Binary Constraints for the Frequency Assignment Problem
N.W.Dunkin and P.G.Jeavons
In DIAL−M Workshop‚ 3rd Annual ACM/IEEE International Conference on Mobile Computing and Networking (MOBICOM'97). 1997.
Details about Expressiveness of Binary Constraints for the Frequency Assignment Problem  BibTeX data for Expressiveness of Binary Constraints for the Frequency Assignment Problem  Link to Expressiveness of Binary Constraints for the Frequency Assignment Problem

[108]
Derivation of Constraints and Database Relations
D.A.Cohen‚ M.Gyssens and P.G.Jeavons
In Proceedings of the 2nd International Conference on Principles and Practice of Constraint Programming (CP96). Vol. 1118 of Lecture Notes in Computer Science. Pages 134–148. 1996.
Details about Derivation of Constraints and Database Relations  BibTeX data for Derivation of Constraints and Database Relations  DOI (10.1007/3540615512_71)  Link to Derivation of Constraints and Database Relations

[109]
A Test for Tractability
P.G.Jeavons‚ D.A.Cohen and M.Gyssens
In Proceedings of the 2nd International Conference on Principles and Practice of Constraint Programming (CP96). Vol. 1118 of Lecture Notes in Computer Science. Pages 267−281. 1996.
Details about A Test for Tractability  BibTeX data for A Test for Tractability  DOI (10.1007/3540615512_80)  Link to A Test for Tractability

[110]
Tractable Constraints on Ordered Domains
P.G.Jeavons and M.C.Cooper
In Artificial Intelligence. No. 79(2). Pages 327–339. 1995.
Details about Tractable Constraints on Ordered Domains  BibTeX data for Tractable Constraints on Ordered Domains  Link to Tractable Constraints on Ordered Domains

[111]
A Unifying Framework for Tractable Constraints
P.G.Jeavons‚ D.A.Cohen and M.Gyssens
In Proceedings of the 1st International Conference on Principles and Practice of Constraint Programming (CP95). Vol. 976 of Lecture Notes in Computer Science. Pages 276−291. 1995.
Details about A Unifying Framework for Tractable Constraints  BibTeX data for A Unifying Framework for Tractable Constraints  DOI (10.1007/3540602992_17)  Link to A Unifying Framework for Tractable Constraints

[112]
A Substitution Operation for Constraints
P.G.Jeavons‚ D.A.Cohen and M.C.Cooper
In Proceedings of the 1st International Conference on Principles and Practice of Constraint Programming (CP95). Vol. 874 of Lecture Notes in Computer Science. Pages 161−177. 1995.
Details about A Substitution Operation for Constraints  BibTeX data for A Substitution Operation for Constraints  DOI (10.1007/3540586016_85)  Link to A Substitution Operation for Constraints

[113]
Recovering a Relation from a Decomposition using Constraint Satisfaction Techniques
P.G.Jeavons
In Information Sciences. No. 78. Pages 229–256. 1994.
Details about Recovering a Relation from a Decomposition using Constraint Satisfaction Techniques  BibTeX data for Recovering a Relation from a Decomposition using Constraint Satisfaction Techniques  Link to Recovering a Relation from a Decomposition using Constraint Satisfaction Techniques

[114]
A Structural Decomposition for Hypergraphs
P.G.Jeavons‚ D.A.Cohen and M.Gyssens
In Contemporary Mathematics. No. 178. Pages 161–177. 1994.
Details about A Structural Decomposition for Hypergraphs  BibTeX data for A Structural Decomposition for Hypergraphs  Link to A Structural Decomposition for Hypergraphs

[115]
Decomposing Constraint Satisfaction Problems Using Database Techniques
M.Gyssens‚ P.G.Jeavons and D.A.Cohen
In Artificial Intelligence. No. 66(1). Pages 57−89. 1994.
Details about Decomposing Constraint Satisfaction Problems Using Database Techniques  BibTeX data for Decomposing Constraint Satisfaction Problems Using Database Techniques  Link to Decomposing Constraint Satisfaction Problems Using Database Techniques

[116]
Characterising Tractable Constraints
M.C.Cooper‚ D.A.Cohen and P.G.Jeavons
In Artificial Intelligence. No. 65(2). Pages 347–361. 1994.
Details about Characterising Tractable Constraints  BibTeX data for Characterising Tractable Constraints  Link to Characterising Tractable Constraints