Schema-Guided Synthesis of CLP Programs

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

Authors

• Hamza Zidoum
• Pierre Flener
• Brahim Hnich

Keywords

No keywords are indexed for this paper.