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

Coloring
Specifications

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

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 proceedingConference contribution

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, 732620, Institute of Electrical and Electronics Engineers Inc., pp. 168-176, 13th IEEE International Conference on Automated Software Engineering, ASE 1998, Honolulu, United States, 10/13/98. https://doi.org/10.1109/ASE.1998.732620
Flener P, Zidoum H, Hnich B. Schema-guided synthesis of constraint logic programs. In 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 https://doi.org/10.1109/ASE.1998.732620
Flener, Pierre ; Zidoum, Hamza ; Hnich, Brahim. / Schema-guided synthesis of constraint logic programs. Proceedings - 13th IEEE International Conference on Automated Software Engineering, ASE 1998. Vol. 1998-October Institute of Electrical and Electronics Engineers Inc., 1998. pp. 168-176
@inproceedings{129c529350bd40049f04779a19d69292,
title = "Schema-guided synthesis of constraint logic programs",
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.",
author = "Pierre Flener and Hamza Zidoum and Brahim Hnich",
year = "1998",
month = "1",
day = "1",
doi = "10.1109/ASE.1998.732620",
language = "English",
volume = "1998-October",
pages = "168--176",
booktitle = "Proceedings - 13th IEEE International Conference on Automated Software Engineering, ASE 1998",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

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

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 -