Chapter 11 Modelling

Foundations of Artificial Intelligence

Volumn 2, Issue C, 2006, Pages 377-406

  Smith, Barbara M ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77956784132     PISSN: 15746526     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S1574-6526(06)80015-5     Document Type: Chapter

References (50)

1. Bacchus F., and van Beek P. On the Conversion Between Non-Binary and Binary Constraint Satisfaction Problems. Proceedings AAAI'98 (1998) 311-318
2. Beacham A., Chen X., Sillito J., and van Beek P. Constraint programming lessons learned from crossword puzzles. Proceedings of the 14th Canadian Conference on Artificial Intelligence (2001) 78-87
3. Beldiceanu N. Global constraints as graph properties on structured network of elementary constraints of the same type. Technical Report Technical Report T2000/01, SICS (2000)
4. Bessière C., and Régin J. Enforcing arc consistency on global constraints by solving subproblems on the fly. Proceedings CP'99 (1999) 103-117
5. Borrett J.E., and Tsang E.P. A Context for Constraint Satisfaction Problem Formulation Selection. Constraints 6 (2001) 299-327
6. Cheng B.M.W., Choi K.M.F., Lee J.H.M., and Wu J.C.K. Increasing constraint propagation by redundant modeling: an experience report. Constraints 4 (1999) 167-192
7. (To appear). Cheng K.C.K., and Yap R.H.C. Applying Ad-hoc Global Constraints with the case Constraint to Still-Life. Constraints 11 (2006)
8. (To appear). Choi C.W., Lee J.H.M., and Stuckey P.J. Removing Propagation Redundant Constraints in Redundant Modeling. ACM Transactions on Computational Logic (2006)
9. Dincbas M., Simonis H., and van Hentenryck P. Solving the car-sequencing problem in constraint logic programming. In: Kodratoff Y. (Ed). Proceedings ECAI-88 (1988) 290-295
10. LNCS 2833. Dotú I., del Val A., and Cebrián M. Redundant Modeling for the QuasiGroup Completion Problem. In: Rossi F. (Ed). Principles and Practice of Constraint Programming - CP 2003 (2003), Springer 288-302
11. Fernández A., and Hill P.M. A comparative study of eight constraint programming languages over the Boolean and finite domains. Constraints 5 (2000) 275-301
12. Flener P., Frisch A.M., Hnich B., Kiziltan Z., Miguel I., and Walsh T. Matrix Modelling: Exploiting Common Patterns in Constraint Programming. Proceedings of the International Workshop on Reformulating Constraint Satisfaction Problems - Towards Systematisation and Automation (2002)
13. LNCS 3018. Flener P., Pearson J., and gren M. Introducing ESRA, a relational language for modelling combinatorial problems. In: Bruynooghe M. (Ed). LOPSTR'03: Revised Selected Papers (2004), Springer 214-232
14. Keynote address. Freuder E.C. Modeling: The Final Frontier. Proceedings PACLP99, the 1st International Conference on the Practical Applications of Constraint Technologies and Logic Programming (1999) 15-21
15. Frisch A., Jefferson C., and Miguel I. Symmetry-breaking as a Prelude to Implied Constraints: A Constraint Modelling Pattern. Proceedings of ECAI 2004 (2004) 171-175
16. LNCS 3607. Frisch A.M., Hnich B., Miguel I., Smith B.M., and Walsh T. Transforming and Refining Abstract Constraint Specifications. In: Zucker J.-D., and Saitta L. (Eds). Abstraction, Reformulation and Approximation, 6th International Symposium, Proceedings SARA 2005 (2005), Springer 76-91
17. Frisch A.M., Jefferson C., Martinez Hernandez B., and Miguel I. The Rules of Constraint Modelling. Proceedings IJCAI05 (2005) 311-318
18. Frisch A.M., Miguel I., and Walsh T. Extensions to proof planning for generating implied constraints. Proceedings of Calculemus-01 (2001) 130-141
19. Geelen P.A. Dual Viewpoint Heuristics for Binary Constraint Satisfaction Problems. In: Neumann B. (Ed). Proceedings ECAI'92 (1992) 31-35
20. Available from http://www.dcs.stand.ac.uk/s~cppod/publications/reports/. Gent I., Jefferson C., Lynce I., Miguel I., Nightingale P., Smith B., and Tarim A. Search in the Patience Game 'Black Hole'. Technical Report CPPod-10-2005 (2005), CPPod Research Group
21. Getoor L., Ottosson G., Fromherz M., and Carlson B. Effective Redundant Constraints for Online Scheduling. Proceedings of AAAI'97 (1997) 302-307
22. Harvey W., and Stuckey P.J. Improving Linear Constraint Propagation by Changing Constraint Representation. Constraints 8 (2003) 173-207
23. Henz M. Don't Be Puzzled!. Proceedings of Workshop on Constraint Programming Applications. Aug. (1996)
24. Hnich B. Function Variables for Constraint Programming. PhD thesis, University of Uppsala (2003)
25. LNCS 3419. Hnich B., Prestwich S.D., and Selensky E. Constraint-Based Approaches to the Covering Test Problem. In: Faltings B., Petcu A., Fages F., and Rossi F. (Eds). Recent Advances in Constraints, Joint ERCIM/CoLogNet International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2004, Revised Selected and Invited Papers (2005), Springer 172-186
26. Hnich B., Richardson J., and Flener P. Towards Automatic Generation and Evaluation of Implied Constraints. Technical Report Technical report 2003-014 (2003), Department of Information Technology, Uppsala University
27. Hnich B., Smith B.M., and Walsh T. Dual Models of Permutation and Injection Problems. Journal of Artificial Intelligence Research 21 (2004) 357-391
28. LNCS 2239. Katsirelos G., and Bacchus F. GAC on conjunctions of constraints. In: Walsh T. (Ed). Principles and Practice of Constraint Programming - CP 2001 (2001), Springer, Sweden 610-614
29. Law Y.C., and Lee J.H.M. Model Induction: a New Source of CSP Model Redundancy. Proceedings of the 18th National Conference on Artificial Intelligence (AAAI-2002) (2002) 54-60
30. June. Nadel B.A. Representation Selection for Constraint Satisfaction: A Case Study Using n-Queens. IEEE Expert 5 (1990) 16-23
31. Available from http://www.dcs.stand.ac.uk/~apes/apesreports.html. Petrie K.E., and Smith B.M. Symmetry Breaking in Graceful Graphs. Technical Report APES-56-2003 (2003), APES Research Group
32. Prestwich S., and Beck J.C. Exploiting dominance in three symmetric problems. Fourth International Workshop on Symmetry and Constraint Satisfaction Problems (2004)
33. Proll L.G., and Smith B.M. ILP and Constraint Programming Approaches to a Template Design Problem. INFORMS Journal on Computing 10 (1998) 265-275
34. LNCS 3258. Puget J.-F. Constraint programming next challenge: Simplicity of use. Invited talk. In: Wallace M. (Ed). Principles and Practice of Constraint Programming - CP 2004 (2004), Springer 5-8
35. LNCS 1330. Régin J.-C., and Puget J.-F. A Filtering Algorithm for Global Sequencing Constraints. In: Smolka G. (Ed). Principles and Practice of Constraint Programming - CP97 (1997), Springer-Verlag 32-46
36. Rossi F., Petrie C., and Dhar V. On the Equivalence of Constraint Satisfaction Problems. Proceedings of ECAI-90 (1990) 550-556
37. (Available as a Powerpoint presentation from the author). Simonis H. Finite Domain Constraint Programming Methodology. Tutorial presented at the PACT 2000 conference (2000)
38. LNCS 1870. Simonis H., Cornelissens T., Dumortier V., Fabris G., Nanni F., and Tirabosco A. Using Constraint Visualisation Tools. In: Deransart P., Hermenegildo M.V., and Maluszynski J. (Eds). Analysis and Visualization Tools for Constraint Programming (2000), Springer 321-356
39. Smith B.M. Succeed-first or Fail-first: A Case Study in Variable and Value Ordering Heuristics. In: Wallace M. (Ed). Proceedings PACT97, 3rd International Conference (1997), The Practical Application Company 321-330
40. Smith B.M. Modelling a Permutation Problem. Research Report 2000.18 (2000), School of Computer Studies, University of Leeds
41. Smith B.M. Reducing Symmetry in a Combinatorial Design Problem. Proceedings of CP-AI-OR'01, the International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2001)
42. LNCS 2470. Smith B.M. A Dual Graph Representation of a Problem in 'Life'. In: van Hentenryck P. (Ed). Principles and Practice of Constraint Programming - CP 2002 (2002), Springer 402-414
43. LNCS 3524. Smith B.M. Symmetry and Search in a Network Design Problem. In: Bartak R., and Milano M. (Eds). Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Proceedings of CPAIOR 2005 (2nd International Conference) (2005), Springer 336-350
44. Smith B.M., Stergiou K., and Walsh T. Using auxiliary variables and implied constraints to model non-binary problems. Proceedings AAAI-2000 (Conference of the American Assocation for Artificial Intelligence) (2000) 182-187
45. Tsang E. Foundations of Constraint Satisfaction (1993), Academic Press
46. LNCS 2239. van Beek P., and Wilken K. Fast optimal instruction scheduling for single-issue processors with arbitrary latencies. In: Walsh T. (Ed). Principles and Practice of Constraint Programming - CP 2001 (2001), Springer 625-639
47. van Hentenryck P. Constraint Satisfaction in Logic Programming (1989), MIT Press
48. van Hentenryck P., and Deville Y. The Cardinality Operator: A New Logical Connective and Its Application to Constraint Logic Programming. Proceedings of the 8th International Conference on Logic Programming (ICLP-91) (1991) 745-759
49. Walsh T. SAT v CSP. Proceedings CP'2000 (2000) 441-456
50. LNCS 2833. Walsh T. Constraint patterns. Invited talk. In: Rossi F. (Ed). Principles and Practice of Constraint Programming - CP 2003 (2003), Springer 53-64