Welcome to Minion’s documentation!
Indices and tables
References
ILOG solver 6.0 user manual. 2003.
Dimitris Achlioptas, Michael S. O. Molloy, Lefteris M. Kirousis, Yannis C. Stamatiou, Evangelos Kranakis, and Danny Krizanc. Random constraint satisfaction: a more accurate picture. Constraints, 6(4):329–344, 2001.
Abderrahamane Aggoun, David Chan, Pierre Dufresne, Eamon Falvey, Hugh Grant, Warwick Harvey, Alexander Herold, Geoffrey Macartney, Micha Meier, David Miller, Shyam Mudambi, Stefano Novello, Bruno Perez, Emmanuel van Rossum, Joachim Schimpf, Kish Shen, Periklis Andreas Tsahageas, and Dominique Henry de Villeneuve. Eclipse user manual release 5.10. 2006. http://eclipse-clp.org/.
H. Alt, N. Blum, K. Mehlhorn, and M. Paul. Computing a maximum cardinality matching in a bipartite graph in time $O(n^1.5\sqrt m/\log n)$. Inf. Process. Lett., 37(4):237–240, 1991. doi:http://dx.doi.org/10.1016/0020-0190(91)90195-N.
Carlos Ansótegui. Personal communication.
Carlos Ansótegui, Carla P. Gomes, and Bart Selman. The achilles' heel of QBF. In Proceedings 20th National Conference on Artificial Intelligence (AAAI 2005), 275–281. 2005.
Krzysztof R. Apt. Principles of Constraint Programming. Cambridge University Press, 2003. ISBN 0 521 82583 0.
F Börner, A Bulatov, Peter Jeavons, and Andrei Krokhin. Quantified constraints: algorithms and complexity. In Proceedings 17th International Workshop on Computer Science Logic (CSL 2003), 58–70. 2003.
Fahiem Bacchus and Toby Walsh. A constraint algebra. Technical Report APES-77-2004, APES Research Group, 2004. Available from http://www.dcs.st-and.ac.uk/\~ apes/apesreports.html.
Thanasis Balafoutis and Kostas Stergiou. Algorithms for stochastic CSPs. In Proceedings 12th International Conference on the Principles and Practice of Constraint Programming (CP 2006), 44–58. 2006.
J. Christopher Beck and Mark S. Fox. Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics. Artificial Intelligence, 117:31–81, 2000.
Marco Benedetti. sKizzo: a suite to evaluate and certify QBFs. In Proceedings 20th International Conference on Automated Deduction (CADE 2005), 369–376. 2005.
Marco Benedetti, Arnaud Lallouet, and Jérémie Vautard. Reasoning on quantified constraints. In Rappresentazione Della Conoscenza e Ragionamento Automatico. 2006.
Marco Benedetti, Arnaud Lallouet, and Jérémie Vautard. Qcsp made practical by virtue of restricted quantification. In Proceedings 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), 38–43. 2007.
Claude Berge. Graphs and Hypergraphs. North-Holland Publishing Company, 1973. ISBN 0 7204 2453 4.
Christian Bessière and Jean-Charles Régin. Arc consistency for general constraint networks: preliminary results. In Proceedings 15th International Joint Conference on Artificial Intelligence (IJCAI 97), 398–404. 1997.
Christian Bessière and Jean-Charles Régin. Enforcing arc consistency on global constraints by solving subproblems on the fly. In Proceedings 5th International Conference on the Principles and Practice of Constraint Programming (CP 99), 103–117. 1999.
Christian Bessière and Jean-Charles Régin. Refining the basic constraint propagation algorithm. In Proceedings 17th International Joint Conference on Artificial Intelligence (IJCAI 2001), 309–315. 2001.
Christian Bessière, Jean-Charles Régin, Roland Yap, and Yuanlin Zhang. An optimal coarse-grained arc consistency algorithm. Artificial Intelligence, 165:165–185, 2005.
Christian Bessière and Guillaume Verger. Strategic constraint satisfaction problems. In Proceedings 5th International Workshop on Constraint Modelling and Reformulation (at CP 2006). 2006.
Armin Biere. Resolve and expand. In Proceedings 7th International Conference on Theory and Applications of Satisfiability Testing (SAT 2004), 238–246. 2005.
Lucas Bordeaux. Boolean and interval propagation for quantified constraints. In Proceedings 1st International Workshop on Quantification in Constraint Programming (at CP 2005). 2005.
Lucas Bordeaux, Marco Cadoli, and Toni Mancini. Exploiting fixable, substitutable and determined values in constraint satisfaction problems. In Proceedings 11th International Conference on Logic for Programming Artificial Intelligence and Reasoning, 270–284. 2004.
Lucas Bordeaux, Marco Cadoli, and Toni Mancini. CSP properties for quantified constraints: definitions and complexity. In Proceedings 20th National Conference on Artificial Intelligence (AAAI 2005), 360–365. 2005.
Lucas Bordeaux and Eric Monfroy. Beyond NP: arc-consistency for quantified constraints. In Proceedings 8th International Conference on the Principles and Practice of Constraint Programming (CP 2002), 371–386. 2002.
Marco Cadoli, Andrea Giovanardi, and Marco Schaerf. An algorithm to evaluate quantified Boolean formulae. In Proceedings 15th National Conference on Artificial Intelligence (AAAI 98), 262–267. 1998.
Marco Cadoli, Marco Schaerf, Andrea Giovanardi, and Massimo Giovanardi. An algorithm to evaluate quantified Boolean formulae and its experimental evaluation. Journal of Automated Reasoning, 28(2):101–142, 2002.
Jacques Carlier and Eric Pinson. A practical use of Jackson's preemptive schedule for solving the job-shop problem. Annals of Operations Research, 26:269–287, 1990. Cited by \cite martin-jobshop-96new.
Yves Caseau and Francois Laburthe. Improved CLP Scheduling with Task Intervals. In Proceedings 11th International Conference on Logic Programming (ICLP 94). The MIT press, 1994.
Peter Cheeseman, Bob Kanefsky, and William M. Taylor. Where the Really Hard Problems Are. In Proceedings 12th International Joint Conference on Artificial Intelligence (IJCAI 91), 331–337. 1991.
Hubie Chen and Víctor Dalmau. From pebble games to tractability: an ambidextrous consistency algorithm for quantified constraint satisfaction. In Proceedings 19th International Workshop on Computer Science Logic (CSL 2005), 232–247. 2005.
Chiu Wo Choi, Warwick Harvey, Jimmy Ho-Man Lee, and Peter J. Stuckey. Finite domain bounds consistency revisited. In Proceedings 19th Australian Joint Conference on Artificial Intelligence (AI 2006), 49–58. 2006.
Lecoutre Christophe and Szymanek Radoslaw. Generalized arc consistency for positive table constraints. In Proceedings 12th International Conference on the Principles and Practice of Constraint Programming (CP 2006), 284–298. 2006.
Koen Claessen and Niklas Srensson. Paradox. http://www.cs.chalmers.se/\~koen/paradox/.
David Cohen, Peter Jeavons, Christopher Jefferson, Karen E. Petrie, and Barbara M. Smith. Symmetry definitions for constraint programming. In Proceedings 11th International Conference on the Principles and Practice of Constraint Programming (CP 2005), 17–31. 2005. Best Paper award.
Simon Colton and Ian Miguel. Constraint generation via automated theory formation. In Proceedings of the Seventh International Conference on Principles and Practice of Constraint Programming, 575–579. 2001.
Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest. Introduction to Algorithms. MIT Press, 1990. ISBN 0 262 03141 8.
Marie-Christine Costa. Persistency in maximum cardinality bipartite matchings. Operations Research Letters, 15(3):143–149, 1994.
Andrew J. Davenport and J. Christopher Beck. A survey of techniques for scheduling with uncertainty. Unpublished manuscript. Available from http://tidel.mie.utoronto.ca/publications.php.
Martin Davis, George Logemann, and Donald Loveland. A machine program for theorem proving. Communications of the ACM, 5(7):394–397, 1962.
Martin Davis and Hilary Putnam. A computing procedure for quantification theory. Journal of the ACM, 7(1):201–215, 1960.
Maria Garcia de la Banda, Kim Marriott, Reza Rafeh, and Mark Wallace. The modelling language Zinc. In Proceedings 12th International Conference on the Principles and Practice of Constraint Programming (CP 2006), 700–705. 2006.
Romuald Debruyne and Christian Bessière. Some practicable filtering techniques for the constraint satisfaction problem. In Proceedings 15th International Joint Conference on Artificial Intelligence (IJCAI 97), 412–417. 1997.
Rina Dechter. Constraint Processing. Morgan Kaufmann, 2003. ISBN 1 55860 890 7.
David Eppstein. Implementation of hopcroft-karp algorithm in python. 2002. http://www.ics.uci.edu/\~eppstein/.
Hélène Fargier, Jérôme Lang, and Thomas Schiex. Mixed constraint satisfaction: a framework for decision problems under incomplete knowledge. In Proceedings 13th National Conference on Artificial Intelligence (AAAI 96), 175–180. 1996.
Edward Fredkin. Trie memory. Communications of the ACM, 3(9):490–499, 1960.
Alan M. Frisch, Matthew Grum, Chris Jefferson, Bernadette Martínez Hernández, and Ian Miguel. The design of ESSENCE: a constraint language for specifying combinatorial problems. In Proceedings 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), 80–87. 2007.
Alan M. Frisch, Christopher Jefferson, and Ian Miguel. Symmetry-breaking as a prelude to implied constraints: a constraint modelling pattern. In Proceedings 16th European Conference on Artificial Intelligence (ECAI 2004). 2004.
Alan M. Frisch and Timothy J. Peugniez. Solving non-Boolean satisfiability problems with stochastic local search. In Proceedings 17th International Joint Conference on Artificial Intelligence (IJCAI 2001), 282–290. 2001.
Alan M. Frisch, Timothy J. Peugniez, Anthony J. Doggett, and Peter Nightingale. Solving non-Boolean satisfiability problems with stochastic local search: a comparison of encodings. Journal of Automated Reasoning, 35(1-3):143–179, 2005.
J. Gaschnig. A constraint satisfaction method for inference making. In Proceedings 12th Annual Allerton Conference on Circuit and System Theory, 866–874. 1974. Cited by \cite handbook-cp, chapter 3.
Ian Gent, Christopher Jefferson, Inês Lynce, Ian Miguel, Peter Nightingale, Barbara Smith, and Armagan Tarim. Search in the patience game `Black Hole'. Technical Report CPPOD-10-2005, CPPOD research group, 2005.
Ian Gent and Andrew Rowley. Encoding Connect-4 using quantified Boolean formulae. Technical Report APES-68-2003, APES research group, 2003.
Ian P. Gent, Enrico Giunchiglia, Massimo Narizzano, Andrew G. D. Rowley, and Armando Tacchella. Watched data structures for QBF solvers. In Proceedings 6th International Conference on Theory and Applications of Satisfiability Testing (SAT 2003), 25–36. 2003.
Ian P. Gent, Warwick Harvey, Tom Kelsey, and Steve Linton. Generic SBDD using computational group theory. In Proceedings 9th International Conference on the Principles and Practice of Constraint Programming (CP 2003), 333–362. 2003.
Ian P. Gent, Chris Jefferson, Tom Kelsey, Inês Lynce, Ian Miguel, Peter Nightingale, Barbara M. Smith, and S. Armagan Tarim. Search in the patience game `black hole'. Technical Report CPPOD-21-2006, CPPOD research group, 2006.
Ian P. Gent, Chris Jefferson, and Ian Miguel. Minion: a fast, scalable, constraint solver. In Proceedings 17th European Conference on Artificial Intelligence (ECAI 2006), 98–102. 2006.
Ian P. Gent, Chris Jefferson, and Ian Miguel. Watched literals for constraint propagation in minion. In Proceedings 12th International Conference on the Principles and Practice of Constraint Programming (CP 2006). 2006.
Ian P. Gent, Christopher Jefferson, Ian Miguel, and Peter Nightingale. Data structures for generalised arc consistency for extensional constraints. In Proceedings of the Twenty Second Conference on Artificial Intelligence (AAAI-07), 191–197. 2007.
Ian P. Gent, Ian Miguel, and Peter Nightingale. Data structures for generalised arc consistency for extensional constraints. Technical Report CPPOD-19-2006-A, CPPOD research group, 2006.
Ian P. Gent, Ian Miguel, and Andrea Rendl. Tailoring solver-independent constraint models: a case study with essence' and minion. In Proceedings of SARA 2007, 184–199. 2007.
Ian P. Gent, Peter Nightingale, and Andrew Rowley. Encoding quantified CSPs as quantified Boolean formulae. In Proceedings 16th European Conference on Artificial Intelligence (ECAI 2004), 176–180. 2004.
Ian P. Gent, Peter Nightingale, Andrew Rowley, and Kostas Stergiou. Solving quantified constraint satisfaction problems. Artificial Intelligence, 2007. To appear.
Ian P. Gent, Peter Nightingale, and Kostas Stergiou. QCSP-Solve: a solver for quantified constraint satisfaction problems. In Proceedings 19th International Joint Conference on Artificial Intelligence (IJCAI 2005), 138–143. 2005.
Ian P. Gent and Andrew G. D. Rowley. Local and global complete solution learning methods for QBF. In Proceedings 8th International Conference on Theory and Applications of Satisfiability Testing (SAT 2005), 91–106. 2005.
E. Giunchiglia, M. Narizzano, and A. Tacchella. Clause/term resolution and learning in the evaluation of quantified Boolean formulas. Journal of Artificial Intelligence Research (JAIR), 26:371–417, 2006.
Enrico Giunchiglia, Massimo Narizzano, and Armando Tacchella. Backjumping for quantified Boolean logic satisfiability. In Proceedings 17th International Joint Conference on Artificial Intelligence (IJCAI 2001), 275–281. 2001.
Enrico Giunchiglia, Massimo Narizzano, and Armando Tacchella. Learning for quantified Boolean logic satisfiability. In Proceedings 18th National Conference on Artificial Intelligence (AAAI 2002), 649–654. 2002.
Warwick Harvey. Symmetry breaking and the social golfer problem. In Proceedings SymCon-01: Symmetry in Constraints, co-located with CP 2001, 9–16. 2001.
Emmanuel Hebrard, Brahim Hnich, and Toby Walsh. Robust solutions for constraint satisfaction and optimization. In Proceedings 16th European Conference on Artificial Intelligence (ECAI 2004). 2004.
Emmanuel Hebrard, Brahim Hnich, and Toby Walsh. Super solutions in constraint programming. In Proceedings 1st International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2004), 157–172. 2004.
Hirosi Hitotumatu and Kohei Noshita. A technique for implementing backtrack algorithms and its application. Information Processing Letters, 8(4):174–175, 1979. Cited by \cite knuth-dancinglinks.
Brahim Hnich, Ian Miguel, Ian P. Gent, and Toby Walsh. CSPLib: a problem library for constraints. http://csplib.org/.
J.E. Hopcroft and R.M. Karp. An $n^2.5$ algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, 2(4):225–231, 1973.
Joey Hwang and David G. Mitchell. 2-way vs. d-way branching for CSP. In Proceedings 11th International Conference on the Principles and Practice of Constraint Programming (CP 2005), 343–357. 2005.
Henry A. Kautz, Yongshao Ruan, Dimitris Achlioptas, Carla P. Gomes, Bart Selman, and Mark E. Stickel. Balance and filtering in structured satisfiable problems. In Proceedings of IJCAI-2001, 351–358. 2001.
Claire Kenyon and Meinolf Sellmann. Plan B: uncertainty/time trade-offs for linear and integer programming. In Proceedings 3rd International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2006), 126–138. 2006.
Donald Knuth. Dancing links. In Millennial Perspectives in Computer Science, pages 187–214. Palgrave, 2000.
Ludwig Krippahl and Pedro Barahona. Chemera: constraints in protein structural problems. In Proceedings of WCB06 Workshop on Constraint Based Methods for Bioinformatics, 30–45. 2006.
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 18th International Joint Conference on Artificial Intelligence (IJCAI 2003), 306–319. 2003.
Francoise Laburthe. Choco: a constraint programming kernel for solving combinatorial optimization problems. http://choco.sourceforge.net/.
Mikael Z. Lagerkvist and Christian Schulte. Advisors for incremental propagation. In Proceedings 13th Principles and Practice of Constraint Programming (CP 2007), 409–422. 2007.
Christophe Lecoutre and Patrick Prosser. Maintaining singleton arc-consistency. Technical Report CPPOD-14-2006, CPPOD research group, 2006.
Olivier Lhomme and Jean-Charles Régin. A fast arc consistency algorithm for n-ary constraints. In Proceedings 20th National Conference on Artificial Intelligence (AAAI 2005), 405–410. 2005.
A. K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8(1):99–118, 1977. Cited by \cite handbook-cp, chapter 3.
A. K. Mackworth. On reading sketch maps. In Proceedings 5th International Joint Conference on Artificial Intelligence (IJCAI 77), 598–606. 1977. Cited by \cite handbook-cp, chapter 3.
Nikos Mamoulis and Kostas Stergiou. Solving non-binary csps using the hidden variable encoding. In Proceedings 7th International Conference on the Principles and Practice of Constraint Programming (CP 2001), 168–182. 2001.
Nikos Mamoulis and Kostas Stergiou. Algorithms for quantified constraint satisfaction problems. In Proceedings 10th International Conference on the Principles and Practice of Constraint Programming (CP 2004), 752–756. 2004.
Suresh Manandhar, Armagan Tarim, and Toby Walsh. Scenario-based stochastic constraint programming. In Proceedings 18th International Joint Conference on Artificial Intelligence (IJCAI 2003), 257–262. 2003.
Kim Marriott and Peter J. Stuckey. Programming with constraints: an introduction. MIT Press, 1998. ISBN 0 262 13341 5.
Paul Martin and David B. Shmoys. A new approach to computing optimal schedules for the job-shop scheduling problem. In Proceedings 5th International Conference on Integer Programming and Combinatorial Optimization (IPCO 96), 389–403. 1996.
Roger Mohr and Gérald Masini. Good old discrete relaxation. In Proceedings 8th European Conference on Artificial Intelligence (ECAI 88), 651–656. 1988.
Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: engineering an efficient SAT solver. In Proceedings 39th Design Automation Conference (DAC 2001). 2001.
Les Proll and Barbara Smith. ILP and constraint programming approaches to a template design problem. INFORMS Journal of Computing, 10:265–275, 1998.
Patrick Prosser. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9(3):268–299, 1993.
Claude-Guy Quimper and Toby Walsh. The all different and global cardinality constraints on set, multiset and tuple variables. In Recent Advances in Constraints, LNAI 3419. 2006.
Jean-Charles Régin. A filtering algorithm for constraints of difference in CSPs. In Proceedings 12th National Conference on Artificial Intelligence (AAAI 94), 362–367. 1994.
Stefan Ratschan. Continuous first-order constraint satisfaction. In Proceedings of Artificial Intelligence and Symbolic Computation 2002. 2002.
Francesca Rossi, Charles Petrie, and Vasant Dhar. On the equivalence of constraint satisfaction problems. In Proceedings 9th European Conference on Artificial Intelligence (ECAI 90), 550–556. 1990.
Francisco Rossi, Peter van Beek, and Toby Walsh, editors. Handbook of Constraint Programming. Elsevier, 2006. ISBN 0 444 52726 5.
Stuart J. Russell and Peter Norvig. Artificial Intelligence A Modern Approach. Prentice Hall, 1995. ISBN 0 13 360124 2.
Norman M. Sadeh, Katia P. Sycara, and Yalin Xiong. Backtracking techniques for the job shop scheduling constraint satisfaction problem. Artificial Intelligence, 76(1-2):455–480, 1995.
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, 619–633. Toronto, Canada, September 2004. Springer-Verlag. URL: http://www.ict.kth.se/\~cschulte/paper.html?id=SchulteStuckey:CP:2004.
Christian Schulte and Guido Tack. Views and iterators for generic constraint implementations. In Recent Advances in Constraints (2005), volume 3978 of Lecture Notes in Artificial Intelligence, 118–132. Springer-Verlag, 2006.
João C. Setubal. New experimental results for bipartite matching. In Proceedings of netflow93, tech. report TR-21/93, Dipartamento de Informatica, Università di Pisa, 211–216. 1993.
João C. Setubal. Sequential and parallel experimental results with bipartite matching algorithms. Technical Report EC-96-09, Institute of Computing, University of Campinas, Brasil, 1996.
Barbara Smith, Kostas Stergiou, and Toby Walsh. Modelling the Golomb Ruler problem. In Proceedings of Workshop on Non Binary Constraints (at IJCAI 99). 1999.
Barbara M. Smith. A dual graph translation of a problem in `Life'. In Proceedings 8th International Conference on the Principles and Practice of Constraint Programming (CP 2002), 402–414. 2002.
Barbara M. Smith. Constraint programming models for graceful graphs. In Proceedings 12th International Conference on the Principles and Practice of Constraint Programming (CP 2006), 545–559. 2006.
R. M. Stallman and G. J. Sussman. Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Artificial Intelligence, 9:135–196, 1977. Cited by \cite handbook-cp chapter 4.
Kostas Stergiou. Repair-based methods for quantified CSPs. In Proceedings 11th International Conference on the Principles and Practice of Constraint Programming (CP 2005), 652–666. 2005.
Kostas Stergiou and Toby Walsh. Encodings of non-binary constraint satisfaction problems. In Proceedings 16th National Conference on Artificial Intelligence (AAAI 99), 163–168. 1999.
Kostas Stergiou and Toby Walsh. The difference all-difference makes. In Proceedings IJCAI'99. 1999.
Stanley Smith Stevens. On the theory of scales of measurement. Science, 103:677–680, 1946.
Tanel Tammet. Gandalf. http://deepthought.ttu.ee/it/gandalf/.
Armagan Tarim, Suresh Manandhar, and Toby Walsh. Stochastic constraint programming: a scenario-based approach. Constraints, 11(1):53–80, 2006.
Robert Tarjan. Depth-first search and linear graph algorithms. SIAM Journal on Computing, 1(2):146–160, 1972.
Willem-Jan van Hoeve. The alldifferent constraint: a survey. In Proceedings Sixth Annual Workshop of the ERCIM Working Group on Constraints. 2001. URL: http://arxiv.org/abs/cs.PL/0105015.
Guillaume Verger and Christian Bessière. Blocksolve: a bottom-up approach for solving quantified CSPs. In Proceedings 12th International Conference on the Principles and Practice of Constraint Programming (CP 2006), 635–649. Nantes, France, 2006.
Jörg Würtz. Constraint-based scheduling in Oz. In U. Zimmermann, U. Derigs, W. Gaul, R. Möhrig, and K.-P. Schuster, editors, Operations Research Proceedings 1996, pages 218–223. Springer-Verlag, 1996.
Mark Wallace. Practical applications of constraint programming. Constraints, 1(1/2):139–168, 1996.
T. Walsh. SAT v CSP. In Proceedings 6th International Conference on the Principles and Practice of Constraint Programming, number 1894 in LNCS, 441–456. Springer, 2000.
Toby Walsh. Stochastic constraint programming. In Proceedings 15th European Conference on Artificial Intelligence (ECAI 2002), 111–115. 2002.
Toby Walsh. Challenges for SAT and QBF. 2003. Talk at SAT 2003 conference, slides available from http://www.cse.unsw.edu.au/\~tw/sat2003.ppt.
D. L. Waltz. Generating semantic descriptions from drawings of scenes with shadows. Technical Report MAC AI-271, MIT, 1972. Cited by \cite handbook-cp, chapter 3.
Neil Yorke-Smith and Carmen Gervet. Closures of uncertain constraint satisfaction problems. In Proceedings 1st International Workshop on Quantification in Constraint Programming (at CP 2005). 2005.