Issue No. 05 - May (1990 vol. 16)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/32.52772
<p>The programming tradeoffs between structure-oriented and clause-oriented operations on data structures in Prolog are limited in current implementations because the assertion of clauses that include uninstantiated variables destroys any binding between these variables and those with which they are unified in the execution of the program. Built-in predicates for Prolog that allow one to assert predicate variables pointers, which are constants, rather than uninstantiated variables, are presented. The author shows: the possible performance benefits of clause-oriented implementations of data structures over equivalent structure-oriented versions, the logical implications of the proposed built-in predicates, and their practical significance by integrating them in C-Prolog and evaluating the two different implementations of the symbol table dictionary in D.H.D. Warren's pseudo-Pascal compiler example.</p>
structure-oriented operations; Warren; computational improvements; Prolog applications; predicate variable pointers; clause-oriented operations; data structures; uninstantiated variables; performance benefits; logical implications; built-in predicates; C-Prolog; symbol table dictionary; pseudo-Pascal compiler; computational complexity; data structures; PROLOG.
G.M. Karam, "Computational Improvements in Prolog Applications by Predicate Variable Pointers", IEEE Transactions on Software Engineering, vol. 16, no. , pp. 490-497, May 1990, doi:10.1109/32.52772