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 |
Fingerprint
ASJC Scopus subject areas
- Software
- Safety, Risk, Reliability and Quality
Cite this
Schema-guided synthesis of constraint logic programs. / Flener, Pierre; Zidoum, Hamza; Hnich, Brahim.
Proceedings - 13th IEEE International Conference on Automated Software Engineering, ASE 1998. Vol. 1998-October Institute of Electrical and Electronics Engineers Inc., 1998. p. 168-176 732620.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Schema-guided synthesis of constraint logic programs
AU - Flener, Pierre
AU - Zidoum, Hamza
AU - Hnich, Brahim
PY - 1998/1/1
Y1 - 1998/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0346789384&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0346789384&partnerID=8YFLogxK
U2 - 10.1109/ASE.1998.732620
DO - 10.1109/ASE.1998.732620
M3 - Conference contribution
AN - SCOPUS:0346789384
VL - 1998-October
SP - 168
EP - 176
BT - Proceedings - 13th IEEE International Conference on Automated Software Engineering, ASE 1998
PB - Institute of Electrical and Electronics Engineers Inc.
ER -