Abstract
This work is inspired by D.R. Smith’s research on synthesising global search (GS) programs (in the Refine language) from first-order logic specifications (also in Refine) [8,9,10]. We concentrate on synthesising constraint logic programs (CLP) [6] instead. We thus only have to synthesise code that (incrementally) poses the constraints, because the actual constraint propagation and pruning are performed by the CLP system. We here only tackle the family of decision assignment problems; the families of optimisation assignment problems, decision permutation problems, and optimisation permutation problems are covered in [4].
A full version of this extended abstract is published as [4].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Reference
F. Ambert, B. Legeard, et E. Legros. Programmation en logique avec contraintes sur ensembles et multi-ensembles héréditairement finis. TSI 15(3):297–328, 1996.
D. Diaz and Ph. Codognet. A minimal extension of the WAM for clp(FD). In: D.S. Warren (ed), Proc. of ICLP’93, pp. 774–790. The MIT Press, 1993.
P. Flener, K.-K. Lau, and M. Ornaghi. Correct-schema-guided synthesis of steadfast programs. Proc. of ASE’97, pp. 153–160. IEEE Computer Society Press, 1997.
P. Flener, H. Zidoum, and B. Hnich. Schema-guided synthesis of constraint logic programs. Proc. of ASE’98. IEEE Computer Society Press, 1998.
N.E. Fuchs and U. Schwertel. Attempto Controlled English — Not just another logic specification language. This volume.
J. Jaffar and M.J. Maher. Constraint logic programming: A survey. J. of Logic Programming 19–20:503–582, 1994.
D.R. Smith. Top-down synthesis of divide-and-conquer algorithms. Artificial Intelligence 27(1):43–96, 1985.
D.R. Smith. The structure and design of global search algorithms. TR KES.U.87.12, Kestrel Institute, 1988.
D.R. Smith. Kids: A semiautomatic program development system. IEEE Trans. Software Engineering 16(9):1024–1043, 1990.
D.R. Smith. Towards the synthesis of constraint propagation algorithms. In: Y. Deville (ed), Proc. of LOPSTR’93, pp. 1–9, Springer-Verlag, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zidoum, H., Flener, P., Hnich, B. (1999). Schema-Guided Synthesis of CLP Programs. In: Flener, P. (eds) Logic-Based Program Synthesis and Transformation. LOPSTR 1998. Lecture Notes in Computer Science, vol 1559. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48958-4_18
Download citation
DOI: https://doi.org/10.1007/3-540-48958-4_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65765-1
Online ISBN: 978-3-540-48958-0
eBook Packages: Springer Book Archive