Logic program transformation through generalization schemata [extended abstract]

  • Pierre Flener
  • Yves Deville
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1048)


Both generalization techniques are very suitable for mechanical transformation: all operators of the generalized programs are operators of the initial programs. Given a divide-and-conquer program, a mere inspection of the properties of its solving, processing, and composition operators thus allows the detection of which kinds of generalization are possible, and to which optimizations they would lead. The eureka discoveries are compiled away, and the transformations can be completely automated.


Logic Program Composition Operator Program Transformation Generalization Schema Structural Generalization 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Y. Deville. Logic Programming: Systematic Program Development. Addison-Wesley, 1990.Google Scholar
  2. [2]
    P. Flener. Logic Program Synthesis from Incomplete Information. Kluwer, 1995.Google Scholar
  3. [3]
    P. Flener and Y. Deville. Logic Program Transformation through Generalization Schemata. TR BU-CEIS-95xx, Bilkent University, Ankara (Turkey), 1995.Google Scholar
  4. [4]
    N.E. Fuchs and M.P.J. Fromherz. Schema-based transformations of logic programs. In Clement and Lau (eds), Proc. of LOPSTR'91, pp. 111–125. Springer-Verlag, 1992.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Pierre Flener
    • 1
  • Yves Deville
    • 2
  1. 1.Department of Computer Engineering and Information ScienceBilkent UniversityBilkentTurkey
  2. 2.Department of Computing Science and EngineeringUniversité Catholique de LouvainLouvain-la-NeuveBelgium

Personalised recommendations