Schema-guided synthesis of constraint logic programs

Pierre Flener; Hamza Zidoum; Brahim Hnich

doi:10.1109/ASE.1998.732620

Schema-guided synthesis of constraint logic programs

Pierre Flener, Hamza Zidoum, Brahim Hnich

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 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
ISBN (Electronic)	0818687509, 9780818687501
DOIs	https://doi.org/10.1109/ASE.1998.732620
Publication status	Published - 1998
Externally published	Yes
Event	13th IEEE International Conference on Automated Software Engineering, ASE 1998 - Honolulu, United States Duration: Oct 13 1998 → Oct 16 1998

Publication series

Name	Proceedings - 13th IEEE International Conference on Automated Software Engineering, ASE 1998
Volume	1998-October

Other

Other	13th IEEE International Conference on Automated Software Engineering, ASE 1998
Country/Territory	United States
City	Honolulu
Period	10/13/98 → 10/16/98

ASJC Scopus subject areas

Software
Safety, Risk, Reliability and Quality

Access to Document

10.1109/ASE.1998.732620

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 (pp. 168-176). Article 732620 (Proceedings - 13th IEEE International Conference on Automated Software Engineering, ASE 1998; Vol. 1998-October). 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. Institute of Electrical and Electronics Engineers Inc., 1998. p. 168-176 732620 (Proceedings - 13th IEEE International Conference on Automated Software Engineering, ASE 1998; Vol. 1998-October).

Research output: Chapter in Book/Report/Conference proceeding › Conference 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., 732620, Proceedings - 13th IEEE International Conference on Automated Software Engineering, ASE 1998, vol. 1998-October, 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. Institute of Electrical and Electronics Engineers Inc. 1998. p. 168-176. 732620. (Proceedings - 13th IEEE International Conference on Automated Software Engineering, ASE 1998). doi: 10.1109/ASE.1998.732620

@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",

note = "Publisher Copyright: {\textcopyright} 1998 IEEE.; 13th IEEE International Conference on Automated Software Engineering, ASE 1998 ; Conference date: 13-10-1998 Through 16-10-1998",

year = "1998",

doi = "10.1109/ASE.1998.732620",

language = "English",

series = "Proceedings - 13th IEEE International Conference on Automated Software Engineering, ASE 1998",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "168--176",

booktitle = "Proceedings - 13th IEEE International Conference on Automated Software Engineering, ASE 1998",

}

TY - GEN

T1 - Schema-guided synthesis of constraint logic programs

AU - Flener, Pierre

AU - Zidoum, Hamza

AU - Hnich, Brahim

PY - 1998

Y1 - 1998

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

T3 - Proceedings - 13th IEEE International Conference on Automated Software Engineering, ASE 1998

SP - 168

EP - 176

BT - Proceedings - 13th IEEE International Conference on Automated Software Engineering, ASE 1998

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 13th IEEE International Conference on Automated Software Engineering, ASE 1998

Y2 - 13 October 1998 through 16 October 1998

ER -

Schema-guided synthesis of constraint logic programs

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this