Add to ORKGAbstract. When specializing programs one can increase efficiency by reducing nondeterminism. We consider constraint logic programs and we propose a technique which, by making use of a new transformation rule called clause splitting, allows us to generate efficient, specialized programs which are deterministic. We have applied our technique to the specialization of pattern matching programs.
In the literature there are various papers which illustrate the relationship between the unfold/fold...
Approximate descriptions of the success set of a program have many uses in program development and ...
Constraint programming is an alternative approach to programming in which the programming process \u...
Abstract — The reduction of nondeterminism can increase efficiency when specializing programs. We co...
Program specialization is a collection of program transformation techniques for improving program ef...
Program specialization is a program transformation methodology which improves program efficiency by ...
Program specialization is a collection of program transformation techniques for improving program ef...
We consider the problem of specializing constraint logic programs w.r.t. constrained queries. We fol...
We address the problem of specializing a constraint logic program w.r.t. a constrained atom which sp...
AbstractWe address the problem of specializing a constraint logic program w.r.t. a constrained atom ...
There has been a lot of interest lately from people solving constrained optimization problems for co...
Abstract. Recent work have exhibited specific structure among combinatorial problem instances that c...
This chapter addresses the integration of constraints and search into programming lan-guages from th...
A major difficulty with logic programming is combinatorial explosion: since goals are solved with po...
We address the problem of designing constraint logic languages that usefully combine backward and fo...
In the literature there are various papers which illustrate the relationship between the unfold/fold...
Approximate descriptions of the success set of a program have many uses in program development and ...
Constraint programming is an alternative approach to programming in which the programming process \u...
Abstract — The reduction of nondeterminism can increase efficiency when specializing programs. We co...
Program specialization is a collection of program transformation techniques for improving program ef...
Program specialization is a program transformation methodology which improves program efficiency by ...
Program specialization is a collection of program transformation techniques for improving program ef...
We consider the problem of specializing constraint logic programs w.r.t. constrained queries. We fol...
We address the problem of specializing a constraint logic program w.r.t. a constrained atom which sp...
AbstractWe address the problem of specializing a constraint logic program w.r.t. a constrained atom ...
There has been a lot of interest lately from people solving constrained optimization problems for co...
Abstract. Recent work have exhibited specific structure among combinatorial problem instances that c...
This chapter addresses the integration of constraints and search into programming lan-guages from th...
A major difficulty with logic programming is combinatorial explosion: since goals are solved with po...
We address the problem of designing constraint logic languages that usefully combine backward and fo...
In the literature there are various papers which illustrate the relationship between the unfold/fold...
Approximate descriptions of the success set of a program have many uses in program development and ...
Constraint programming is an alternative approach to programming in which the programming process \u...