References

[1] Jean-Charles Régin and Carla P. Gomes. The cardinality matrix constraint. In CP, pages 572-587, 2004.
[ bib ]
[2] Jean-Charles Régin and Jean-Francois Puget. A filtering algorithm for global sequencing constraints. In CP, pages 32-46, 1997.
[ bib ]
[3] Alfred V. Aho, John E. Hopcroft, and Jeffrey D. Ullman. The Design and Analysis of Computer Algorithms, volume - of Addison-Wesley Series in Computer Science and Information Processing.a Addison-Wesley, Reading,Massachusetts - Menlo Park,California - London, 1974.
[ bib ]
[4] Arne Andersson, Torben Hagerup, Stefan Nilsson, and Rajeev Raman. Sorting in linear time. Technical report, Schweden and MPI SB, Nevada, 1995.
[ bib ]
[5] K. Apt. Principles of Constraint Programming. Cambridge University Press, 2003.
[ bib | .html ]
[6] Krzysztof R. Apt. The rough guide to constraint propagation. In CP '99: Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming, pages 1-23. Springer-Verlag, 1999.
[ bib ]
[7] Krzysztof R. Apt. The essence of constraint propagation. volume cs.AI/9811024, 1998.
[ bib ]
[8] Philippe Baptiste, Claude Le Pape, and Wim Nuijten. Constraint-Based Scheduling. Kluwer Academic Publishers, 2001.
[ bib ]
[9] Roman Barták. Constraint programming: In pursuit of the holy grail. In In Proceedings of the Week of Doctoral Students (WDS99), volume Part IV, Prague, June 1999. MatFyzPress.
[ bib ]
[10] Claude Berge. Graphs and hypergraphs, volume 6 of North - Holland Mathematical Library. North-Holland, Elsevier, Amsterdam, repr. of the 2., rev. ed. edition, 1979.
[ bib ]
[11] Noelle Bleuzen-Guernalec and Alain Colmerauer. Optimal narrowing of a block of sortings in optimal time. Constraints: An International Journal, 5(1/2):85-118m, January 2000.
[ bib ]
[12] Thomas H. Cormen, Charles E. Leierson, and Ronald L. Rivest. Introduction to Algorithms, second edition. MIT Press, Cambridge, Massachusetts - London, England, 2001.
[ bib ]
[13] Thomas Emden-Weinert, Stefan Hougardy, Bernd Kreuter, Hans Jürgen Prömel, and Angelika Steger. Einführung in Graphen und Algorithmen, 1996.
[ bib | http ]
[14] Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., 1979.
[ bib ]
[15] I.P. Gent, I. McDonald, and B.M. Smith. Conditional symmetry in the all-interval series problem. In B.M. Smith, I.P. Gent, and W. Harvey, editors, Proceedings of the Third International Workshop on Symmetry in Constraint Satisfaction Problems, pages 55-65, 2003.
[ bib | .pdf ]
[16] I.P. Gent and T. Walsh. Csplib: a benchmark library for constraints. Technical report, Technical report APES-09-1999, 1999. Available from http://csplib.cs.strath.ac.uk/. A shorter version appears in the Proceedings of the 5th International Conference on Principles and Practices of Constraint Programming (CP-99).
[ bib ]
[17] Fred Glover. Maximum matching in a convex bipartite graph. Naval Research Logistics Quarterly, 14(3):313-316, September 1967.
[ bib ]
[18] Pascal Van Hentenryck, Laurent Michel, Laurent Perron, and Jean-Charles Régin. Constraint programming in opl. In Gopalan Nadathur, editor, Proceedings of the International Conference on Principles and Practice of Declarative Programming (PPDP'99), volume 1702 of Lecture Notes in Computer Science, pages 98-116, September 29 - October 1 1999.
[ bib | .ps ]
[19] John E. Hopcroft and Richard M. Karp. An n5/2 algorithm for maximum matchings in bipartite graphs. SIAM: Journal of Computing, 2(4):225-231, December 1973.
[ bib ]
[20] I.S.Laboratory. SICStus Prolog user's manual, 3.11.1 Technical Report. Swedish Institute of Computer Science, 2004.
[ bib | .pdf ]
[21] Irit Katriel and Sven Thiel. Fast bound-consistency for the global cardinality constraint. In Francesca Rossi, editor, Principles and Practice of Constraint Programming - CP 2003 : 9th International Conference, CP 2003, volume 2833 of Lecture Notes in Computer Science, pages 437-451, Kinsale, Ireland, 2003. Springer.
[ bib ]
[22] Marco Kuhlmann and Guido Tack. Constraint programming, 2005.
[ bib | http ]
[23] Marco Kuhlmann and Guido Tack. Constraint satisfaction problems, 2005.
[ bib | http ]

Used a lot for the basic definitions of constraint programming. A perfect setup for those terminology issues.

[24] Marco Kuhlmann and Guido Tack. Propagators, 2005.
[ bib | http ]

Used a lot for the basic definitions of constraint programming. A perfect setup for those terminology issues.

[25] Alejandro López-Ortiz, Claude-Guy Quimper, John Tromp, and Peter van Beek. A fast and simple algorithm for bounds consistency of the alldifferent constraint. In Proceedings of the 18th International Joint Conference on Artificial Intelligence, pages 245-250, Acapulco, Mexico, August 2003.
[ bib | .pdf ]
[26] Alejandro López-Ortiz, Claude-Guy Quimper, John Tromp, and Peter van Beek. A fast and simple algorithm for bounds consistency of the alldifferent constraint, technical report. Technical report, School of Computer Science, University of Waterloo, Waterloo, Canada, Acapulco, Mexico, 2003.
[ bib | .ps ]
[27] Associate Professor Leo Joskowicz. Linear-time sorting, 2003.
[ bib | http ]
[28] K. McAloon, C. Tretkoff, and G. Wetzel. Sport league scheduling, 1997.
[ bib | .html ]
[29] Kurt Mehlhorn. Data Structures and Algorithms, volume 2 Graph Algorithms and NP-Completeness of EATCS Monographs. Springer Verlag, 1984.
[ bib ]
[30] W. J. Older, G. M. Swinkels, and M. H. van Emden. Getting to the real problem: Experience with bnr prolog in or. In Proc.of the Third International Conference on the Practical Application of Prolog, pages 465-478, Paris, 1995.
[ bib ]
[31] Claude-Guy Quimper, Peter van Beek, Alejandro López-Ortiz, and Alexander Golynski. Improved Algorithms for the Global Cardinality Constraint. In Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming, volume 3528, Toronto, Canada, September 2004.
[ bib | .pdf ]
[32] Claude-Guy Quimper, Peter van Beek, Alejandro López-Ortiz, Alexander Golynski, and Sayyed Bashir Sadjad. An efficient bounds consistency algorithm for the global cardinality constraint. In Proceedings of the 9th International Conference on Principles and Practice of Constraint Programming, volume 2833, pages 600-614, Kinsale, Ireland, September 2003.
[ bib | .pdf ]
[33] Claude-Guy Quimper, Peter van Beek, Alejandro López-Ortiz, Alexander Golynski, and Sayyed Bashir Sadjad. An efficient bounds consistency algorithm for the global cardinality constraint, technical report. Technical report, School of Computer Science, University of Waterloo, Waterloo, Canada, 2003.
[ bib | .pdf ]
[34] Jean-Charles Régin. Combination of Among and Cardinality Constraints. In Roman Barták and Michela Milano, editors, Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems: Second International Conference, CPAIOR, volume 3524 of Lecture Notes in Computer Science, pages 288 - 303, Prague, Czech Republic, Jun 2005. Springer-Verlag.
[ bib ]
[35] Jean-Charles Régin. Generalized arc consistency for global cardinality constraint. In Proceedings of the 13th National Conference on AI (AAAI/IAAI'96), volume 1, pages 209-215, Portland, August 1996.
[ bib ]
[36] Jean-Charles Régin. A filtering algorithm for constraints of difference in CSPs. In Proceedings of 12th National Conference on AI (AAAI'94), volume 1, pages 362-367, Seattle, July 31 - August 4 1994.
[ bib ]
[37] ILOG S.A. ILOG Solver 5.0:Reference Manual. ILOG S.A., 2000.
[ bib ]
[38] Christian Schulte. Gecode 1.0.0 Reference Documentation, 1.0.0 edition, 12 2006.
[ bib ]
[39] Christian Schulte. Programming Constraint Services. Doctoral dissertation, Saarland University, Faculty for Natural Sciences I, Department of Computer Science, Saarbrücken, Germany, 2000.
[ bib ]

This thesis presents design, application, implementation, and evaluation of computation spaces as abstractions for programming constraint services at a high level. Spaces are seamlessly integrated into a concurrent programming language and make constraint-based computations compatible with concurrency through encapsulation. Spaces are applied to search and combinators as essential constraint services. State-of-the-art and new search engines such as visual interactive search and parallel search are covered. Search is expressive and concurrency-compatible by using copying rather than trailing. Search is space and time efficient by using recomputation. Composable combinators, also known as deep-guard combinators, stress the control facilities and concurrency integration of spaces. The implementation of spaces comes as an orthogonal extension to the implementation of the underlying programming language. The resulting implementation is shown to be competitive with existing constraint programming systems.

[40] Christian Schulte and Gert Smolka. Finite Domain Constraint Programming in Oz. A Tutorial, 1.3.0 edition, 2004.
[ bib | http | .pdf.gz ]
[41] Christian Schulte and Peter J. Stuckey. Speeding up constraint propagation. In Mark Wallace, editor, Tenth International Conference on Principles and Practice of Constraint Programming, volume 3258 of Lecture Notes in Computer Science, pages 619-633, Toronto, Canada, September 2004. Springer-Verlag.
[ bib | http ]
[42] Christian Schulte and Guido Tack. Views and iterators for generic constraint implementations. In Christian Schulte, Fernando Silva, and Ricardo Rocha, editors, Proceedings of the Fifth International Colloqium on Implementation of Constraint and Logic Programming Systems, pages 37-48, Sitges, Spain, Oct 2005. To appear.
[ bib ]
[43] Andrew Shapira. An exact performance bound for an o(m + n) time greedy matching procedure. The Electronic Journal of Combinatorics, 4, 1997.
[ bib ]
[44] Sven Thiel. Efficient Algorithms for Constraint Propagation and for Processing Tree Descriptions. Doctoral dissertation, Saarland University, Faculty for Natural Sciences I, Department of Computer Science, Saarbrücken, Germany, May 2004.
[ bib | .pdf ]
[45] Yamamoto Tsunetomo. The Hagakure - A Code to the Way of the Samurai. 1716.
[ bib ]
[46] Mark Wallace, Stefano Novello, and Joachim Schimpf. Eclipse: A platform for constraint logic programming. technical report. Technical report, IC-Parc, Imperial College, London, UK, IC-Parc, Imperial College, London, UK, 1997.
[ bib | .html ]
[47] Jianyang Zhou. A constraint program for solving the job-shop problem. In Principles and Practice of Constraint Programming, pages 510-524, 1996.
[ bib | .html ]
[48] Jianyang Zhou. A permutation-based-approach for solving the job-shop problem. Constraints: An International Journal, 2(2):185-213, October 1973.
[ bib ]
[49] John E. Miller. Langford's problem. Available from http://www.lclark.edu/~miller/langford.html, 20064.
[ bib | .html ]
[50] The Gecode team. Generic constraint development environment. Available from http://www.gecode.org, 2006.
[ bib | http ]
[51] B. Smith. Modelling a permutation problem. In Proceedings of ECAI'2000 Workshop on Modelling and Solving Problems with Constraints, 2000. Also available as Research Report from http://www.comp.leeds.ac.uk/bms/papers.html.
[ bib | .html ]
[52] Jean-Francois Puget. A fast algorithm for the bound consistency of alldiff constraints. In AAAI '98/IAAI '98: Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence, pages 359-366, Menlo Park, CA, USA, 1998. American Association for Artificial Intelligence.
[ bib ]
[53] N. Barnier and P. Brisset. Solving the kirkman's schoolgirl problem in a few seconds, 2002.
[ bib | .html ]
[54] Mehmet Dincbas, Helmut Simonis, and Pascal Van Hentenryck. Solving the car-sequencing problem in constraint logic programming. In ECAI, pages 290-295, 1988.
[ bib ]
[55] Mark Wallace, Joachim Schimpf, Kish Shen, and Warwick Harvey. On benchmarking constraint logic programming platforms. response to fernandez and hill's a comparative study of eight constraint programming languages over the boolean and finite domains. Constraints, 9(1):5-34, 2004.
[ bib ]




Valid XHTML 1.0! Valid CSS!

$Date: 2007-05-26 15:14:15 +0200 (Sat, 26 May 2007) $ by Patrick Pekczynski