Pruning the Search Space of Logic Programs

We analyse the use of pruning operators for reducing the search space of logic programming computations. The synthesis of a few key choices arising in the implementation of pruning operators allows us to compare alternative pruning strategies at a suitably abstract level. In this perspective, we examine the commit operator featured by the language Godel.