Compiling high-level type constructors in constraint programming

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

Volumn 1990, Issue , 2001, Pages 229-244

  Flener, Pierre ^a   Hnich, Brahim ^a   Kızıltan, Zeynep ^a  

^a UPPSALA UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT SATISFACTION PROBLEMS; CONSTRAINT THEORY;

CONSTRAINT PROGRAMMING; CONSTRAINT PROGRAMMING LANGUAGES; REWRITE RULES; SET CONSTRAINTS;

HIGH LEVEL LANGUAGES;

EID: 84949219285     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45241-9_16     Document Type: Conference Paper

References (16)

1. F. Ambert, B. Legeard, and E. Legros. Programmation en logique avec contraintes sur ensembles et multi-ensembles hereditairement finis. Techniques et Sciences Informatiques 15(3):297–328, 1996.
2. L. Blaine, L. Gilham, J. Liu, D.R. Smith, and S. Westfold. PlanWare: Domainspecific synthesis of high-performance schedulers. In Proc of ASE’98, pp. 270–279. IEEE Computer Society Press, 1998.
3. M. Cadoli, L. Palopoli, A. Schaerf, and D. Vasile. np-spec: An executable specification language for solving all problems in NP. In: G. Gupta (ed), Proc of PADL’99, pp. 16–30. LNCS 1551. Springer-Verlag, 1999.
4. A. Dovier, C. Piazza, E. Pontelli, and G. Rossi. On the representation and management of finite sets in CLP-languages. In: J. Jaffar (ed), Proc of JICSLP’98, pp. 40–54. The MIT Press, 1998.
5. P. Flener, H. Zidoum, and B. Hnich. Schema-guided synthesis of constraint logic programs. In Proc of ASE’98, pp. 168–176. IEEE Computer Society Press, 1998.
6. P. Flener and B. Hnich. The Syntax and Semantics of esra. astra Internal Report. Available via http://www.dis.uu.se/∼pierref/astra/.
7. P. Flener, B. Hnich, and Z. Kızıltan. A meta-heuristic for subset problems. In: I.V. Ramakrishnan (ed), Proc of PADL’01. LNCS, this volume. Springer-Verlag, 2001.
8. C. Gervet. Interval propagation to reason about sets: Definition and implementation of a practical language. Constraints 1(3):191–244, 1997.
9. B. Hnich and P. Flener. High-level reformulation of constraint programs. Submitted for review. Available via http://www.dis.uu.se/∼pierref/astra/.
10. Z. Kızıltan, P. Flener, and B. Hnich. A labelling heuristic for subset problems. Submitted for review. Available via http://www.dis.uu.se/∼pierref/astra/.
11. T. Müller. Solving set partitioning problems with constraint programming. In Proc of PAPPACT’98, pp. 313–332. The Practical Application Company, 1998.
12. D.R. Smith. The structure and design of global search algorithms. Tech Rep KES.U.87.12, Kestrel Institute, 1988.
13. D.R. Smith. kids: A semi-automatic program development system. IEEE Trans. on Software Engineering 16(9):1024–1043, 1990.
14. D.R. Smith. Toward a classification approach to design. In Proc of AMAST’96, pp. 62–84. LNCS 1101. Springer-Verlag, 1996.
15. E. Tsang, P. Mills, R. Williams, J. Ford, and J. Borrett. A computer-aided constraint programming system. In: J. Little (ed), Proc of PACLP’99, pp. 81–93. The Practical Application Company, 1999.
16. P. Van Hentenryck. The opl Optimization Programming Language. The MIT Press, 1999.