handbook of constraint programming 1st edition
LINK 1 ENTER SITE >>> Download PDF
LINK 2 ENTER SITE >>> Download PDF
File Name:handbook of constraint programming 1st edition.pdf
Size: 4005 KB
Type: PDF, ePub, eBook
Category: Book
Uploaded: 16 May 2019, 22:25 PM
Rating: 4.6/5 from 590 votes.
Status: AVAILABLE
Last checked: 1 Minutes ago!
In order to read or download handbook of constraint programming 1st edition ebook, you need to create a FREE account.
eBook includes PDF, ePub and Kindle version
✔ Register a free 1 month Trial Account.
✔ Download as many books as you like (Personal use)
✔ Cancel the membership at any time if not satisfied.
✔ Join Over 80000 Happy Readers
handbook of constraint programming 1st editionHowever, due to transit disruptions in some geographies, deliveries may be delayed.There’s no activationEasily readSymmetry in Constraint Programming (Ian P. Gent, Karen E. Petrie, Jean-Francois Puget) Chapter 11. Modelling (Barbara M. Smith) Part II: Extensions, Languages, and Applications Chapter 12. Constraint Logic Programming (Kim Marriott, Peter J. Stuckey, Mark Wallace) Chapter 13. Constraints in Procedural and Concurrent Languages (Thom Fruehwirth, Laurent Michel, Christian Schulte) Chapter 14. Finite Domain Constraint Programming Systems (Christian Schulte, Mats Carlsson) Chapter 15. Operations Research Methods in Constraint Programming (John Hooker) Chapter 16. Continuous and Interval Constraints(Frederic Benhamou, Laurent Granvilliers) Chapter 17. Constraints over Structured Domains (Carmen Gervet) Chapter 18. Randomness and Structure (Carla Gomes, Toby Walsh) Chapter 19. Temporal CSPs (Manolis Koubarakis) Chapter 20. Distributed Constraint Programming (Boi Faltings) Chapter 21. Uncertainty and Change (Kenneth N. Brown, Ian Miguel) Chapter 22. Constraint-Based Scheduling and Planning (Philippe Baptiste, Philippe Laborie, Claude Le Pape, Wim Nuijten) Chapter 23. Vehicle Routing (Philip Kilby, Paul Shaw) Chapter 24. Configuration (Ulrich Junker) Chapter 25. Constraint Applications in Networks (Helmut Simonis) Chapter 26. Bioinformatics and Constraints (Rolf Backofen, David Gilbert) Constraint programming is currently applied with success to many domains, such as scheduling, planning, vehicle routing, configuration, networks, and bioinformatics. The aim of this handbook is to capture the full breadth and depth of the constraint programming field and to be encyclopedic in its scope and coverage. While there are several excellent books on constraint programming, such books necessarily focus on the main notions and techniques and cannot cover also extensions, applications, and languages.http://static.yuka.ro/img/fluarc-fb4-manual.xml
- Tags:
- handbook of constraint programming 1st edition pdf, handbook of constraint programming 1st edition free, handbook of constraint programming 1st edition answers, handbook of constraint programming 1st edition download.
The handbook gives a reasonably complete coverage of all these lines of work, based on constraint programming, so that a reader can have a rather precise idea of the whole field and its potential. Of course each line of work is dealt with in a survey-like style, where some details may be neglected in favor of coverage. However, the extensive bibliography of each chapter will help the interested readers to find suitable sources for the missing details. Each chapter of the handbook is intended to be a self-contained survey of a topic, and is written by one or more authors who are leading researchers in the area. The intended audience of the handbook is researchers, graduate students, higher-year undergraduates and practitioners who wish to learn about the state-of-the-art in constraint programming. No prior knowledge about the field is necessary to be able to read the chapters and gather useful knowledge. Researchers from other fields should find in this handbook an effective way to learn about constraint programming and to possibly use some of the constraint programming concepts and techniques in their work, thus providing a means for a fruitful cross-fertilization among different research areas. The handbook is organized in two parts. The first part covers the basic foundations of constraint programming, including the history, the notion of constraint propagation, basic search methods, global constraints, tractability and computational complexity, and important issues in modeling a problem as a constraint problem. The second part covers constraint languages and solver, several useful extensions to the basic framework (such as interval constraints, structured domains, and distributed CSPs), and successful application areas for constraint programming. While there are several excellent books on constraint programming, such books necessarily focus on the main notions and techniques and cannot cover also extensions, applications, and languages.http://www.asclyziarskyklub.sk/userfiles/fluence-manual-english.xml The first part covers the basic foundations of constraint programming, including the history, the notion of constraint propagation, basic search methods, global constraints, tractability and computational complexity, and important issues in modeling a problem as a constraint problem.We value your input. Share your review so everyone else can enjoy it too.Your review was sent successfully and is now waiting for our team to publish it. Reviews (0) write a review Updating Results If you wish to place a tax exempt orderCookie Settings Thanks in advance for your time. Our payment security system encrypts your information during transmission. We don’t share your credit card details with third-party sellers, and we don’t sell your information to others. Please try again.Please try again.Please try again. Constraint programming is currently applied with success to many domains, such as scheduling, planning, vehicle routing, configuration, networks, and bioinformatics. The second part covers constraint languages and solver, several useful extensions to the basic framework (such as interval constraints, structured domains, and distributed CSPs), and successful application areas for constraint programming. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required. The authors, many of whom are key contributors to the subjects described, have done a great job to make the important and interesting material accessible. A must-read for newcomers, and a must-have for the converts.? ? Joxan Jaffar, Professor and Dean, School of Computing, National University of Singapore ?This handbook captures the breadth and sophistication of the field of constraint programming (CP), a rapidly growing area of research with significant academic and commercial impact. The editors and contributors provide an outstanding overview of the core and cutting edge techniques in the field.http://eco-region31.ru/dishwasher-service-manuals This handbook will be essential to all CP researchers and practitioners. It will also be a great guide for researchers from related fields, such as optimization and operations research.? ? Bart Selman, Professor of Computer Science, Cornell University Constraint programming is a powerful paradigm for solving combinatorial and numerical problems that draws on a wide range of techniques from artificial intelligence, computer science, databases, programming languages, and operations research. Constraint programming is currently applied with success to many domains, such as scheduling, planning, vehicle routing, configuration, networks, and bioinformatics. The aim of this handbook is to capture the full breadth and depth of the field of constraint programming and to be encyclopedic in its scope and coverage. Each chapter of the handbook is a self-contained survey of a topic, and is written by one or more authors who are leading researchers in the area. The intended audience of the handbook is researchers, graduate students, upper-year undergraduates, and practitioners who wish to learn about the state-of-the-art in constraint programming. For someone outside the field wondering what Constraint Programming is all about, this is the perfect introduction, and the book will remain useful as a reference for years. ? Michael Trick, Professor of Operations Research, Tepper School of Business, Carnegie Mellon University ?This book is an impressive and comprehensive coverage of Constraint Programming. The authors, many of whom are key contributors to the subjects described, have done a great job to make the important and interesting material accessible. A must-read for newcomers, and a must-have for the converts. ? Joxan Jaffar, Professor and Dean, School of Computing, National University of Singapore ?This handbook captures the breadth and sophistication of the field of constraint programming (CP), a rapidly growing area of research with significant academic and commercial impact. It will also be a great guide for researchers from related fields, such as optimization and operations research. ? Bart Selman, Professor of Computer Science, Cornell University Constraint programming is a powerful paradigm for solving combinatorial and numerical problems that draws on a wide range of techniques from artificial intelligence, computer science, databases, programming languages, and operations research. Researchers from other fields will find the handbook an effective way to learn about constraint programming and to be able to use constraint programming concepts and techniques in their own work.Full content visible, double tap to read brief content. Videos Help others learn more about this product by uploading a video. Upload video To calculate the overall star rating and percentage breakdown by star, we don’t use a simple average. Instead, our system considers things like how recent a review is and if the reviewer bought the item on Amazon. It also analyzes reviews to verify trustworthiness. Please try again later. Bryan 3.0 out of 5 stars See pictures. Did not attempt to read after discovering this problem. Will see if there is a second printing, or perhaps try another copy of the first printing to see if it's every copy, or just a transient problem.See pictures. Did not attempt to read after discovering this problem. Will see if there is a second printing, or perhaps try another copy of the first printing to see if it's every copy, or just a transient problem.If you think you might need anything like it, get this. The 13-digit and 10-digit formats both work. Please try again.Please try again.Please try again. Constraint programming is currently applied with success to many domains, such as scheduling, planning, vehicle routing, configuration, networks, and bioinformatics. The second part covers constraint languages and solver, several useful extensions to the basic framework (such as interval constraints, structured domains, and distributed CSPs), and successful application areas for constraint programming. - Covers the whole field of constraint programming - Survey-style chapters - Five chapters on applications Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required. The editors and contributors provide an outstanding overview of the core and cutting edge techniques in the field. Constraint programmingThe aim of this handbook isWhile there are several excellent books onThe handbook givesHowever, the extensive bibliography of eachResearchers from other fields should find inThe first part covers the basic foundationsThe second partFinite Domain Constraint Programming SystemsOperations Research Methods in ConstraintContinuous and Interval Constraints(FredericConstraints over Structured Domains (CarmenDistributed Constraint ProgrammingUncertainty and Change (Kenneth N. Brown, Ian Miguel) ChapterVehicle Routing (Philip Kilby, Paul Shaw)Constraint Applications in NetworksBioinformatics and Constraints (Rolf Backofen, DavidCambridge University Press, 2003. Google Scholar R. Dechter. Constraint Processing. Morgan Kaufmann, 2003. Google Scholar F. Fages. Programmation logique par contraintes. Ellipses Marketing, 1998. Google Scholar T. Fruhwirth and S. Abdennadher. Essentials of Constraint Programming. Springer, 2003. Google Scholar J. Hooker. Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley-Interscience, 2000. Google Scholar K. Marriott and P. J. Stuckey. Programming with Constraints. The MIT Press, 1998. Google Scholar E. P. K. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993. Google Scholar P. Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, 1989. Google Scholar H. G. Barrow and J. M. Tenenbaum. MSYS: A system for reasoning about scenes. In SRI AICenter, 1975. Google Scholar J. R. Bitner and E. M. Reingold. Backtrack programming techniques. Comm. ACM, 18:651-656, 1975. Google Scholar D. G. Bobrow and B. Raphael. New programming languages for artificial intelligence research. Report CS-79-746, Computer Science Dept., Stanford University, CA, 1979. Google Scholar A. Brown. Qualitative knowledge, casual reasoning and the localization of failures. Technical Report AITR-362, MIT Artificial Intelligence Laboratory, Nov. 6 1976. URL Google Scholar C. A. Brown and P. W. Purdom Jr. An average time analysis of backtracking. SIAM J. Comput., 10:583-593, 1981. Google Scholar M. Bruynooghe. Solving combinatorial search problems by intelligent backtracking. Information Processing Letters, 12:36-39, 1981. Google Scholar R. M. Burstall. A program for solving word sum puzzles. Computer Journal, 12(1): 48-51, Feb. 1969. Google Scholar M. B. Clowes. On seeing things. Artificial Intelligence, 2:79-116, 1971. Google Scholar J. Cohen. Constraint logic programming languages. CACM, 33(7):52-68, July 1990. ISSN 0001-0782. URL Google Scholar A. Colmerauer. Prolog II reference manual and theoretical model. Technical report, Groupe d'Intelligence Arificielle, Univeriste d'Aix-Marseille II, Luminy, Oct. 1982. Google Scholar A. Colmerauer. Prolog and infinite trees. In K. L. Clark and S.-A. Tarnlund, editors, Logic Programming, pages 231-251. Academic Press, 1982. Google Scholar M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Comm. ACM, 5:394-397, 1962. Google Scholar J. de Kleer. Local methods for localizing faults in electronic circuits. Technical Report AIM-394, MIT Artificial Intelligence Laboratory, Nov. 6 1976. URL Google Scholar J. de Kleer and G. J. Sussman. Propagation of constraints applied to circuit synthesis. Technical Report AIM-485, MIT Artificial Intelligence Laboratory, Sept. 6 1978. URL Google Scholar R. Dechter. Constraint Processing. Google Scholar Y. Descotte and J.-C. Latombe. GARI: A problem solver that plans how to machine mechanical parts. In International Joint Conference on Artificial Intelligence (IJCAI '81), pages 766-772, 1981. Google Scholar C. M. Eastman. Automated space planning. Artificial Intelligence, 4(1):41-64, 1973. Google Scholar E. W. Elcock. Absys: the first logic programming language - A retrospective and a commentary. Journal of Logic Programming, 9(1):1-17, July 1990. Google Scholar R. E. Fikes. REF-ARF: A system for solving problems stated as procedures. Artificial Intelligence, 1:27-120, 1970. Google Scholar J. P. Fillmore and S. G. Williamson. On backtracking: A combinatorial description of the algorithm. SIAM Journal on Computing, 3(1):41-55, Mar. 1974. Google Scholar M. S. Fox, B. P. Allen, and G. Strohm. Job-shop scheduling: An investigation in constraint-directed reasoning. In AAAI82, Proceedings, pages 155-158, 1982. Google Scholar E. C. Freuder. Synthesizing constraint expressions. Comm. ACM, 21:958-966, 1978. Google Scholar E. C. Freuder. A sufficient condition for backtrack-free search. J. ACM, 29:24-32, 1982. Google Scholar E. C. Freuder. A sufficient condition for backtrack-bounded search. J. ACM, 32: 755-761, 1985. Google Scholar E. C. Freuder and A. K. Mackworth. Introduction to the special volume on constraint-based reasoning. Artificial Intelligence, 58:1-2, 1992. Google Scholar E. C. Freuder and M. J. Quinn. Taking advantage of stable sets of variables in constraint satisfaction problems. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, pages 1076-1078, Los Angeles, 1985. Google Scholar J. Gaschnig. A constraint satisfaction method for inference making. In Proc. 12th Annual Allerton Conf.In Proceedings of the Fifth International Joint Conference on Artificial Intelligence, page 457, Cambridge, Mass., 1977. Google Scholar J. Gaschnig. Experimental case studies of backtrack vs. Waltz-type vs. new algorithms for satisficing assignment problems. In Proceedings of the Second Canadian Conference on Artificial Intelligence, pages 268-277, Toronto, 1978. Google Scholar S. Golomb and L. Baumert. Backtrack programming. J. ACM, 12:516-524, 1965. Google Scholar R. M. Haralick and G. L. Elliott. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263-313, 1980. Google Scholar R. M. Haralick, L. S. Davis, A. Rosenfeld, and D. L. Milgram. Reduction operations for constraint satisfaction. Inf. Sci, 14(3):199-219, 1978. URL (78)90043-9. Google Scholar P. J. Hayes. Computation and deduction. In Proc. 2nd International Symposium on Mathematical Foundations of Computer Science, pages 105-118. Czechoslovakian Academy of Sciences, 1973. Google Scholar C. Hewitt. PLANNER: A language for proving theorems in robots. In Proceedings of the First International Joint Conference on Artificial Intelligence, pages 295-301, Bedford, MA., 1969. Mitre Corporation. Google Scholar D. A. Huffman. Impossible objects as nonsense sentences. In B. Meltzer and D. Michie, editors, Machine Intelligence 6, pages 295-323. Edinburgh Univ. Press, 1971. Google Scholar J. Jaffar and J.-L. Lassez. Constraint logic programming. In Fourteenth Annual ACM Symposium on Principles of Programming Languages (POPL), pages 111-119, Munchen, 1987. Google Scholar J. Jaffar and M. J. Maher. Constraint logic programming: A survey. Journal of Logic Programming, 19(20):503-581, 1994. Google Scholar J. Jaffar, S. Michaylov, P. J. Stuckey, and R. H. C. Yap. The CLP(R) language and system. TOPLAS, 14(3):339-395, July 1992. ISSN 0164-0925. URL Google Scholar D. E. Knuth. Fundamental Algorithms, volume 1 of The Art of Computer Programming. Addison-Wesley, 1973. Google Scholar D. E. Knuth. Estimating the efficiency of backtrack programs. Mathematics of Computation, 29:121-136, 1975. Google Scholar R. A. Kowalski. Predicate logic as a programming language. Proc. IFIP '74, pages 569-574, 1974. Google Scholar R. A. Kowalski. A proof procedure using connection graphs. J. ACM, 22(4):572-595, 1975. Google Scholar J.-L. Lauriere. A language and a program for stating and solving combinatorial problems. Artificial Intelligence, 10:29-127, 1978. Google Scholar D. H. Lehmer. Combinatorial problems with digital computers. In Proc. of the Fourth Canadian Math. Congress, pages 160-173, 1957. Google Scholar E. Lucas. Recreations Mathematiques. Gauthier-Villars, Paris, 1891. Google Scholar A. K. Mackworth. Interpreting pictures of polyhedral scenes. Artificial Intelligence, 4:121-137, 1973. Google Scholar A. K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8: 99-118, 1977. Google Scholar A. K. Mackworth. The logic of constraint satisfaction. Artificial Intelligence, 58: 3-20, 1992. Google Scholar A. K. Mackworth and E. C. Freuder. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence, 25:65-74, 247, 1985. Google Scholar A. K. Mackworth and E. C. Freuder. The complexity of constraint satisfaction revisited. Artificial Intelligence, 59:57-62, 1993. Google Scholar A. K. Mackworth, J. A. Mulder, and W. S. Havens. Hierarchical arc consistency: Exploiting structured domains in constraint satisfaction problems. Computational Intelligence, 1:118-126, 1985. Google Scholar D. Maier. The Theory of Relational Databases. Computer Science Press, 1983. Google Scholar J. J. McGregor. Relational consistency algorithms and their application in finding subgraph and graph isomorphisms. Inform. Sci., 19:229-250, 1979. Google Scholar U. Montanari. Networks of constraints: Fundamental properties and applications to picture processing. Inform. Sci., 7:95-132, 1974. Google Scholar N. J. Nilsson. Problem-Solving Methods in Artificial Intelligence. McGraw-Hill, New York, 1971. Google Scholar B. Nudel. Consistent-labeling problems and their algorithms: Expected-complexities and theory-based heuristics. Artificial Intelligence, 21:135-178, 1983. Google Scholar P. W. Purdom Jr. Tree size by partial backtracking. SIAM J. Comput., 7:481-491, 1978. Google Scholar P. W. Purdom Jr. Search rearrangement backtracking and polynomial average time. Artificial Intelligence, 21:117-133, 1983. Google Scholar A. Rosenfeld, R. A. Hummel, and S. W. Zucker. Scene labelling by relaxation operations. IEEE Trans. on Systems, Man, and Cybernetics, SMC-6:420-433, 1976. Google Scholar R. Seidel. A new method for solving constraint satisfaction problems. In Proceedings of the Seventh International Joint Conference on Artificial Intelligence, pages 338-342, Vancouver, 1981. Google Scholar 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. Google Scholar M. Stefik. Planning with constraints (MOLGEN: Part 1). Artificial Intelligence, 16: 111-140, 1981. Google Scholar M. J. Stefik. Planning and meta-planning (MOLGEN: Part 2). Artificial Intelligence, 16:141-169, 1981. Google Scholar G. Sussman and T. Winograd. Micro-planner reference manual. Technical Report AIM-203, MIT Artificial Intelligence Laboratory, July 1 1970. Google Scholar G. J. Sussman and G. L. Steele. CONSTRAINTS: a language for expressing almost-hierarchical descriptions. Artificial Intelligence, 14, 1980. Google Scholar I. E. Sutherland. SKETCHPAD: A man-machine graphical communications system. Technical Report 296, MIT, Lincoln Laboratory, Jan. 1963. Google Scholar J. M. Tenenbaum and H. G. Barrow. Experiments in interpretation-guided segmentation. Artif. Intell, 8(3):241-274, 1977. Google Scholar J. R. Ullmann. Associating parts of patterns. Information and Control, 9(6):583-601, 1966. Google Scholar J. R. Ullmann, R. M. Haralick, and L. G. Shapiro. Computer architecture for solving consistent labelling problems. Comput. J, 28(2):105-111, 1985. MIT Press, 1989. Google Scholar R. L. Walker. An enumerative technique for a class of combinatorial problems. In Combinatorial Analysis, Proceedings of Symposium in Applied Mathematics, Vol X, Amer. Math. Soc., Providence, RI, USA, pages 91-94, 1960. Google Scholar D. Waltz. Understanding line drawings of scenes with shadows. In P. H. Winston, editor, The Psychology of Computer Vision, pages 19-91. McGraw-Hill, 1975. Google Scholar M. V. Wilkes. Constraint-type statements in programming languages.Theoretical Computer Science, 221(1-2):179-210, 1999. Google Scholar K.R. Apt. Principles of Constraint Programming. Cambridge University Press, 2003. Google Scholar K.R. Apt and E. Montfroy. Automatic generation of constraint propagation algorithms for small finite domains. In Proceedings CP'99, pages 58-72, Alexandria VA, 1999. Google Scholar F. Bacchus and T. Walsh. Propagating logical combinations of constraints. In Proceedings IJCAI'05, pages 35-40, Edinburgh, Scotland, 2005. Google Scholar R. Bartak. A general relation constraint: An implementation. In Proceedings of CP'00 Workshop on Techniques for Implementing Constraint Programming Systems (TRICS), pages 30-40, Singapore, 2000. Google Scholar R. Bartak and R. Erben. A new algorithm for singleton arc consistency. In Proceedings FLAIRS'04, Miami Beach FL, 2004. AAAI Press. Google Scholar C. Beeri, R. Fagin, D. Maier, and M. Yannakakis. On the desirability of acyclic database schemes. Journal of the ACM, 30:479-513, 1983. Google Scholar N. Beldiceanu. Pruning for the minimum constraint family and for the number of distinct values constraint family. In Proceedings CP'01, pages 211-224, Paphos, Cyprus, 2001. Google Scholar N. Beldiceanu, M. Carlsson, and J.X. Rampon. Global constraint catalog. Technical Report T2005:08, Swedish Institute of Computer Science, Kista, Sweden, May 2005. Google Scholar F. Benhamou, D.A. McAllester, and P. Van Hentenryck. Clp(intervals) revisited. In Proceedings of the International Symposium on Logic Programming (ILPS'94), pages 124-138, Ithaca, New York, 1994. Google Scholar F. Benhamou and W. Older. Applying interval arithmetic to real, integer and boolean constraints. Journal of Logic Programming, 32:1-24, 1997. Google Scholar H. Bennaceur and M.S. Affane. Partition-k-ac: an efficient filtering technique combining domain partition and arc consistency. In Proceedings CP'01, pages 560-564, Paphos, Cyprus, 2001. Short paper. Google Scholar P. Berlandier. Improving domain filtering using restricted path consistency. In Proceedings IEEE Conference on Artificial Intelligence and Applications (CAIA'95), 1995. Google Scholar C. Bessiere. Arc-consistency and arc-consistency again. Artificial Intelligence, 65: 179-190, 1994. Google Scholar C. Bessiere and M.O. Cordier. Arc-consistency and arc-consistency again. In Proceedings AAAI'93, pages 108-113, Washington D.C., 1993. Google Scholar C. Bessiere and R. Debruyne. Theoretical analysis of singleton arc consistency. In B. Hnich, editor, Proceedings ECAI'04 Workshop on Modelling and solving problems with constraints, pages 20-29, Valencia, Spain, 2004. Google Scholar C. Bessiere and R. Debruyne. Optimal and suboptimal singleton arc consistency algorithms. In Proceedings IJCAI'05, pages 54-59, Edinburgh, Scotland, 2005. Google Scholar C. Bessiere, E. C. Freuder, and J. C. Regin. Using inference to reduce arc consistency computation. In Proceedings IJCAI'95, pages 592-598, Montreal, Canada, 1995. Google Scholar C. Bessiere, E.C. Freuder, and J.C. Regin. Using constraint metaknowledge to reduce arc consistency computation. Artificial Intelligence, 107:125-148, 1999. Google Scholar C. Bessiere, E. Hebrard, B. Hnich, and T. Walsh. The complexity of global constraints. In Proceedings AAAI'04, pages 112-117, San Jose CA, 2004. to appear. Google Scholar C. Bessiere, E. Hebrard, B. Hnich, and T. Walsh. The tractability of global constraints. In Proceedings CP'04, pages 716-720, Toronto, Canada, 2004. Short paper. Google Scholar C. Bessiere, P. Meseguer, E.C. Freuder, and J. Larrosa. On forward checking for non-binary constraint satisfaction. Artificial Intelligence, 141:205-224, 2002. Google Scholar C. Bessiere and J.C. Regin. Arc consistency for general constraint networks: preliminary results. In Proceedings IJCAI'97, pages 398-404, Nagoya, Japan, 1997. Google Scholar C. Bessiere and J.C. Regin. Refining the basic constraint propagation algorithm. In Proceedings IJCAI'01, pages 309-315, Seattle WA, 2001. Google Scholar C. Bessiere, J.C. Regin, R.H.C. Yap, and Y. Zhang. An optimal coarse-grained arc consistency algorithm. Artificial Intelligence, 165:165-185, 2005. Google Scholar C. Bessiere and P. Van Hentenryck. To be or not to be.In Proceedings CP'03, pages 789-794, Kinsale, Ireland, 2003. Short paper. Google Scholar A. Borning. The programming language aspects of thinglab, a constraint-oriented simulation laboratory. ACM Trans. Program. Lang. Syst., 3(4):353-387, 1981. Google Scholar F. Boussemart, F. Hemery, and C. Lecoutre. Revision ordering heuristics for the constraint satisfaction problem. In Proceedings of the CP'04 Workshop on Constraint Propagation and Implementation, pages 29-43, Toronto, Canada, 2004. Google Scholar M. Cadoli and F.M. Donini. A survey on knowledge compilation. AI Communications, 10(3-4):137-150, 1997. Google Scholar K.C.K. Cheng, J.H.M. Lee, and P.J. Stuckey. Box constraint collections for adhoc constraints. In Proceedings CP'03, pages 214-228, Kinsale, Ireland, 2003. Google Scholar A. Chmeiss and P. Jegou. Path-consistency: when space misses time. In Proceedings AAAI'96, pages 196-201, Portland OR, 1996. Google Scholar A. Chmeiss and P. Jegou. Sur la consistance de chemin et ses formes partielles. In Proceedings RFIA'96, pages 212-219, Rennes, France, 1996. (in French). Google Scholar A. Chmeiss and P. Jegou. Efficient path-consistency propagation. International Journal on Artificial Intelligence Tools, 7(2):121-142, 1998. Google Scholar A. Chmeiss and L. Sais. About the use of local consistency in solving CSPs. In Proceedings IEEE-ICTAI'00, pages 104-107, Vancouver, Canada, 2000. Google Scholar C.W. Choi, W. Harvey, J.H.M. Lee, and P.J. Stuckey. Finite domain bounds consistency revisited., December 2004. Google Scholar H. Collavizza, F. Delobel, and M. Rueher. A note on partial consistencies over continuous domains. In Proceedings CP'98, pages 147-161, Pisa, Italy, 1998. Google Scholar M.C. Cooper. An optimal k-consistency algorithm. Google Scholar H. Cros. Compilation et apprentissage dans les reseaux de contraintes. PhD thesis, University Montpellier II, France, 2003. in French. Google Scholar T.B.H. Dao, A. Lallouet, A. Legtchenko, and L. Martin. Indexical-based solver learning. In Proceedings CP'02, pages 541-555, Ithaca NY, 2002. Google Scholar M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201-215, 1960. Google Scholar R. Debruyne. A property of path inverse consistency leading to an optimal pic algorithm. In Proceedings ECAI'00, pages 88-92, Berlin, Germany, 2000. Google Scholar R. Debruyne and C. Bessiere. From restricted path consistency to max-restricted path consistency. In Proceedings CP'97, pages 312-326, Linz, Austria, 1997. Google Scholar R. Debruyne and C. Bessiere. Some practicable filtering techniques for the constraint satisfaction problem. In Proceedings IJCAI'97, pages 412-417, Nagoya, Japan, 1997. Google Scholar R. Debruyne and C. Bessiere. Domain filtering consistencies. Journal of Artificial Intelligence Research, 14:205-230, 2001. Google Scholar R. Dechter. On the expressiveness of networks with hidden variables. In Proceedings AAAI'90, pages 556-562, Boston MA, 1990. Google Scholar R.