An Adaptation of Dynamic Slicing Techniques for Logic Programming

Program slicing is a process by means of which subparts of a program with a collective meaning are automatically obtained. A number of slicing techniques have been proposed for procedural languages. When the slicing takes into account the actual execution of the program, it is said to be dynamic. In this paper we show how some techniques for dynamic slicing of procedural languages can be adapted to logic programming whose features (e.g. parameter passing, multiple executions of the same syntax, flow of execution dissociated from its syntax, etc.) are distinct from those of procedural languages.