Schema-guided synthesis of constraint logic programs

Pierre Flener, Hamza Zidoum, Brahim Hnich

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

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 languageEnglish
Title of host publicationProceedings - 13th IEEE International Conference on Automated Software Engineering, ASE 1998
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages168-176
Number of pages9
Volume1998-October
ISBN (Electronic)0818687509, 9780818687501
DOIs
Publication statusPublished - Jan 1 1998
Event13th IEEE International Conference on Automated Software Engineering, ASE 1998 - Honolulu, United States
Duration: Oct 13 1998Oct 16 1998

Other

Other13th IEEE International Conference on Automated Software Engineering, ASE 1998
CountryUnited States
CityHonolulu
Period10/13/9810/16/98

    Fingerprint

ASJC Scopus subject areas

  • Software
  • Safety, Risk, Reliability and Quality

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