Implementation of pruning operators in logic programming

Pruning operators are used to reduce the search tree in logic programming computation. Pruning operators typically are not declarative, result in a number of semantic problems. We focus on the pruning operator in Gödel, called commit, which can be used to prune away parts of a search tree and not destroy the declarative semantics of program. We propose the method to realize the control facility in logic programming language which can support the fully implementation of Gödel.