Download:
|
by Hamza Zidoum Pierre Flener
In D.F. Redmiles and B. Nuseibeh (eds), Proc. of ASE'98
http://www.dis.uu.se/~pierref/astra/../pub/LOPSTR98.pre.ps.gz
Add To MetaCart
Abstract:
By focusing on the family of assignment problems (such as graph colouring, n-Queens, etc), we show how to adapt D.R. Smith's Kids approach for the synthesis of constraint programs, rather than applicative Refine programs with explicit constraint propagation and pruning code. Synthesis is guided by a global search program 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. After optimisations, the synthesised programs would be competitive with hand-crafted ones.
Citations
|
655
|
Constraint Logic Programming: A Survey
– Jaffar, Maher
- 1994
|
|
211
|
KIDS: A semiautomatic program development system
– Smith
- 1990
|
|
76
|
Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Language
– Gervet
- 1997
|
|
44
|
Top-down synthesis of divide-and-conquer algorithms
– Smith
- 1985
|
|
44
|
Structure and design of global search algorithms
– Smith
- 1987
|
|
35
|
A minimal extension of the WAM for clp(FD
– Codognet, Diaz
- 1993
|
|
25
|
Middle-out reasoning for logic program synthesis
– Kraan, Basin, et al.
- 1993
|
|
13
|
Correct-schema-guided synthesis of steadfast programs
– Flener, Lau, et al.
- 1993
|
|
12
|
A formal approach to deductive synthesis of constraint logic programs
– Lau, Ornaghi
- 1995
|
|
7
|
Programmation en logique avec contraintes sur ensembles et multi-ensembles h'er'editairement finis. Techniques et Sciences Informatiques 15(3):297--328
– Ambert, Legeard, et al.
- 1996
|
|
6
|
Towards the synthesis of constraint propagation algorithms
– Smith
- 1994
|
|
5
|
Construction of CLP programs
– Deville, Hentenryck
- 1992
|