Unification factoring for efficient execution of logic programs regards the indexing and unification phases of clause resolution as a single process. This paper formalizes this process through the construction of factoring automata. A polynomial-time algorithm is given for constructing optimal factoring automata which preserve the clause selection strategy of Prolog. More generally, when the clause selection is not fixed, constructing such an optimal automation is shown to be NP-complete, solving an open trie minimization problem.
|Original language||English (US)|
|Number of pages||12|
|Journal||Conference Record of the Annual ACM Symposium on Principles of Programming Languages|
|State||Published - Jan 1 1995|
|Event||Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - San Francisco, CA, USA|
Duration: Jan 22 1995 → Jan 25 1995
ASJC Scopus subject areas