CGRASS: A system for transforming constraint satisfaction problems

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

Volumn 2627, Issue , 2003, Pages 15-30

  Frisch, Alan M ^a   Miguel, Ian ^a   Walsh, Toby ^b  

^a UNIVERSITY OF YORK   (United Kingdom)

^b UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTER CIRCUITS; COMPUTER PROGRAMMING LANGUAGES; LOGIC PROGRAMMING; AUTOMATION; FORMAL LOGIC; MATHEMATICAL MODELS; PROBLEM SOLVING;

CONSTRAINT GENERATION; MODEL TRANSFORMATION; PROBLEM FORMULATION; PROBLEM INSTANCES; PROBLEM MODELING; REDUNDANT CONSTRAINTS; SYMMETRY-BREAKING; SYSTEMATIC SEARCHES;

CONSTRAINT SATISFACTION PROBLEMS; CONSTRAINT THEORY;

CONSTRAINT GENERATION; CONSTRAINT SATISFACTION PROBLEMS (CSP); REDUNDANT CONSTRAINTS; SYMMETRY-BREAKING SYSTEMS;

EID: 7044249168     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36607-5_2     Document Type: Conference Paper

References (16)

1. R. Boppana and M. M. Halldórsson. Approximating maximum independent sets by excluding subgraphs. BIT, 32:180–196, 1992.
2. A. Bundy. A science of reasoning. In J-L. Lassez and G. Plotkin, editors, Computational Logic: Essays in Honor of Alan Robinson, pages 178–198. MIT Press, 1991.
3. S. Colton. Automated Theory Formation in Pure Mathematics. Springer-Verlag, 2002.
4. S. Colton and I. Miguel. Constraint generation via automated theory formation. In T.Walsh, editor, Proceedings of the Seventh International Conference on Principles and Practice of Constraint Programming, pages 575–579, 2001.
5. A.K. Dewdney. Computer recreations. Scientific American, pages 16–20, December 1985.
6. M.D. Ernst, T. D. Millstein, and D. S. Weld. Automatic SAT-compilation of planning problems. In Proceedings of the 15th International Joint Conference on Artificial Intelligence, pages 1169–1176, 1997.
7. A.M. Frisch, B. Hnich, I. Miguel, B.M. Smith, and T. Walsh. Towards model reformulation at multiple levels of abstraction. In Proceedings of the International Workshop on Reformulating Constraint Satisfaction Problems, pages 42–56, 2002.
8. A.M. Frisch, I. Miguel, and T. Walsh. Extensions to proof planning for generating implied constraints. In Proceedings of Calculemus-01, pages 130–141, 2001.
9. T. Frühwirth. Theory and practice of constraint handling rules. In P. Stuckey and K. Marriot, editors, Journal of Logic Programming, Special Issue on Constraint Logic Programming, volume 37(1–3), pages 95–138, 1998.
10. A. Ireland. The Use of Planning Critics in Mechanizing Inductive Proof. In Proceedings of LPAR’92, Lecture Notes in Artificial Intelligence 624. Springer-Verlag, 1992. Also available as Research Report 592, Dept of AI, Edinburgh University.
11. G.F. Luger and W. A. Stubblefield. Artificial Intelligence: Structures and Strategies for Complex Problem Solving. Addison-Wesley, 1998.
12. S Muggleton. Inverse entailment and Progol. New Generation Computing, 13:245–286, 1995.
13. J.C. Régin. A filtering algorithm for constraints of difference in CSPs. In Proceedings of the 12th National Conference on AI, pages 362–367. American Association for Artificial Intelligence, 1994.
14. B. Smith, K. Stergiou, and T. Walsh. Using auxiliary variables and implied constraints to model non-binary problems. In Proceedings of the 16th National Conference on AI, pages 182–187. AAAI, 2000.
15. B.M. Smith, K. Stergiou, and T. Walsh. Modelling the Golomb ruler problem. In Proceedings of the IJCAI-99 Workshop on Non-Binary Constraints. International Joint Conference on Artificial Intelligence, 1999.
16. P. van Hentenryck. The OPL Optimization Programming Language. The MIT Press, 1999.