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 Gödel.
CITATION STYLE
Brogi, A., & Guarino, C. (1996). Pruning the search space of logic programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1050, pp. 35–49). Springer Verlag. https://doi.org/10.1007/3-540-60983-0_3
Mendeley helps you to discover research relevant for your work.