Abstract:
The efficiency of resolution-based logic programming languages, such as Prolog, depends critically on selecting and executing sets of applicable clause heads to resolve against subgoals. Traditional approaches to this problem have focused on using indexing to determine the smallest possible applicable set. Despite their usefulness, these approaches ignore the non-determinism inherent in many programming languages to the extent that they do not attempt to optimize execution after the applicable set has been determined.Unification factoring seeks to rectify this omission by regarding the indexing and unification phases of clause resolution as a single process. This article formalizes that process through the construction of factoring automata. A polynomial-time algorithm is given for constructing optimal factoring automata that preserve the clause selection strategy of Prolog. More generally, when the clause selection strategy is not fixed, constructing such an optimal automaton is shown to be NP-complete, solving an open trie minimization problem. Unification factoring is implemented through a source code transformation that preserves the full semantics of Prolog. This transformation is specified in the article, and using it, several well-known programs show significant performance improvements across several different systems. A prototype of unification factoring is available by anonymous ftp.
Bibtex Entry:
@inproceedings{DRRSSSW:POPL95, author = {Steven Dawson and C. R. Ramakrishnan and I. V. Ramakrishnan and Konstantinos Sagonas and Steven Skiena and Terrance Swift and David S. Warren}, title = {Unification Factoring for Efficient Execution of Logic Programs}, booktitle = {ACM Symposium on Principles of Programming Languages}, publisher = {ACM}, pages = {247--258}, year = {1995} }
| Full Paper: | [pdf] |
C. R. Ramakrishnan
(cram@cs.sunysb.edu)