Conjunctive Partial Deduction

10 December 2018

Partial deduction is a source-to-source transformation for logic programming, which is similar to supercompilation. It improves the behavior of programs by deforestation (getting rid of intermediate data structures) and tupling (avoiding repeating sub-computations). We will talk about the advantages of considering the whole conjunctions while driving, and how to ensure termination of the transformation.

Supplementary materials:

Danny De Schreye, RobertGlück, Jesper Jørgensen, Michael Leuschel, Bern Martensa, Morten HeineSørensen. Conjunctive partial deduction: foundations, control, algorithms, and experiments.

Presenter: Ekaterina Verbitskaya