Abstract
By focusing on the families of assignment and permutation problems (such as graph colouring and n-Queens), we show how to adapt D.R. Smith's (1990) KIDS approach for the synthesis of constraint programs (with implicit constraint satisfaction code), rather than applicative Refine programs with explicit constraint propagation and pruning code. Synthesis is guided by a global search schema and can be fully automated with little effort, due to some innovative ideas. CLP (Sets) programs are equivalent in expressiveness to our input specifications. The synthesised CLP (FD) programs would be, after optimising transformations, competitive with carefully hand-crafted ones.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 13th IEEE International Conference on Automated Software Engineering, ASE 1998 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 168-176 |
| Number of pages | 9 |
| Volume | 1998-October |
| ISBN (Electronic) | 0818687509, 9780818687501 |
| DOIs | |
| Publication status | Published - Jan 1 1998 |
| Event | 13th IEEE International Conference on Automated Software Engineering, ASE 1998 - Honolulu, United States Duration: Oct 13 1998 → Oct 16 1998 |
Other
| Other | 13th IEEE International Conference on Automated Software Engineering, ASE 1998 |
|---|---|
| Country | United States |
| City | Honolulu |
| Period | 10/13/98 → 10/16/98 |
ASJC Scopus subject areas
- Software
- Safety, Risk, Reliability and Quality
Fingerprint Dive into the research topics of 'Schema-guided synthesis of constraint logic programs'. Together they form a unique fingerprint.
Cite this
Flener, P., Zidoum, H., & Hnich, B. (1998). Schema-guided synthesis of constraint logic programs. In Proceedings - 13th IEEE International Conference on Automated Software Engineering, ASE 1998 (Vol. 1998-October, pp. 168-176). [732620] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ASE.1998.732620