Bilkent ACM SIGART (Special Interest Group on Artificial Intelligence)
& Bilkent Computer Eng. & Info. Science Dept.

seminar ,

LOGIC PROGRAMMING TRANSFORMATION THROUGH GENERALIZATION SCHEMATA

Abstract: Programs can be classified according to their construction methodologies, such as divide_and_conquer, generate_and_test, and so on, or any composition thereof. A program schema consists of a template program with a fixed dataflow, but without specific indications about the actual computations, except that they must satisfy certain constraints. A program schema thus abstracts a whole family of particular programs that can be obtained by instantiating its place-holders to particular computations. In schema-guided program transformation, the idea is to pre-compile transformation techniques (such as accumulator introduction) at the schema-level so as to get full automation of the transformation process, via elimination of the eureka discovery step. This also allows the prediction whether and which optimizations will be achieved.