Constraints Group: Publications
|
[1] |
The complexity of conservative valued CSPs Vladimir Kolmogorov and Stanislav Živný In Proceedings of the 23rd Annual ACM−SIAM Symposium on Discrete Algorithms (SODA'12). 2012. |
|
[2] |
The order encoding: from tractable CSP to tractable SAT Justyna Petke and Peter Jeavons No. RR−11−04. DCS‚ University of Oxford. 2011. |
|
[3] |
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. |
|
[4] |
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. |
|
[5] |
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. |
|
[6] |
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. |
|
[7] |
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. |
|
[8] |
Tackling the Partner Units Configuration Problem Markus Aschinger‚ Conrad Drescher‚ Georg Gottlob‚ Peter Jeavons and Evgenij Thorstensen In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011). Barcelona‚ Spain. 2011. |
|
[9] |
Structural Decomposition Methods‚ and What They are Good For Markus Aschinger‚ Conrad Drescher‚ Georg Gottlob‚ Peter Jeavons and Evgenij Thorstensen 2011. Invited Paper at STACS 2011 |
|
[10] |
Optimization Methods for the Partner Units Problem Markus Aschinger‚ Conrad Drescher‚ Gerhard Friedrich‚ Georg Gottlob‚ Peter Jeavons‚ Anna Ryabokon and Evgenij 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. |
|
[11] |
Tackling the Partner Units Configuration Problem Markus Aschinger‚ Conrad Drescher‚ Gerhard Friedrich‚ Georg Gottlob‚ Peter Jeavons‚ Anna Ryabokon and Evgenij Thorstensen No. CS−RR−10−28. Computing Laboratory‚ University of Oxford. 2010. |
|
[12] |
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. |
|
[13] |
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. |
|
[14] |
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. |
|
[15] |
Generalising tractable VCSPs defined by symmetric tournament pair multimorphisms Vladimir Kolmogorov and Stanislav Živný 2010. arXiv:1008.3104 |
|
[16] |
Hybrid tractability of soft constraint problems Martin C. Cooper and Stanislav Živný 2010. arXiv:1008.4071 |
|
[17] |
The complexity of conservative finite−valued CSPs Vladimir Kolmogorov and Stanislav Živný 2010. arXiv:1008.1555 |
|
[18] |
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 | BibTeX | Download (pdf) | DOI (10.1007/978-3-642-15396-9_33) |
|
[19] |
Classes of submodular constraints expressible by graph cuts Stanislav Živný and Peter G. Jeavons In Constraints. Vol. 15. No. 3. Pages 430−452. 2010. |
|
[20] |
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. |
|
[21] |
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. |
|
[22] |
Tractable Benchmarks For Constraint Programming Justyna Petke and Peter Jeavons No. RR−09−07. OUCL. 2009. |
|
[23] |
Structural properties of oracle classes Stanislav Živný In Information Processing Letters. Vol. 109. No. 19. Pages 1131–1135. 2009. |
|
[24] |
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. |
|
[25] |
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. |
|
[26] |
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. |
|
[27] |
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. |
|
[28] |
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. |
|
[29] |
The Expressive Power of Binary Submodular Functions Stanislav Živný‚ David A. Cohen and Peter G. Jeavons 2008. arXiv:0811.1885 [cs.DM] |
|
[30] |
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. |
|
[31] |
Which submodular functions are expressible using binary submodular functions? Stanislav Živný and Peter G. Jeavons No. RR−08−08. OUCL. Oxford‚ UK. June, 2008. |
|
[32] |
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. |
|
[33] |
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. |
|
[34] |
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. |
|
[35] |
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. |
|
[36] |
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 |
|
[37] |
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. |
|
[38] |
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. |
|
[39] |
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. |
|
[40] |
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. |
|
[41] |
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. |
|
[42] |
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. |
|
[43] |
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. |
|
[44] |
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. |
|
[45] |
The complexity of constraint languages David Cohen and Peter Jeavons In Handbook of Constraint Programming. Chapter 8. Elsevier. 2006. |
|
[46] |
The complexity of soft constraint satisfaction David Cohen‚ Martin Cooper‚ Peter Jeavons and Andrei Krokhin In Artificial Intelligence. Vol. 170. Pages 983−1016. 2006. |
|
[47] |
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. |
|
[48] |
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) |
|
[49] |
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. |
|
[50] |
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. |
|
[51] |
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. |
|
[52] |
Tractable Decision for a Constraint Language Implies Tractable Search David A. Cohen In Constraints. Vol. 9. No. 3. Pages 219–229. 2004. |
|
[53] |
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. |
|
[54] |
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. |
|
[55] |
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. |
|
[56] |
Implementing a test for tractability Richard Gault and Peter Jeavons In Constraints. Vol. 9. Pages 139–160. 2004. |
|
[57] |
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 |
|
[58] |
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.hpi-web.de/report/2001/077/ |
|
[59] |
Tractable conservative Constraint Satisfaction Problems Andrei A. Bulatov In Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS'03). 2003. |
|
[60] |
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. |
|
[61] |
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. |
|
[62] |
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. |
|
[63] |
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. |
|
[64] |
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 |
|
[65] |
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 |
|
[66] |
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/rr-04-08.html |
|
[67] |
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. |
|
[68] |
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/rr-02-11.html |
|
[69] |
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. |
|
[70] |
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/rr-01-18.html |
|
[71] |
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/rr-01-12.html |
|
[72] |
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. |
|
[73] |
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. |
|
[74] |
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/rr-01-03.html |
|
[75] |
Algebraic structures in combinatorial problems Andrei Bulatov and Peter Jeavons No. MATH−AL−4−2001. Technische Universitat Dresden. 2001. |
|
[76] |
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/rr-01-02.html |
|
[77] |
Building tractable disjunctive constraints David Cohen‚ Peter Jeavons‚ Peter Jonsson and Manolis Koubarakis In Journal of the ACM. No. 47. Pages 826–853. 2000. |
|
[78] |
Tractable constraints closed under a binary operation Andrei Bulatov and Peter Jeavons No. PRG−TR−12−00. Oxford University Computing Laboratory. 2000. |
|
[79] |
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/tr-4-99.html |
|
[80] |
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. |
|
[81] |
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 |
|
[82] |
On The Algebraic Structure Of Combinatorial Problems P.G.Jeavons In Theoretical Computer Science. No. 200. Pages 185–204. 1998. |
|
[83] |
Constraints‚ Consistency and Closure P.G.Jeavons‚ D.A.Cohen and M.Cooper In Artificial Intelligence. No. 101 (1−2). Pages 251–265. 1998. |
|
[84] |
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. |
|
[85] |
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. |
|
[86] |
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. |
|
[87] |
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. |
|
[88] |
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. |
|
[89] |
Closure Properties of Constraints P.G.Jeavons‚ D.A.Cohen and M.Gyssens In Journal of the ACM. No. 44. Pages 527–548. 1997. |
|
[90] |
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. |
|
[91] |
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. |
|
[92] |
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. |
|
[93] |
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. |
|
[94] |
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. |
|
[95] |
Tractable Constraints on Ordered Domains P.G.Jeavons and M.C.Cooper In Artificial Intelligence. No. 79(2). Pages 327–339. 1995. |
|
[96] |
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. |
|
[97] |
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. |
|
[98] |
Recovering a Relation from a Decomposition using Constraint Satisfaction Techniques P.G.Jeavons In Information Sciences. No. 78. Pages 229–256. 1994. |
|
[99] |
A Structural Decomposition for Hypergraphs P.G.Jeavons‚ D.A.Cohen and M.Gyssens In Contemporary Mathematics. No. 178. Pages 161–177. 1994. |
|
[100] |
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. |
|
[101] |
Characterising Tractable Constraints M.C.Cooper‚ D.A.Cohen and P.G.Jeavons In Artificial Intelligence. No. 65(2). Pages 347–361. 1994. |