Logic Program Schemas, Constraints and Semi-Unification (1998)
| Venue: | In Proc. of LOPSTR’97, volume 1463 of LNCS |
| Citations: | 9 - 1 self |
BibTeX
@INPROCEEDINGS{Chasseur98logicprogram,
author = {Eric Chasseur and Yves Deville},
title = {Logic Program Schemas, Constraints and Semi-Unification},
booktitle = {In Proc. of LOPSTR’97, volume 1463 of LNCS},
year = {1998},
pages = {69--89},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. Program schemas are known to be useful in different applications such as program synthesis, transformation, analysis, debugging, teaching : : : This paper tackles two complementary aspects of program schemas. We first propose a language for the description of program schemas. It is based on a subset of second-order logic, enhanced with constraints and specific features of program schemas. One of the basic operations on schemas is the semi-unification of a schema with a program. We then express the semi-unification process over schemas as rewriting and reduction rules, using CLP techniques, where constraints are used to guide the semi-unification process. 1 Introduction In logic programming, the use of program schemas is a very promising technique. In program synthesis, program schemas can formalize particular resolution methods (divide-and-conquer, generate-and-test approaches...), as investigated by Flener [3]. Program transformations can advantageously be performed on schemas rat...
Citations
No citations identified.
