Transforming and refining abstract constraint specifications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3607 LNAI, Issue , 2005, Pages 76-91

  Frisch, Alan M ^a   Hnich, Brahim ^b   Miguel, Ian ^c   Smith, Barbara M ^b   Walsh, Toby ^d  

^a UNIVERSITY OF YORK   (United Kingdom)

^b UNIVERSITY COLLEGE CORK   (Ireland)

^c UNIVERSITY OF ST ANDREWS   (United Kingdom)

^d CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; MATHEMATICAL MODELS; PROBLEM SOLVING;

ABSTRACT SPECIFICATION; CONSTRAINT SPECIFICATIONS; EXPERT MODELLERS; FIBRE-OPTIC COMMUNICATION PROBLEM;

CONSTRAINT THEORY;

EID: 26944461938     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11527862_6     Document Type: Conference Paper

References (25)

1. A. Abbas and E.P.K. Tsang. Toward a general language for the specification of constraint satisfaction problems. Proc. Constraint Programming, Artificial Intelligence and Operations Research (CP-AI-OR) Wshop, 2001.
2. J.E. Borrett. Formulation selection for constraint satisfaction problem: a heuristic approach. PhD Thesis, Dept. of Computer Science, University of Essex, UK, 1998.
3. J.E. Borrett and E.P.K. Tsang. A context for constraint satisfaction problem formulation selection. Constraints, 6(4):299-327, 2001.
4. R. Bradwell, J. Ford, P. Mills, E.P.K. Tsang, and R. Williams. An overview of the CACP project: modelling and solving constraint satisfaction/optimisation problems with minimal expert intervention. Proc. Wshop on Analysis and Visualization of Constraint Programs & Solvers, 2000.
5. A. Bundy. A Science of Reasoning. J-L. Lassez and G, Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson, 178-198, 1991.
6. M. Cadoli and A. Schaerf. Compiling program specifications into SAT. Proc. ESOP'01. LNCS 2028. Springer-Verlag, 2001.
7. M. Cadoli, L. Palopoli, A. Schaerf, and D. Vasile. NP-SPEC: An executable specification language for solving all problems in NP. Proc. PADL'99, pp. 16-30. LNCS 1551. Springer-Verlag, 1999.
8. P. Flener, A.M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, T. Walsh. Matrix Modelling: Exploiting Common Patterns in Constraint Programming Proc. Int. Wshop on Reformulating CSPs, 2002.
9. P. Flener, A. M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, J. Pearson, and T. Walsh. Breaking Row and Column Symmetries in Matrix Models. Proc. 8th Int. Conf. on Principles & Practice of CP LNCS 2470, 2002.
10. P. Flener, J. Pearson, and M. Agren. Introducing ESRA, a relational language for modelling combinatorial problems. LOPSTR'03: Revised Selected Papers, LNCS 3018, 2004.
11. A.M. Frisch, B. Hnich, Z. Kiziltan, I. Miguel, T. Walsh. Global Constraints for Lexicographic Orderings. Proc. 8th Int. Conf. on Principles & Practice of CP LNCS 2470, 2002.
12. A.M. Frisch, C. Jefferson, B. Martínez-Hernández, I. Miguel. The Rules of Constraint Modelling. Proc. 19th Int. Joint Conf. on AI, 2005.
13. A.M. Frisch, C. Jefferson, I. Miguel. Symmetry Breaking as a Prelude to Implied Constraints: A Constraint Modelling Pattern. Proc. 16th Euro. Conf. on AI, 171-175, 2004.
14. A.M. Frisch, I. Miguel, and T. Walsh. CGRASS: A System for Transforming Constraint Satisfaction Problems. Proc. Joint Wshop of the ERCIM/CologNet Area on CP & CLP, LNCS 2627, 23-26, 2002.
15. I. P. Gent and B. M. Smith. Symmetry Breaking During Search in Constraint Programming. Proc. European Conf. on AI, 599-603, 2000.
16. F. Giunchiglia, T. Walsh. A Theory of Abstraction. Artificial Intelligence 56(2-3), 323-390, 1992
17. B. Hnich. Function Variables for Constraint Programming. PhD Thesis, University of Uppsala, 2003.
18. B. Hnich, B.M. Smith and T. Walsh. Models of Permutation and Injection Problems. Journal of Artificial Intelligence Research, 21, 2004.
19. J-L. Lauriere. A language and a program for stating and solving combinatorial problems. Artificial Intelligence, 10(1):29-127, 1978.
20. A.K. Mackworth. Constraint Satisfaction Problems. Encyclopedia of AI, 285-293, 1992.
21. P. Mills, E.P.K. Tsang, R. Williams, J. Ford, and J. Borrett. EaCL 1.5: An Easy abstract Constraint optimisation Programming Language, TR CSM-324, University of Essex, 1999.
22. H.D. Sherali and J.C. Smith. Improving Discrete Model Representations via Symmetry Considerations. Management Science 47, 1396-1407, 2001.
23. B. M. Smith Symmetry and Search in a Network Design Problem. Proc. 2nd Int. Conf. on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), LNCS 3524, 336-350, 2005.
24. D.R. Smith. The structure and design of global search algorithms. TR KES.U.87.12, Kestrel Institute, 1988.
25. B. M. Smith, K. Stergiou, and T. Walsh. Modelling the Golomb Ruler Problem. Proc. IJCAI-99 Wshop on Non-Binary Constraints. Int. Joint Conf. on AI, 1999.