Results 1 
1 of
1
Logic Program Schemas, SemiUnification and Constraints
 In: N.E. Fuchs (ed), Proc. of LOPSTR'97 (this volume
"... The use of schemas is a classical way of synthesizing, transforming and analyzing logic programs. Operations on schemas are needed, in particular, the semiunification of schemas with programs. Since schemas are secondorder objects, the related semiunification is the secondorder semiunification, ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
The use of schemas is a classical way of synthesizing, transforming and analyzing logic programs. Operations on schemas are needed, in particular, the semiunification of schemas with programs. Since schemas are secondorder objects, the related semiunification is the secondorder semiunification, which is decidable but NPcomplete. The nondeterminism implied by the NPcompleteness slows down the search for a substitution. The present paper expresses the semiunification process over schemas as rewriting and reduction rules. Global and local constraints are associated to the schema to extend the expressivity of schema description and to fasten the search for a secondorder substitution between programs and schemas. CLP techniques and notations are used. 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 (divideandconquer, generateandtest approaches...),...