Schema-Guided Synthesis of CLP Programs

  • Hamza Zidoum
  • Pierre Flener
  • Brahim Hnich
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1559)


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].


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    P. Flener, H. Zidoum, and B. Hnich. Schema-guided synthesis of constraint logic programs. Proc. of ASE’98. IEEE Computer Society Press, 1998.Google Scholar
  5. 5.
    N.E. Fuchs and U. Schwertel. Attempto Controlled English — Not just another logic specification language. This volume.Google Scholar
  6. 6.
    J. Jaffar and M.J. Maher. Constraint logic programming: A survey. J. of Logic Programming 19–20:503–582, 1994.CrossRefMathSciNetGoogle Scholar
  7. 7.
    D.R. Smith. Top-down synthesis of divide-and-conquer algorithms. Artificial Intelligence 27(1):43–96, 1985.zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    D.R. Smith. The structure and design of global search algorithms. TR KES.U.87.12, Kestrel Institute, 1988.Google Scholar
  9. 9.
    D.R. Smith. Kids: A semiautomatic program development system. IEEE Trans. Software Engineering 16(9):1024–1043, 1990.CrossRefGoogle Scholar
  10. 10.
    D.R. Smith. Towards the synthesis of constraint propagation algorithms. In: Y. Deville (ed), Proc. of LOPSTR’93, pp. 1–9, Springer-Verlag, 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Hamza Zidoum
    • 1
  • Pierre Flener
    • 2
  • Brahim Hnich
    • 3
  1. 1.UAE UniversityAl-AïnUnited Arab Emirates
  2. 2.Dept of Info ScienceUppsala Univ.UppsalaSweden
  3. 3.Dept of Info TechnologyTampere Univ. of TechnologyTampereFinland

Personalised recommendations